Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H. K. Ng and P. Mandayam, Phys. Rev. A 81, 062342 (2010)] of using the transpose channel for the approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.
Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H. K. Ng and P. Mandayam, Phys. Rev. A 81, 062342 (2010)] of using the transpose channel for the approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.
We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions and generalize them to a set of conditions for approximate QEC (AQEC) codes. This forms the basis of a simple algorithm for finding AQEC codes. Our analytical approach is a departure from earlier work relying on exhaustive numerical search for the optimal recovery map, with optimality defined based on entanglement fidelity. For the practically useful case of codes encoding a single qubit of information, our algorithm is particularly easy to implement.
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.
We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions, and generalize them to a set of conditions for approximate QEC (AQEC) codes. This forms the basis of a simple algorithm for finding AQEC codes. Our analytical approach is a departure from earlier work relying on exhaustive numerical search for the optimal recovery map, with optimality defined based on entanglement fidelity. For the practically useful case of codes encoding a single qubit of information, our algorithm is particularly easy to implement.
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery.
To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.
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.
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.