Universal recovery in approximate quantum error correction
Abstract
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.
Related
- High-Rank Encoding Can Improve Approximate Quantum Error Correction
- Quantum thermalization achieves optimal approximate quantum error correction
- Theory of approximate quantum error correction and the error-set model
- Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
BibTeX
@misc{elimelech2026universal,
title = {{Universal recovery in approximate quantum error correction}},
author = {Dor Elimelech and Victor V. Albert and Alexander Barg},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.28962},
eprint = {2608.28962},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.28962},
}
RIS
TY - UNPB
TI - Universal recovery in approximate quantum error correction
AU - Dor Elimelech
AU - Victor V. Albert
AU - Alexander Barg
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2608.28962
UR - https://arxiv.org/abs/2608.28962
AB - 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.
ER -