Correlated Atom Loss as a Resource for Quantum Error Correction

• URL: http://arxiv.org/abs/2603.24237v1
• Date: Wed, 25 Mar 2026 12:17:14 GMT
• Title: Correlated Atom Loss as a Resource for Quantum Error Correction
• Abstract summary: We introduce and implement a decoding strategy that exploits loss correlations, effectively converting the textitdelayed erasure channels stemming from atom loss to erasure channels.<n>Compared to a decoder that assumes independent loss events, our approach achieves up to an order-of-magnitude reduction in logical error probability.<n>Our approach extends to experimentally relevant regimes with partially correlated loss, demonstrating robust gains beyond the idealized fully correlated setting.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Atom loss is a dominant error source in neutral-atom quantum processors, yet its correlated structure remains largely unexploited by existing quantum error correction decoders. We analyze the performance of the surface code equipped with teleportation-based loss-detection units for neutral-atom quantum processors subject to circuit-level, partially correlated atom loss and depolarizing noise. We introduce and implement a decoding strategy that exploits loss correlations, effectively converting the \textit{delayed} erasure channels stemming from atom loss to erasure channels. The decoder constructs a loss graph and dynamically updates loss probabilities, a procedure that is highly parallelizable and compatible with real-time operation. Compared to a decoder that assumes independent loss events, our approach achieves up to an order-of-magnitude reduction in logical error probability and increases the loss threshold from $3.2\%$ to $4\%$. Our approach extends to experimentally relevant regimes with partially correlated loss, demonstrating robust gains beyond the idealized fully correlated setting.

Related papers

• Loss-correcting fault-tolerant quantum computing architecture for neutral atoms [0.985181251286035]
  Neutral-atom decoder arrays are a leading qubit technology for large-scale, fault-tolerant quantum computing (FTQC)<n>A dominant error source on this platform is qubit loss, which accrues with every operation and movement.<n>Standard error correction targets Pauli errors and cannot correct loss, so most FTQC performance analyses are not directly compatible with it.
  arXiv  Detail & Related papers  (2026-09-09T12:01:36Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Programmable Dissipation via Partial Quantum Error Correction [2.614894682819833]
  We show that logical noise can instead be turned into a calibrated resource.<n>One fault-tolerant round induces a logical completely positive trace-preserving map.<n>We derive an accuracy criterion for multi-step simulation in which the code distance is chosen.
  arXiv  Detail & Related papers  (2026-05-28T16:49:07Z)
• Loss-biased fault-tolerant quantum error correction [0.0]
  Shorter quantum error correction cycles amplify platform-specific errors, leading to non-Markovian correlated errors that degrade logical performance.<n>We introduce loss biasing, where spurious Rydberg excitations are rapidly converted into atom loss via mid-circuit ionization.<n>Loss biasing restores the fault-tolerant logical error scaling for intra-cycle Pauli errors and enables shorter QEC cycles with reduced hardware overhead.
  arXiv  Detail & Related papers  (2026-04-23T17:21:39Z)
• Leveraging Atom Loss Errors in Fault Tolerant Quantum Algorithms [0.0]
  Errors associated with qubit loss constitute an important source of noise in many quantum hardware systems.<n>We develop a theoretical framework to handle these errors in logical algorithms, incorporating decoding techniques and circuit-level optimizations.<n>We simulate such a teleportation-based algorithm, involving a toy model for small-angle synthesis and find a significant improvement in logical error rates as the loss fraction increases.
  arXiv  Detail & Related papers  (2025-02-27T21:59:25Z)
• Quantum Error Correction resilient against Atom Loss [0.0]
  We investigate error correction protocols for neutral atoms quantum processors in the presence of atom loss.<n>For zero depolarizing noise, the atom loss threshold is about $2.6%$.
  arXiv  Detail & Related papers  (2024-12-10T19:00:01Z)
• Suppressing Correlated Noise in Quantum Computers via Context-Aware Compiling [0.9623525909952625]
  Correlations in noise can occur as a result of spatial and temporal configurations of instructions executing on the quantum processor. We devise compiler strategies to suppress these errors using dynamical decoupling or error compensation into the rest of the circuit. Our experiments show an increase of 18.5% in layer fidelity for a candidate 10-qubit circuit layer compared to context-unaware suppression.
  arXiv  Detail & Related papers  (2024-03-11T16:08:52Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.