Universal recovery in approximate quantum error correction

• URL: http://arxiv.org/abs/2608.28962v1
• Date: Sat, 29 Aug 2026 00:25:52 GMT
• Title: Universal recovery in approximate quantum error correction
• Abstract summary: Universal recovery is the existence of a single recovery map that corrects an entire family of error channels.<n>In exact quantum error correction, linearity guarantees that a code correcting a given error set also corrects every channel whose Kraus operators lie in its linear span.<n>We show that a single recovery map can simultaneously correct every channel controlled by a given error set.
• Score: 53.73800998389749
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• A Concatenated Dual Displacement Code for Continuous-Variable Quantum Error Correction [4.486796752191548]
  This work establishes a viable route toward fault-tolerant continuous quantum computation.<n>It provides new insight into the design ofvariabled CV error-correcting architectures.
  arXiv  Detail & Related papers  (2025-11-29T13:24:40Z)
• A new approximate Eastin-Knill theorem [0.0]
  We show that a quantum error correcting code can support a universal set of gates and approximately correct for local erasure.<n>In particular, we show that a quantum error correcting code can support a universal set of gates if and only if the conditional min-entropy of the Choi state of the encoding and noise channel is upper bounded by a function of the worst-case error probability.
  arXiv  Detail & Related papers  (2025-05-01T09:56:26Z)
• Universal transversal gates [0.0]
  A long-standing challenge in quantum error correction is the infeasibility of universal gates, as shown by the Eastin-Knill theorem. We obtain a necessary and sufficient condition for a quantum code to have universal gates and show that the Eastin-Knill no-go result is a special case that does not hold for a general error model.
  arXiv  Detail & Related papers  (2024-10-09T16:34:47Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Overcoming leakage in scalable quantum error correction [128.39402546769284]
  Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC) Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle. We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 times 10-3$ throughout the entire device.
  arXiv  Detail & Related papers  (2022-11-09T07:54:35Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.