Theory of approximate quantum error correction and the error-set model

2026-07-24

AI Summary

This work addresses the lack of structural characterization in traditional approximate quantum error correction (AQEC) for handling diverse noise types. By formulating AQEC within an error-set model, the authors introduce a constrained linear structure to uniformly describe correctable channel families and define new code parameters quantifying worst-case and average recovery performance. For the first time, key structural properties from exact QEC—such as code distance, erasure equivalence, and asymptotically good codes—are extended to the approximate setting, yielding a hierarchical framework that aligns errors with appropriate metrics. Combining the Bény–Oreshkov worst-case and Petz average recovery approaches, and leveraging spectral constraints on linear combinations of Kraus operators alongside partition-based constructions, the authors construct the first asymptotically good AQEC code family applicable to fermionic systems, one-dimensional Rydberg-blockade systems, and deletion errors, with straightforward generalization to multiple physical platforms.

Abstract

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.

Problem

• approximate quantum error correction
• error-set model
• Knill-Laflamme conditions
• asymptotically good codes
• quantum error correction

Innovation

• approximate quantum error correction
• error-set model
• Knill-Laflamme conditions
• asymptotically good codes
• code construction