Bounds on Autonomous Quantum Error Correction

Oles Shtanko, Yu-Jie Liu, Simon Lieu, Alexey V. Gorshkov, Victor V. Albert

Abstract

Autonomous quantum error correction (AQEC) offers a passive alternative to standard active error correction by using engineered dissipation to relax a system toward its error-free codespace. This paper establishes the fundamental performance limits of such "always-on" decoders. Through the analysis of Markovian autonomous decoders, we prove that for a quantum memory's lifetime to scale with its size, the internal correction rate must typically grow alongside the system size. This challenges the feasibility of constant-rate passive processes for indefinite protection and identifies a "soft threshold" behavior unique to autonomous systems.

Introduction

Standard Quantum Error Correction (QEC) relies on active cycles of syndrome measurement and classical feedback, which are hardware-intensive and introduce additional noise. Autonomous QEC (AQEC) simplifies this by engineering the environment so that the system naturally corrects itself. However, the scalability of this approach remained an open question: can a fixed-rate dissipation process provide arbitrary protection as the number of qubits increases?

Theoretical Framework and Methods

The authors analyze autonomous decoders within the Lindblad master equation framework. To derive universal performance bounds, several theoretical models are employed:

  1. The Global Decoder Model: An idealized scenario where any error is immediately mapped back to the codespace, representing the upper limit of autonomous performance.
  2. Dyson Perturbative Expansion: Used to establish general upper bounds on logical error rates for strictly error-reducing decoders.
  3. Poissonian Stochastic Mapping: For Pauli noise models, quantum dynamics are mapped to classical Poisson processes, treating error and recovery as a stochastic competition.
Conceptual models of autonomous error correction and the resulting fidelity recovery over time.

Key Insights: The Scaling Catch

A central finding is the "Scaling Catch": a constant correction rate ($\kappa$) is generally insufficient to maintain an infinite memory lifetime as system size ($n$) grows. To achieve exponential suppression of logical errors, the hardware must "work harder"—the correction rate often needs to scale with the system size (e.g., $\kappa \propto L$ for a lattice of size $L$).

Unlike the sharp phase transitions seen in active QEC, AQEC exhibits a "soft threshold." Performance improves exponentially when the noise-to-correction ratio is low, but the absence of synchronized correction rounds fundamentally alters the scaling physics.

Results and Numerical Validation

The study derives a non-perturbative bound showing that logical error rates are suppressed exponentially with the code's error radius $\ell$, provided the noise-to-recovery ratio is sufficiently small.

Scaling of logical error rates with error radius and noise-to-recovery ratio.

For the 2D Toric code, the effective logical error rate $\Delta_{eff}$ scales as $\exp(-\Theta(\kappa/\Delta))$. To maintain this exponential decay relative to lattice size $L$, the recovery rate $\kappa$ must grow linearly with $L$. For codes possessing a threshold, faster-than-polynomial decay of the logical error rate is achievable if the correction rate scales superlogarithmically with code size.

Discussion and Limitations

While these bounds provide a rigorous "best-case" limit using global decoders, real-world dissipation is typically local. Future work must address the constraints of local autonomous decoders, such as those based on cellular automata. Additionally, implementing a recovery rate that scales with system size presents a significant engineering challenge. Finally, the assumption of Markovian noise may not capture temporal correlations in physical environments, which could further impact these theoretical limits.

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 Yu-Jie 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},
}
Figure