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:1706.09434 · Communications in Mathematical Physics

Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit

Patrick M. Hayden, Geoff Penington

Published Feb 10, 2020• 47 citations
arXivHTMLPDF
DOI
10.1007/s00220-020-03689-1

Related papers

Approximate Quantum Error Correction

Benjamin W. Schumacher, Michael D. Westmoreland

arXiv:quant-ph/0112106•Quantum Information Processing•Apr 1, 2002•161 citations

Approximate quantum error correction: Optimal codes for independent and correlated errors

Sol H. Jacobsen, Florian Mintert

Verhandlungen der Deutschen Physikalischen Gesellschaft•Jan 1, 2013•0 citations

On approximate quantum error correction for symmetric noise

Gereon Koßmann, Julius A. Zeiss, Omar Fawzi +1 more

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.

arXiv:2507.12326•Jul 16, 2025•4 citations

Refining quantum fidelity: approaches in quantum error correction

Vikram Singh Thakur, Atul Kumar, Kapal Dev

Quantum Information Processing•Jun 23, 2025•2 citations

Universal recovery in approximate quantum error correction

Dor Elimelech, Victor V. Albert, Alexander Barg

Universal recovery -- the existence of a single recovery map that corrects an entire family of error channels -- is a central feature of quantum error correction (QEC). In exact QEC, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span, and that a single recovery map suffices for all such channels. Approximate quantum error correction (AQEC), which relaxes perfect recovery to recovery with controlled error, has traditionally lacked this structure. In a recent paper (arXiv:2607.22995), we developed a theory of approximate quantum error correction showing that a restricted form of linearity persists in the approximate setting, yielding uniform AQEC guarantees for the family of channels controlled by a given error set. In this work, we complete the picture by establishing the second half of universal recovery in the approximate setting: a single recovery map can simultaneously correct every channel controlled by a given error set. The error-set theory we proposed quantifies approximate correctability through two parameters: the environment-leakage distance, governing worst-case performance, and the Knill--Laflamme Hellinger distance, governing average-case performance. We show here that both quantities also control universal decoding. We further study the Petz map naturally associated with an error set as an explicit universal recovery, and obtain uniform average- and worst-case guarantees across the entire family of channels.

quant-pharXiv:2608.28962•Sep 1, 2026•4 citations

Quantum Error Correction

Savo Glisic, Beatriz Lorenzo

Classical information technologies employ binary encodings in which data are represented as sequences of bits taking values of “0” or “1.” In this chapter, the authors describe how the procedure can be generalized to create [[n, k, d]] stabilizer codes, where n is the total number of qubits, k is the number of logical qubits, and d is the code distance. They outline a construction known as the surface code. We must also understand how to perform operations on a state encoded in a quantum code without losing the code's protection against errors, and how to safely perform error correction when the gates used are themselves noisy. A protocol that performs these tasks is called fault tolerant. The authors revisit the problems discussed by introducing a more rigorous mathematical framework in analogy with classical error correction theory.

Wiley eBooks•Feb 14, 2022•4 citations
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.
Universal recovery -- the existence of a single recovery map that corrects an entire family of error channels -- is a central feature of quantum error correction (QEC). In exact QEC, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span, and that a single recovery map suffices for all such channels. Approximate quantum error correction (AQEC), which relaxes perfect recovery to recovery with controlled error, has traditionally lacked this structure. In a recent paper (arXiv:2607.22995), we developed a theory of approximate quantum error correction showing that a restricted form of linearity persists in the approximate setting, yielding uniform AQEC guarantees for the family of channels controlled by a given error set. In this work, we complete the picture by establishing the second half of universal recovery in the approximate setting: a single recovery map can simultaneously correct every channel controlled by a given error set. The error-set theory we proposed quantifies approximate correctability through two parameters: the environment-leakage distance, governing worst-case performance, and the Knill--Laflamme Hellinger distance, governing average-case performance. We show here that both quantities also control universal decoding. We further study the Petz map naturally associated with an error set as an explicit universal recovery, and obtain uniform average- and worst-case guarantees across the entire family of channels.
Classical information technologies employ binary encodings in which data are represented as sequences of bits taking values of “0” or “1.” In this chapter, the authors describe how the procedure can be generalized to create [[n, k, d]] stabilizer codes, where n is the total number of qubits, k is the number of logical qubits, and d is the code distance. They outline a construction known as the surface code. We must also understand how to perform operations on a state encoded in a quantum code without losing the code's protection against errors, and how to safely perform error correction when the gates used are themselves noisy. A protocol that performs these tasks is called fault tolerant. The authors revisit the problems discussed by introducing a more rigorous mathematical framework in analogy with classical error correction theory.