Bounds on Autonomous Quantum Error Correction

Oles Shtanko, Yujie Liu, Simon Lieu, Alexey V. Gorshkov, Victor V. Albert

Abstract

Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an “always-on” decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples, including an exactly solvable global dissipative toric code model.

Introduction: The Challenge of Active QEC

In traditional quantum error correction (QEC), the system requires constant active intervention. Hardware must periodically measure syndromes, process the resulting data, and apply corrective gates. This "active" cycle introduces significant overhead and complexity for large-scale quantum computers.

Autonomous Quantum Error Correction (AQEC) offers a "hands-off" alternative. By engineering the environment’s dissipation, researchers can make the desired logical state an attractor, allowing the system to naturally relax back to the codespace whenever an error occurs. However, it hasn't been clear how these autonomous systems scale: does a constant relaxation rate suffice as we add more qubits? This paper provides the mathematical bounds to answer these questions.

The Mechanism of Autonomous QEC

The core idea of AQEC is to replace discrete measurement-and-correction cycles with a continuous, dissipative process. This process can be modeled using Markovian master equations (specifically Lindblad dynamics).

Conceptual diagrams of autonomous error correction processes and fidelity recovery over time.

As shown in the figure above, different decoder strategies can be employed. A strictly error-reducing decoder (a) ensures that recovery operations never increase the severity of an error. In contrast, a global decoder (b) represents an idealized model where any error within the code's capacity is instantly mapped back to the codespace. In both cases, the goal is for the system's fidelity to approach unity over a characteristic time scale defined by the recovery rate $\kappa$ (c).

Theoretical Framework and Methods

The authors analyze these decoders using several advanced mathematical tools:

  • Dyson’s perturbative expansion: Used to derive non-perturbative upper bounds on logical error rates, revealing that AQEC can be much more robust than simple calculations suggest.
  • Poissonian Trajectory Analysis: This maps quantum evolution to a classical stochastic process where error events and recovery events compete in time. If a second error arrives before the "always-on" decoder fixes the first, the errors can compound into a logical failure.
  • Exact Solutions: The study includes an exactly solvable model of a "global dissipative toric code" to validate the derived theoretical limits.

Key Results: Scaling and Error Bounds

The most significant finding is the relationship between system size and the required hardware performance. The authors prove that for many common codes, a constant correction rate $\kappa$ is insufficient to maintain stability as the system grows.

Logical error rate scaling with respect to error radius and noise-to-recovery ratios.

As illustrated in the plots above, the logical error rate $\Gamma$ depends heavily on the ratio of noise to recovery ($r/r_0$) and the code's error radius $\ell$.

  • The Scaling Requirement: To achieve a memory lifetime that grows with system size (e.g., for the 2D Toric code), the recovery rate must scale up—specifically, $\kappa$ must grow linearly with the lattice size $L$.
  • Universal Upper Bound: Theorem 1 establishes that logical error rates are suppressed exponentially relative to the error radius $\ell$, provided the noise is sufficiently small compared to the recovery rate.
  • The "Soft Threshold": There is a point where simply adding more qubits without increasing hardware speed hits a performance floor. To break through this, superlogarithmic scaling of the correction rate is required for codes with a threshold to achieve faster-than-polynomial decay of the error rate.

Implications and Future Directions

This work clarifies the "cost" of autonomy. While AQEC removes the need for active measurement cycles, it shifts the burden to the speed of the engineered dissipation. Future research will focus on applying these bounds to more realistic local decoders and investigating hardware platforms, such as Rydberg atoms or superconducting circuits, that might naturally support the necessary scaling of correction rates.

Summary updated

Abstract

Autonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an ``always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. These bounds suggest that, in general, there is always a correction rate, possibly size-dependent, above which autonomous memories exhibit arbitrarily long coherence times. For any given autonomous memory, size dependence of this correction rate is difficult to rule out: we point to common scenarios where autonomous decoders that stochastically implement active error correction must operate at rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.
BibTeX
@article{shtanko2025bounds,
  author = {Oles Shtanko and Yujie Liu and Simon Lieu and Alexey V. Gorshkov and Victor V. Albert},
  title = {{Bounds on Autonomous Quantum Error Correction}},
  journal = {Quantum},
  year = {2025},
  doi = {10.22331/q-2025-07-22-1804},
}

Loading related content...

Figure