pith. machine review for the scientific record. sign in

arxiv: 2603.24237 · v2 · submitted 2026-03-25 · 🪐 quant-ph

Recognition: 1 theorem link

· Lean Theorem

Correlated Atom Loss as a Resource for Quantum Error Correction

Hugo Perrin , Gatien Roger , Guido Pupillo
Authors on Pith no claims yet

Pith reviewed 2026-05-15 01:01 UTC · model grok-4.3

classification 🪐 quant-ph
keywords surface codeatom lossquantum error correctioncorrelated errorsneutral atomserasure channelsdecoding strategylogical error rate
0
0 comments X

The pith

A new decoder that tracks correlated atom loss in neutral-atom processors reduces logical error rates by up to an order of magnitude and raises the surface code loss threshold from 3.2% to 4%.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper demonstrates that atom loss in neutral-atom quantum processors has a correlated structure that existing decoders ignore. By building a loss graph that updates probabilities dynamically from teleportation-based detection, the strategy converts delayed erasure channels into standard erasure channels. This yields concrete gains over independent-loss assumptions even when correlations are only partial. A reader would care because atom loss is the dominant error source in these platforms and better exploitation of its structure directly improves the prospects for scalable error-corrected computation.

Core claim

We introduce a decoding strategy for the surface code equipped with teleportation-based loss-detection units that exploits circuit-level partially correlated atom loss by constructing a loss graph and dynamically updating loss probabilities. This converts delayed erasure channels to erasure channels in a highly parallelizable way compatible with real-time operation. Applied to neutral-atom processors subject to partially correlated atom loss and depolarizing noise, the approach achieves up to an order-of-magnitude reduction in logical error probability compared with a decoder that assumes independent loss events and increases the loss threshold from 3.2% to 4%, with robust gains persisting,

What carries the argument

The loss graph that dynamically updates per-qubit loss probabilities from observed correlations, converting delayed erasures into standard erasures for the decoder.

If this is right

  • The loss threshold for atom loss rises from 3.2% to 4%.
  • Logical error probability drops by up to an order of magnitude relative to independent-loss decoding.
  • The method remains effective under partially correlated loss models that match current experiments.
  • Dynamic loss-graph updates are parallelizable and therefore suitable for real-time hardware decoding.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same loss-graph construction could be tested on other codes such as color or toric codes to see if comparable threshold gains appear.
  • Real-time implementation would require hardware that can feed loss-detection outcomes into the graph without adding latency or decoherence.
  • If correlations prove stronger or weaker than modeled, the threshold improvement would scale accordingly.
  • This approach suggests that engineering controlled loss correlations might become a design target rather than a nuisance in neutral-atom architectures.

Load-bearing premise

The partially correlated loss model and teleportation-based detection units must accurately reflect real experimental conditions, and the loss graph must be updatable in real time without introducing new errors.

What would settle it

Running the surface code on a neutral-atom device with measured atom-loss correlations, then comparing logical error rates under the new correlated decoder versus an independent-loss decoder to check whether the threshold reaches 4% and the error reduction holds.

Figures

Figures reproduced from arXiv: 2603.24237 by Gatien Roger, Guido Pupillo, Hugo Perrin.

