Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1804.09486 · Physical Review A

Open-system quantum error correction

Yink Loong Len, Hui Khoon Ng

Published Aug 7, 2018• 7 citations
arXivHTMLPDF

Abstract

We study the performance of quantum error correction (QEC) on a system undergoing open-system (OS) dynamics. The noise on the system originates from a joint quantum channel on the system-bath composite, a framework that includes and interpolates between the commonly used system-only quantum noise channel model and the system-bath Hamiltonian noise model. We derive the perfect OSQEC conditions, with QEC recovery only on the system and not the inaccessible bath. When the noise is only approximately correctable, the generic case of interest, we quantify the performance of OSQEC using worst-case fidelity. We find that the leading deviation from unit fidelity after recovery is quadratic in the uncorrectable part, a result reminiscent of past work on approximate QEC for system-only noise, although the approach here requires the use of different techniques than in past work.

DOI
10.1103/physreva.98.022307

Related papers

Towards a unified framework for approximate quantum error correction

Prabha Mandayam, Hui Khoon Ng

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.

arXiv:1202.5139•Physical Review A•Jul 27, 2012•40 citations

Noise-Resilient Quantum Evolution in Open Systems through Error-Correcting Frameworks

Nirupam Basak, Goutam Paul, Pritam Chattopadhyay

We analyze quantum state preservation in open quantum systems using quantum error-correcting (QEC) codes explicitly embedded in microscopic system-bath models. Rather than assuming abstract quantum channels, we consider multi-qubit registers coupled to bosonic thermal environments, derive a second-order master equation for the reduced dynamics, and use it to benchmark the five-qubit, Steane, and toric codes under local and collective noise. We compute state fidelities as functions of system-bath coupling strength, bath temperatures, and the number of correction cycles. In the low-temperature regime, repeated error correction with the five-qubit code significantly suppresses decoherence and relaxation for weak-to-moderate couplings. In the high-temperature regime, thermal excitations reduce the effectiveness of all codes, although within the parameter range studied, the five-qubit code still yields the highest fidelities among the three codes. For two-qubit Werner states, we identify a critical evolution time associated with an early-time crossover, before which the overhead of QEC does not compensate for the noise-induced degradation; this critical time increases with entanglement, reflecting the greater fragility of strongly entangled states. Overall, our results provide a microscopic master-equation-based framework for benchmarking QEC performance in realistic open-system environments and for assessing code behavior in near-term noisy quantum architectures.

quant-pharXiv:2601.10206•Jan 16, 2026•1 citation

Noise-adapted quantum error correction for non-Markovian noise

Debjyoti Biswas, Shrikant Utagi, Prabha Mandayam

We consider the problem of quantum error correction (QEC) for non-Markovian noise. Using the well-known Petz recovery map, we first show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise in the strong-coupling regime where the noise map becomes non-completely-positive at intermediate times. While certain approximate QEC schemes are ineffective against quantum non-Markovian noise, in the sense that the fidelity vanishes in finite time, the Petz map adapted to non-Markovian noise uniquely safeguards the code space even at the maximum noise limit. Focusing on the case of non-Markovian amplitude damping noise, we further show that the non-Markovian Petz map also outperforms the standard, stabilizer-based QEC code. Since implementing such a non-Markovian map poses practical challenges, we also construct a Markovian Petz map that achieves a similar performance, with only a slight compromise on the fidelity. Finally, we also study an example of non-Markovian Pauli noise, namely the non-Markovian dephasing channel. In this case, we show that the non-Markovian Petz recovery preserves the code space even at the high-noise limit for certain noise-adapted codes, whereas the Markovian Petz and stabilizer recoveries are ineffective.

arXiv:2411.09637•Physical Review A•May 8, 2025•9 citations

Channel-Optimized Quantum Error Correction

Soraya Taghavi, Robert L. Kosut, Daniel A. Lidar

We develop a theory for finding quantum error correction (QEC) procedures which are optimized for given noise channels. Our theory accounts for uncertainties in the noise channel, against which our QEC procedures are robust. We demonstrate, via numerical examples, that our optimized QEC procedures always achieve a higher channel fidelity than the standard error correction method, which is agnostic about the specifics of the channel. This demonstrates the importance of channel characterization before QEC procedures are applied. Our main novel finding is that in the setting of a known noise channel the recovery ancillas are redundant for optimized quantum error correction. We show this using a general rank minimization heuristic and supporting numerical calculations. Therefore, one can further improve the fidelity by utilizing all the available ancillas in the encoding block.

