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:quant-ph/0112106 · Quantum Information Processing

Approximate Quantum Error Correction

Benjamin W. Schumacher, Michael D. Westmoreland

Published Apr 1, 2002• 161 citations
arXivHTMLPDF
DOI
10.1023/a:1019653202562

Related papers

Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit

Patrick M. Hayden, Geoff Penington

arXiv:1706.09434•Communications in Mathematical Physics•Feb 10, 2020•47 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

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

An entropic analysis of approximate quantum error correction

Carlo Cafaro, Peter van Loock

arXiv:1308.4579•Physica A Statistical Mechanics and its Applications•Mar 1, 2014•8 citations

Unified approach to approximate quantum error correction via the transpose channel

Prabha Mandayam, Hui Khoon Ng

Bulletin of the American Physical Society•Feb 27, 2012•0 citations

Quantum Error Corrections

Rajendra Kumar Bera

Undergraduate lecture notes in physics•Jan 1, 2020•0 citations
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.