Figure 1
Figure 1. Figure 1: a) Sketch of the correlated atom loss mechanism: an atom lost during the Rydberg pulse (step 1.) causes the remaining atom to be projected to |1⟩ and potentially re-excited (step 2.), where it either undergoes subsequent loss (step 3.a) or decays back to the computational subspace (step 3.b). b) Loss graph schematic: red/blue plaquettes denote X/Z stabilizers; black/white dots are data/ancilla qubits; soli… view at source ↗
Figure 2
Figure 2. Figure 2: A schematic representation of the loss graph. Red [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Distribution of the loss graph construction time [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Logical error probability normalized by the num [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Logical error probability normalized by the number [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: a) Logical error probability normalized by the num￾ber of rounds for a surface code of distance d = 9 and d rounds of stabilizer measurements as a function of the fully correlated loss probability pl (pc = 1) and the depolarizing error proba￾bility pd. At least 104 shots were used to estimate the logical error probabilities, with up to 106 shots employed for the low￾est error rates. The solid red line mark… view at source ↗
Figure 7
Figure 7. Figure 7: a) Logical error probability normalized by the num￾ber of rounds for a surface code of distance d = 9 and d rounds of stabilizer measurements at vanish depolarizing noise pd = 0 as a function of the atom loss probability pl and the correla￾tion probability pc. At least 104 shots were used to estimate the logical error probabilities, with up to 106 shots employed for the lowest error rates. The solid red li… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript presents a decoding strategy for the surface code on neutral-atom quantum processors that exploits partially correlated atom loss using teleportation-based loss-detection units. These units convert delayed erasure channels into standard erasures, and the decoder dynamically constructs and updates a loss graph to account for correlations. Numerical simulations demonstrate that this approach reduces logical error probabilities by up to an order of magnitude and raises the loss threshold from 3.2% to 4% compared to a decoder assuming independent loss events, with extensions to experimentally relevant partially correlated regimes.

Significance. If the central claims hold under realistic noise models, this work is significant for neutral-atom quantum computing, where atom loss is a primary error source. By treating loss correlations as a resource rather than a liability, the proposed method could enhance the performance of quantum error correction without requiring additional physical resources. The emphasis on real-time compatibility and parallelizability addresses practical implementation challenges. The extension beyond idealized fully correlated loss to partial correlations strengthens the relevance to current experiments.

major comments (2)
  1. [Abstract] Abstract: The performance claims, including the order-of-magnitude reduction in logical error probability and the threshold increase from 3.2% to 4%, are stated without reference to specific simulation parameters, methods, data, or error bars. This omission prevents independent verification of the results and raises questions about the robustness of the reported gains.
  2. [Abstract] Abstract: The analysis assumes that the teleportation-based loss-detection units detect losses with negligible additional depolarizing or loss errors and allow real-time graph updates without degrading the surface-code cycle time. If these units are subject to the same partially correlated atom loss and depolarizing noise as the rest of the circuit, the effective error rate per stabilizer measurement round would increase, potentially shrinking or eliminating the reported performance improvements. This assumption is load-bearing for the central claim and requires explicit modeling and validation in the noise model.
minor comments (1)
  1. [Abstract] Abstract: The term 'highly parallelizable' is used to describe the decoder but lacks supporting details on the implementation of the loss graph updates.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful review and constructive suggestions. We address each major comment below and have revised the manuscript to improve clarity and strengthen the analysis of the loss-detection units.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The performance claims, including the order-of-magnitude reduction in logical error probability and the threshold increase from 3.2% to 4%, are stated without reference to specific simulation parameters, methods, data, or error bars. This omission prevents independent verification of the results and raises questions about the robustness of the reported gains.

    Authors: We agree that the abstract would benefit from additional context to facilitate verification. In the revised manuscript, we have updated the abstract to reference the specific simulation parameters (code distances d=5,7,9; 10^6 Monte Carlo shots per data point; circuit-level noise with depolarizing probability p and loss rate l), the comparison baseline (independent-loss decoder), and the relevant figures (Figs. 3 and 4) that display the logical error rates with statistical error bars. The methods section already details the full noise model and decoder implementation; we have added a brief pointer in the abstract to these sections. revision: yes

  2. Referee: [Abstract] Abstract: The analysis assumes that the teleportation-based loss-detection units detect losses with negligible additional depolarizing or loss errors and allow real-time graph updates without degrading the surface-code cycle time. If these units are subject to the same partially correlated atom loss and depolarizing noise as the rest of the circuit, the effective error rate per stabilizer measurement round would increase, potentially shrinking or eliminating the reported performance improvements. This assumption is load-bearing for the central claim and requires explicit modeling and validation in the noise model.

    Authors: The original manuscript isolates the benefit of the correlated-loss decoder by modeling the teleportation-based units as ideal (zero additional error), as stated in the methods. We acknowledge that this is a simplifying assumption and that explicit modeling of noise in the units is necessary for a complete picture. In the revised manuscript we have added a new subsection (Section IV.C) that incorporates depolarizing noise (p=0.1%) and residual loss (0.5%) into the detection units under the same partially correlated model used for the data qubits. The simulations show that the loss threshold improvement is reduced but remains substantial (3.1% to 3.7%) and the logical-error reduction is at least 4–5× for relevant distances. We have also clarified that the loss-graph updates are strictly local and executed in parallel with syndrome extraction, preserving the standard surface-code cycle time. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's threshold shift (3.2% to 4%) and logical-error reduction are obtained from numerical simulations of a correlation-exploiting decoder on a surface code under a stated partially correlated loss model. No equations, ansatzes, or fitted parameters are shown that reduce the reported performance metrics to the inputs by construction. The loss-graph construction and dynamic probability updates are presented as an independent algorithmic procedure. No self-citations are invoked to justify uniqueness theorems or to smuggle in ansatzes. The central claims therefore remain self-contained against external simulation benchmarks rather than self-referential.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review prevents identification of specific free parameters or axioms; the approach implicitly assumes standard quantum circuit noise models and accurate correlation statistics.

pith-pipeline@v0.9.0 · 5456 in / 998 out tokens · 32996 ms · 2026-05-15T01:01:24.777095+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope

    quant-ph 2026-03 conditional novelty 8.0

    Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.

  2. High-fidelity entangling gates and nonlocal circuits with neutral atoms

    quant-ph 2026-04 conditional novelty 6.0

    Neutral-atom system delivers state-of-the-art CZ gate fidelity of 99.854% (99.941% postselected) and demonstrates coherent rearrangement for nonlocal quantum circuits.

  3. Loss-biased fault-tolerant quantum error correction

    quant-ph 2026-04 unverdicted novelty 6.0

    Loss biasing turns Rydberg errors into erasures in neutral-atom QEC, restoring fault-tolerant Pauli error scaling and enabling optimal erasure scaling with loss-aware decoding for shorter cycles.

Reference graph

Works this paper leans on

63 extracted references · 63 canonical work pages · cited by 3 Pith papers · 3 internal anchors

  1. [1]

    High-Fidelity Parallel Entangling Gates on a Neutral-Atom Quantum Computer

    S. J. Evered and al. “High-Fidelity Parallel Entangling Gates on a Neutral-Atom Quantum Computer”. Nature 622, 268–272 (2023)

    work page 2023

  2. [2]

    Logical Quantum Processor Based on Reconfigurable Atom Arrays

    D. Bluvstein and al. “Logical Quantum Processor Based on Reconfigurable Atom Arrays”. Nature626, 58– 65 (2024)

    work page 2024

  3. [3]

    Univer- 12 sal Quantum Operations and Ancilla-Based Read-out for Tweezer Clocks

    R. Finkelstein, R. B. Tsai, X. Sun, P. Scholl, S. Direkci, T. Gefen, J. Choi, A. L. Shaw, and M. Endres. “Univer- 12 sal Quantum Operations and Ancilla-Based Read-out for Tweezer Clocks”. Nature634, 321–327 (2024)

    work page 2024

  4. [4]

    Quantum Information with Rydberg Atoms

    M. Saffman, T. G. Walker, and K. Mølmer. “Quantum Information with Rydberg Atoms”. Reviews of Modern Physics82, 2313–2363 (2010)

    work page 2010

  5. [5]

    Many-Body Physics with Individually Controlled Rydberg Atoms

    A. Browaeys and T. Lahaye. “Many-Body Physics with Individually Controlled Rydberg Atoms”. Nature Physics 16, 132–142 (2020)

    work page 2020

  6. [6]

    Quan- tum Computing with Neutral Atoms

    L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G. Reymond, and C. Jurczak. “Quan- tum Computing with Neutral Atoms”. Quantum4, 327 (2020)

    work page 2020

  7. [7]

    Quantum Simulation and Computing with Rydberg-interacting Qubits

    M. Morgado and S. Whitlock. “Quantum Simulation and Computing with Rydberg-interacting Qubits”. AVS Quantum Science3, 023501 (2021)

    work page 2021

  8. [8]

    Multi-Qubit Entanglement and AlgorithmsonaNeutral-AtomQuantumComputer

    T. M. Graham and al. “Multi-Qubit Entanglement and AlgorithmsonaNeutral-AtomQuantumComputer”. Na- ture604, 457–462 (2022)

    work page 2022

  9. [9]

    ADual-SpeciesRydbergArray

    S. Anand, C. E. Bradley, R. White, V. Ramesh, K. Singh, andH.Bernien. “ADual-SpeciesRydbergArray”. Nature Physics20, 1744–1750 (2024)

    work page 2024

  10. [10]

    Erasure Conversion in a High- FidelityRydbergQuantumSimulator

    P. Scholl, A. L. Shaw, R. B. Tsai, R. Finkelstein, J. Choi, and M. Endres. “Erasure Conversion in a High- FidelityRydbergQuantumSimulator”. Nature622, 273– 278 (2023)

    work page 2023

  11. [11]

    High-Fidelity Gates and Mid-Circuit Erasure Conver- sion in an Atomic Qubit

    S. Ma, G. Liu, P. Peng, B. Zhang, S. Jandura, J. Claes, A. P. Burgers, G. Pupillo, S. Puri, and J. D. Thompson. “High-Fidelity Gates and Mid-Circuit Erasure Conver- sion in an Atomic Qubit”. Nature622, 279–284 (2023)

    work page 2023

  12. [12]

    Multi-Qubit Gates and Schrödinger Cat States in an Optical Clock

    A. Cao and al. “Multi-Qubit Gates and Schrödinger Cat States in an Optical Clock”. Nature634, 315–320 (2024)

    work page 2024

  13. [13]

    Reichardt, Adam Paetznick, David Aasen, Ivan Basov, Juan M

    B. W. Reichardt and al. “Fault-tolerant quantum computation with a neutral atom processor” (2025). arXiv:2411.11822

    work page arXiv 2025

  14. [14]

    Time-Optimal Two- and Three-Qubit Gates for Rydberg Atoms

    S. Jandura and G. Pupillo. “Time-Optimal Two- and Three-Qubit Gates for Rydberg Atoms”. Quantum6, 712 (2022)

    work page 2022

  15. [15]

    Error Budgeting for a Controlled-Phase Gate with Strontium-88 Rydberg Atoms

    A. Pagano, S. Weber, D. Jaschke, T. Pfau, F. Meinert, S. Montangero, and H. P. Büchler. “Error Budgeting for a Controlled-Phase Gate with Strontium-88 Rydberg Atoms”. Physical Review Research4, 033019 (2022)

    work page 2022

  16. [16]

    Quantum Error Correction below the Surface Code Threshold

    R. Acharya and al. “Quantum Error Correction below the Surface Code Threshold”. Nature638, 920–926 (2025)

    work page 2025

  17. [17]

    Fault-Tolerant Control of an Error- Corrected Qubit

    L. Egan and al. “Fault-Tolerant Control of an Error- Corrected Qubit”. Nature598, 281–286 (2021)

    work page 2021

  18. [18]

    Realization of Real-Time Fault-Tolerant Quantum Error Correction

    C. Ryan-Anderson and al. “Realization of Real-Time Fault-Tolerant Quantum Error Correction”. Physical Re- view X11, 041058 (2021)

    work page 2021

  19. [19]

    Demonstration of Fault-Tolerant Uni- versal Quantum Gate Operations

    L. Postler and al. “Demonstration of Fault-Tolerant Uni- versal Quantum Gate Operations”. Nature605, 675– 680 (2022)

    work page 2022

  20. [20]

    Paetznick, M

    M. P. da Silva and al. “Demonstration of Logical Qubits and Repeated Error Correction with Better-than- Physical Error Rates” (2024). arXiv:2404.02280

    work page arXiv 2024

  21. [21]

    Mind the gaps: The fraught road to quantum advantage

    J. Eisert and J. Preskill. “Mind the gaps: The fraught road to quantum advantage” (2025). arXiv:2510.19928

    work page arXiv 2025

  22. [22]

    Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms

    I. Cong, H. Levine, A. Keesling, D. Bluvstein, S. Wang, and M. D. Lukin. “Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms”. Physical Review X12, 021049 (2022)

    work page 2022

  23. [23]

    A Quantum Processor Based on Coherent Transport of Entangled Atom Arrays

    D. Bluvstein and al. “A Quantum Processor Based on Coherent Transport of Entangled Atom Arrays”. Nature 604, 451–456 (2022)

    work page 2022

  24. [24]

    Circuit-Based Leakage-to-Erasure Conversion in a Neutral-Atom Quantum Processor

    M. N. H. Chow, V. Buchemmavari, S. Omanakut- tan, B. J. Little, S. Pandey, I. H. Deutsch, and Y. Jau. “Circuit-Based Leakage-to-Erasure Conversion in a Neutral-Atom Quantum Processor”. PRX Quantum 5, 040343 (2024)

    work page 2024

  25. [25]

    Erasure-Tolerance Scheme for the Surface Codes on Neutral Atom Quantum Computers

    F. Kobayashi and S. Nagayama. “Erasure-Tolerance Scheme for the Surface Codes on Neutral Atom Quantum Computers”. IEEE Transactions on Quantum Engineer- ing7, 1–13 (2026)

    work page 2026

  26. [26]

    Rydberg-Mediated Entanglement in a Two- Dimensional Neutral Atom Qubit Array

    T. M. Graham, M. Kwon, B. Grinkemeyer, Z. Marra, X. Jiang, M. T. Lichtman, Y. Sun, M. Ebert, and M. Saffman. “Rydberg-Mediated Entanglement in a Two- Dimensional Neutral Atom Qubit Array”. Physical Re- view Letters123, 230501 (2019)

    work page 2019

  27. [27]

    Stabilizer Codes and Quantum Error Correction

    D. Gottesman. “Stabilizer Codes and Quantum Error Correction” (1997)

    work page 1997

  28. [28]

    Fault-Tolerant Quantum Computation

    J. Preskill. “Fault-Tolerant Quantum Computation”. In Introduction to Quantum Computation and Information. Pages 213–269. WORLD SCIENTIFIC (1998)

    work page 1998

  29. [29]

    Leakage Suppression in the Toric Code

    M. Suchara, A. W. Cross, and J. M. Gambetta. “Leakage Suppression in the Toric Code”. In 2015 IEEE Interna- tional Symposium on Information Theory (ISIT). Pages 1119–1123. Hong Kong (2015). IEEE

    work page 2015

  30. [30]

    Quantum Computing with Realistically Noisy Devices

    E. Knill. “Quantum Computing with Realistically Noisy Devices”. Nature434, 39–44 (2005)

    work page 2005

  31. [31]

    Experimental Deterministic Correction of Qubit Loss

    R. Stricker, D. Vodola, A. Erhard, L. Postler, M. Meth, M. Ringbauer, P. Schindler, T. Monz, M. Müller, and R. Blatt. “Experimental Deterministic Correction of Qubit Loss”. Nature585, 207–210 (2020)

    work page 2020

  32. [32]

    ARace-TrackTrapped-IonQuantum Processor

    S.A.Mosesandal. “ARace-TrackTrapped-IonQuantum Processor”. Physical Review X13, 041052 (2023)

    work page 2023

  33. [33]

    Lever- aging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

    G. Baranes, M. Cain, J. P. B. Ataides, D. Bluvstein, J. Sinclair, V. Vuletić, H. Zhou, and M. D. Lukin. “Lever- aging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms”. Physical Review X16, 011002 (2026)

    work page 2026

  34. [34]

    Taming Rydberg Decay with Measurement-based Quantum Computation

    C. Yu, Z. Chen, Y. Deng, M. Chen, C. Lu, and J. Pan. “Processing and Decoding Rydberg Leakage Error with MBQC” (2024). arXiv:2411.04664

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  35. [35]

    Locating Rydberg Decay Error in SWAP-Leakage Reduction Circuit Protocol

    C. Yu, Y. Deng, M. Chen, C. Lu, and J. Pan. “Lo- cating Rydberg Decay Error in SWAP-LRU” (2025). arXiv:2503.01649

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  36. [36]

    Era- sure Conversion for Fault-Tolerant Quantum Computing in Alkaline Earth Rydberg Atom Arrays

    Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson. “Era- sure Conversion for Fault-Tolerant Quantum Computing in Alkaline Earth Rydberg Atom Arrays”. Nature Com- munications13, 4657 (2022)

    work page 2022

  37. [37]

    ErasureQubits: Overcomingthe$T_1$ limit in Superconducting Circuits

    A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brandão, andA.Retzker. “ErasureQubits: Overcomingthe$T_1$ limit in Superconducting Circuits”. Physical Review X 13, 041022 (2023)

    work page 2023

  38. [38]

    Coherence Preserving Leakage De- tection and Cooling in Alkaline Earth Atoms

    S. Omanakuttan, V. Buchemmavari, M. J. Martin, and I. H. Deutsch. “Coherence Preserving Leakage De- tection and Cooling in Alkaline Earth Atoms” (2024). arXiv:2410.23430

    work page arXiv 2024

  39. [39]

    Quantum Sens- ing with Erasure Qubits

    P. Niroula, J. Dolde, X. Zheng, J. Bringewatt, A. Ehren- berg, K. C. Cox, J. Thompson, M. J. Gullans, S. Kolkowitz, and A. V. Gorshkov. “Quantum Sens- ing with Erasure Qubits”. Physical Review Letters133, 080801 (2024)

    work page 2024

  40. [40]

    Surface Code with Imperfect Erasure Checks

    K. Chang, S. Singh, J. Claes, K. Sahay, J. Teoh, and S. Puri. “Surface Code with Imperfect Erasure Checks”. PRX Quantum6, 040355 (2025)

    work page 2025

  41. [41]

    Optimiz- ing Quantum Error Correction Protocols with Erasure Qubits

    S. Gu, Y. Vaknin, A. Retzker, and A. Kubica. “Optimiz- ing Quantum Error Correction Protocols with Erasure Qubits” (2024). arXiv:2408.00829

    work page arXiv 2024

  42. [42]

    Fault-Tolerant Quan- 13 tum Architectures Based on Erasure Qubits

    S. Gu, A. Retzker, and A. Kubica. “Fault-Tolerant Quan- 13 tum Architectures Based on Erasure Qubits”. Physical Review Research7, 013249 (2025)

    work page 2025

  43. [43]

    Local Clus- tering Decoder: A Fast and Adaptive Hardware Decoder for the Surface Code

    A. B. Ziad, A. Zalawadiya, C. Topal, J. Camps, G. P. Gehér, M. P. Stafford, and M. L. Turner. “Local Clus- tering Decoder: A Fast and Adaptive Hardware Decoder for the Surface Code” (2024). arXiv:2411.10343

    work page arXiv 2024

  44. [44]

    Quantum Er- ror Correction resilient against Atom Loss

    H. Perrin, S. Jandura, and G. Pupillo. “Quantum Er- ror Correction resilient against Atom Loss”. Quantum9, 1884 (2025)

    work page 2025

  45. [45]

    High-Rate Quantum LDPC Codes for Long-Range- Connected Neutral Atom Registers

    L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo. “High-Rate Quantum LDPC Codes for Long-Range- Connected Neutral Atom Registers”. Nature Commu- nications16, 1111 (2025)

    work page 2025

  46. [46]

    High-Threshold and Low- Overhead Fault-Tolerant Quantum Memory

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder. “High-Threshold and Low- Overhead Fault-Tolerant Quantum Memory”. Nature 627, 778–782 (2024)

    work page 2024

  47. [47]

    Fast Quantum Gates for Neutral Atoms

    D. Jaksch, J. I. Cirac, P. Zoller, S. L. Rolston, R. Côté, and M. D. Lukin. “Fast Quantum Gates for Neutral Atoms”. Physical Review Letters85, 2208–2211 (2000)

    work page 2000

  48. [48]

    Surface Code Stabilizer Measurements for Rydberg Atoms

    S. Jandura, L. Pecorari, and G. Pupillo. “Surface Code Stabilizer Measurements for Rydberg Atoms” (2026). arXiv:2405.16621

    work page arXiv 2026

  49. [49]

    Benchmarking and Fidelity Response The- ory of High-Fidelity Rydberg Entangling Gates

    R. B. Tsai, X. Sun, A. L. Shaw, R. Finkelstein, and M. Endres. “Benchmarking and Fidelity Response The- ory of High-Fidelity Rydberg Entangling Gates”. PRX Quantum6, 010331 (2025)

    work page 2025

  50. [50]

    Universal Neutral-Atom Quantum Computer with Individual Optical Addressing and Non- destructive Readout

    A. Radnaev and al. “Universal Neutral-Atom Quantum Computer with Individual Optical Addressing and Non- destructive Readout”. PRX Quantum6, 030334 (2025)

    work page 2025

  51. [51]

    Quantum Error Correction of Coherent Errors by Randomization

    O. Kern, G. Alber, and D. L. Shepelyansky. “Quantum Error Correction of Coherent Errors by Randomization”. The European Physical Journal D - Atomic, Molecular, Optical and Plasma Physics32, 153–156 (2005)

    work page 2005

  52. [52]

    Noise Tailoring for Scalable Quantum Computation via Randomized Com- piling

    J. J. Wallman and J. Emerson. “Noise Tailoring for Scalable Quantum Computation via Randomized Com- piling”. Physical Review A94, 052325 (2016)

    work page 2016

  53. [53]

    Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quan- tum Processor

    A. Hashim and al. “Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quan- tum Processor”. Physical Review X11, 041039 (2021)

    work page 2021

  54. [54]

    Surface Codes: Towards Practical Large- Scale Quantum Computation

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland. “Surface Codes: Towards Practical Large- Scale Quantum Computation”. Physical Review A86, 032324 (2012)

    work page 2012

  55. [55]

    High-fidelity entanglement and coherent multi-qubit mapping in an atom array

    A. Senoo, A. Baumgärtner, J. W. Lis, G. M. Vaidya, Z. Zeng, G. Giudici, H. Pichler, and A. M. Kaufman. “High-fidelity entanglement and coherent multi-qubit mapping in an atom array” (2025). arXiv:2506.13632

    work page arXiv 2025

  56. [56]

    Sparse Blossom: Correcting a Million Errors per Core Second with Minimum-Weight Matching

    O. Higgott and C. Gidney. “Sparse Blossom: Correcting a Million Errors per Core Second with Minimum-Weight Matching”. Quantum9, 1600 (2025)

    work page 2025

  57. [57]

    Stim: A Fast Stabilizer Circuit Simulator

    C. Gidney. “Stim: A Fast Stabilizer Circuit Simulator”. Quantum5, 497 (2021)

    work page 2021

  58. [58]

    PyMatch- ing: A Python package for decoding quantum codes with minimum-weight perfect matching

    O. Higgott. “PyMatching: A Python Package for De- coding Quantum Codes with Minimum-Weight Perfect Matching” (2021). arXiv:2105.13082

    work page arXiv 2021

  59. [59]

    Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope

    P. Liu, S. J. S. Tan, E. Huang, U. A. Acar, H. Zhou, and C. Zhao. “Achieving Optimal-Distance Atom-Loss CorrectionviaPauliEnvelope” (2026). arXiv:2603.04156

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  60. [60]

    Suppressing Quantum Errors by Scaling a Surface Code Logical Qubit

    R. Acharya and al. “Suppressing Quantum Errors by Scaling a Surface Code Logical Qubit”. Nature614, 676– 681 (2023)

    work page 2023

  61. [61]

    Constant-Overhead Fault- Tolerant Quantum Computation with Reconfigurable Atom Arrays

    Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveen- dran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou. “Constant-Overhead Fault- Tolerant Quantum Computation with Reconfigurable Atom Arrays”. Nature Physics20, 1084–1090 (2024)

    work page 2024

  62. [62]

    Quantumlow-densityparity- check codes for erasure-biased atomic quantum proces- sors

    L.PecorariandG.Pupillo. “Quantumlow-densityparity- check codes for erasure-biased atomic quantum proces- sors”. Physical Review A112, 052417 (2025)

    work page 2025

  63. [63]

    Quantum Computa- tion and Quantum Information: 10th Anniversary Edi- tion

    M. A. Nielsen and I. L. Chuang. “Quantum Computa- tion and Quantum Information: 10th Anniversary Edi- tion” (2010). Appendix A: Pauli noise channel on the remaining atom In this Appendix, we derive the Pauli noise channel induced on the remaining atom when the other qubit is lost during a CZ gate. At the end of the Rydberg pulse, we assume the atom has be...

    work page 2010