arXiv:0810.2524•IEEE Transactions on Information Theory•Mar 1, 2010•32 citations

Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction

Jing Wu, Michele Grossi, Doga Kurkcuoglu +1 more

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.

quant-pharXiv:2607.24968•Jul 29, 2026•1 citation

Channel-Adapted Quantum Error Correction

Andrew S. Fletcher

Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.

arXiv:0706.3400•Jun 22, 2007•28 citations
We study the performance of quantum error correction (QEC) on a system undergoing open-system (OS) dynamics. The noise on the system originates from a joint quantum channel on the system-bath composite, a framework that includes and interpolates between the commonly used system-only quantum noise channel model and the system-bath Hamiltonian noise model. We derive the perfect OSQEC conditions, with QEC recovery only on the system and not the inaccessible bath. When the noise is only approximately correctable, the generic case of interest, we quantify the performance of OSQEC using worst-case fidelity. We find that the leading deviation from unit fidelity after recovery is quadratic in the uncorrectable part, a result reminiscent of past work on approximate QEC for system-only noise, although the approach here requires the use of different techniques than in past work.
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 analyze quantum state preservation in open quantum systems using quantum error-correcting (QEC) codes explicitly embedded in microscopic system-bath models. Rather than assuming abstract quantum channels, we consider multi-qubit registers coupled to bosonic thermal environments, derive a second-order master equation for the reduced dynamics, and use it to benchmark the five-qubit, Steane, and toric codes under local and collective noise. We compute state fidelities as functions of system-bath coupling strength, bath temperatures, and the number of correction cycles. In the low-temperature regime, repeated error correction with the five-qubit code significantly suppresses decoherence and relaxation for weak-to-moderate couplings. In the high-temperature regime, thermal excitations reduce the effectiveness of all codes, although within the parameter range studied, the five-qubit code still yields the highest fidelities among the three codes. For two-qubit Werner states, we identify a critical evolution time associated with an early-time crossover, before which the overhead of QEC does not compensate for the noise-induced degradation; this critical time increases with entanglement, reflecting the greater fragility of strongly entangled states. Overall, our results provide a microscopic master-equation-based framework for benchmarking QEC performance in realistic open-system environments and for assessing code behavior in near-term noisy quantum architectures.
We consider the problem of quantum error correction (QEC) for non-Markovian noise. Using the well-known Petz recovery map, we first show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise in the strong-coupling regime where the noise map becomes non-completely-positive at intermediate times. While certain approximate QEC schemes are ineffective against quantum non-Markovian noise, in the sense that the fidelity vanishes in finite time, the Petz map adapted to non-Markovian noise uniquely safeguards the code space even at the maximum noise limit. Focusing on the case of non-Markovian amplitude damping noise, we further show that the non-Markovian Petz map also outperforms the standard, stabilizer-based QEC code. Since implementing such a non-Markovian map poses practical challenges, we also construct a Markovian Petz map that achieves a similar performance, with only a slight compromise on the fidelity. Finally, we also study an example of non-Markovian Pauli noise, namely the non-Markovian dephasing channel. In this case, we show that the non-Markovian Petz recovery preserves the code space even at the high-noise limit for certain noise-adapted codes, whereas the Markovian Petz and stabilizer recoveries are ineffective.
We develop a theory for finding quantum error correction (QEC) procedures which are optimized for given noise channels. Our theory accounts for uncertainties in the noise channel, against which our QEC procedures are robust. We demonstrate, via numerical examples, that our optimized QEC procedures always achieve a higher channel fidelity than the standard error correction method, which is agnostic about the specifics of the channel. This demonstrates the importance of channel characterization before QEC procedures are applied. Our main novel finding is that in the setting of a known noise channel the recovery ancillas are redundant for optimized quantum error correction. We show this using a general rank minimization heuristic and supporting numerical calculations. Therefore, one can further improve the fidelity by utilizing all the available ancillas in the encoding block.
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.
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.