We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error correction (AQEC). As our first contribution, we introduce a measurement-based rounding scheme that extracts inner sequences of certifiably good encoder-decoder pairs from this outer hierarchy. To address the computational complexity of evaluating fixed levels of the hierarchy, we investigate the use of symmetry-based dimension reduction. In particular, we combine noise symmetries - such as those present in multiple copies of the qubit depolarizing channel - with the permutational symmetry arising from the extendability of the optimization variable. This framework is illustrated through basic, but already challenging numerical examples that showcase its practical effectiveness. Our results contribute to narrowing the gap between theoretical developments in quantum information theory and their practical applications in the analysis of small-scale quantum error-correcting codes.
We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error correction (AQEC). As our first contribution, we introduce a measurement-based rounding scheme that extracts inner sequences of certifiably good encoder-decoder pairs from this outer hierarchy. To address the computational complexity of evaluating fixed levels of the hierarchy, we investigate the use of symmetry-based dimension reduction. In particular, we combine noise symmetries - such as those present in multiple copies of the qubit depolarizing channel - with the permutational symmetry arising from the extendability of the optimization variable. This framework is illustrated through basic, but already challenging numerical examples that showcase its practical effectiveness. Our results contribute to narrowing the gap between theoretical developments in quantum information theory and their practical applications in the analysis of small-scale quantum error-correcting codes.
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta-Borderi-Fawzi-Scholz, Mathematical Programming, 2021] introduced an asymptotically converging semidefinite programming hierarchy of outer bounds for this quantity. However, the size of the semidefinite programs (SDPs) grows exponentially with respect to the level of the hierarchy, thus making their computation unscalable. In this work, by exploiting the symmetries in the SDP, we show that, for a fixed output dimension of the quantum channel, we can compute the SDP in time polynomial with respect to the level of the hierarchy and input dimension. As a direct consequence of our result, the optimal fidelity can be approximated with an accuracy of$\epsilon in\mathrm {poly}(1/\epsilon, \text {input dimension})time,comparedtothe\exp (1/\epsilon, \text {input dimension})$running time required for direct computation.
Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.
We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form Tr[M(X⊗Y)], maximized with respect to semidefinite constraints on X and Y. Applied to the problem of quantum error correction this gives hierarchies of efficiently computable outer bounds on the optimal fidelity for any message dimension and error model. The first level of our hierarchies corresponds to the non-signalling assisted fidelity previously studied by [Leung & Matthews, IEEE Trans.~Inf.~Theory 2015], and positive partial transpose constraints can be added and used to give a sufficient criterion for the exact convergence at a given level of the hierarchy. To quantify the worst case convergence speed of our hierarchies, we derive novel quantum de Finetti theorems that allow imposing linear constraints on the approximating state. In particular, we give finite de Finetti theorems for quantum channels, quantifying closeness to the convex hull of product channels as well as closeness to local operations and classical forward communication assisted channels. As a special case this constitutes a finite version of Fuchs-Schack-Scudo's asymptotic de Finetti theorem for quantum channels. Finally, our proof methods also allow us to answer an open question from [Brand\~ao & Harrow, STOC 2013] by improving the approximation factor of de Finetti theorems with no symmetry from O(dk/2) to poly(d,k), where d denotes local dimension and k the number of copies.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
Abstract We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form Tr[H(D⊗E)] Tr [ H ( D ⊗ E ) ] , maximized with respect to semidefinite constraints on D and E. Applied to the problem of approximate error correction in quantum information theory, this gives hierarchies of efficiently computable outer bounds on the success probability of approximate quantum error correction codes in any dimension. The first level of our hierarchies corresponds to a previously studied relaxation (Leung and Matthews in IEEE Trans Inf Theory 61(8):4486, 2015) and positive partial transpose constraints can be added to give a sufficient criterion for the exact convergence at a given level of the hierarchy. To quantify the worst case convergence speed of our sum-of-squares hierarchies, we derive novel quantum de Finetti theorems that allow imposing linear constraints on the approximating state. In particular, we give finite de Finetti theorems for quantum channels, quantifying closeness to the convex hull of product channels as well as closeness to local operations and classical forward communication assisted channels. As a special case this constitutes a finite version of Fuchs-Schack-Scudo’s asymptotic de Finetti theorem for quantum channels. Finally, our proof methods answer a question of Brandão and Harrow (Proceedings of the forty-fourth annual ACM symposium on theory of computing, STOC’12, p 307, 2012) by improving the approximation factor of de Finetti theorems with no symmetry from O(dk/2) O ( d k / 2 ) to poly(d,k) poly ( d , k ) , where d denotes local dimension and k the number of copies.
We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.