Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2405.10434 · PRX Quantum

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

Matthew N. H. Chow, Vikas Buchemmavari, Sivaprasad Omanakuttan, Bethany Little, Saurabh Pandey, Ivan Deutsch, Yuan‐Yu Jau

Published Dec 16, 2024• 35 citations
arXivHTMLPDF

Abstract

Atom-loss errors are a major limitation of current state-of-the-art neutral-atom quantum computers and pose a significant challenge for scalable systems. In a quantum processor with cesium atoms, we demonstrate proof-of-principle circuit-based conversion of this form of leakage error to erasure errors via leakage-detection units (LDUs), which nondestructively map information about the presence or absence of the qubit onto the state of an ancilla. We benchmark the performance of the LDU using a three-outcome low-loss state-detection method and find that the LDU detects atom-loss errors with approximately 93.4% accuracy, limited by technical imperfections of our apparatus. We further compile and execute a LDU, wherein the roles of the original data atom and ancilla atom are exchanged under the action of the LDU, providing “free refilling” of atoms in the case of atom loss. This circuit-based leakage-to-erasure error conversion is a critical component of a neutral-atom quantum processor where the quantum information may significantly outlive the lifetime of any individual atom in the quantum register. Finally, we demonstrate that LDUs may also be used to handle other forms of leakage errors where population moves to states outside of the computational subspace. Published by the American Physical Society 2024

DOI
10.1103/prxquantum.5.040343

Related papers

Quantum Error Correction resilient against Atom Loss

Hugo Perrin, Sven Jandura, Guido Pupillo

We investigate quantum error correction protocols for neutral atoms quantum processors in the presence of atom loss. We complement the surface code with loss detection units (LDU) and analyze its performances by means of circuit-level simulations for two distinct protocols – the standard LDU and a teleportation-based LDU –, focussing on the impact of both atom loss and depolarizing noise on the logical error probability. We introduce and employ a new adaptive decoding procedure that leverages the knowledge of loss locations provided by the LDUs, improving logical error probabilities by nearly three orders of magnitude compared to a naive decoder. For the considered error models, our results demonstrate the existence of an error threshold line that depends linearly on the probabilities of atom loss and of depolarizing errors. For zero depolarizing noise, the atom loss threshold is about 2.6% .

arXiv:2412.07841•Quantum•Oct 13, 2025•24 citations

Locating Rydberg decay error in the swap leakage reduction circuit protocol

Cheng-Cheng Yu, Yu-Hao Deng, Chao-Yang Lu +2 more

Qubit leakage and loss, particularly Rydberg-induced decay during two-qubit gates, pose significant challenges to fault-tolerant quantum computing with neutral atom arrays, as they propagate to correlated errors and degrade code distance. Here, we present a hardware-efficient scheme for addressing Rydberg decay using the SWAP-Leakage Reduction Circuit (SWAP-LRC) protocol, which leverages ancilla-data qubit swaps for in-line leakage mitigation. This strategy eliminates the need for atom-species-specific mid-circuit detection or additional ancillary qubits. Based on experimental detection capabilities, we present two specialized decoders. For detectable leakage/loss (e.g., in $^{171}$Yb), our Located Decoder achieves a high threshold of 2.33\% per CNOT gate and an improved error distance, significantly outperforming conventional Pauli error models. More interestingly, for scenarios where only one error type is detectable (e.g., atom loss for $^{87}$Rb), our Critical Decoder specifically targets and mitigates the most detrimental critical faults caused by correlated leakage, achieving an error distance comparable to standard Pauli errors. Our findings offer insights for handling complex non-Pauli errors for neutral atom quantum computation.

arXiv:2503.01649•Physical Review A•Sep 23, 2025•10 citations

Fault-tolerant quantum computation with a neutral atom processor

Ben W. Reichardt, Adam Paetznick, David Aasen +69 more

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.

arXiv:2411.11822•Nov 18, 2024•151 citations

Correlated Atom Loss as a Resource for Quantum Error Correction

Hugo Perrin, Gatien Roger, Guido Pupillo

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.

quant-pharXiv:2603.24237•Mar 26, 2026•6 citations

Taming Rydberg Decay with Measurement-Based Quantum Computation

Chengcheng Yu, Zi‐Han Chen, Yuhao Deng +3 more

Programmable neutral atom arrays show great promise for fault-tolerant quantum computing. A dominant physical error on this platform is qubit leakage and loss, notably decay errors from the Rydberg state during two-qubit gates. Such leakage events are particularly detrimental as they propagate, generating correlated errors that severely degrade the effective error distance of quantum error correction codes. Here, we present a novel approach to address Rydberg decay errors leveraging measurement-based quantum computation. Our scheme strategically exploits the inherent geometric structure of topological cluster states and only uses final leakage detection information to locate propagated errors originating from Rydberg decay. This eliminates the need for complex and atom-species-specific midcircuit leakage detection, offering broader applicability, e.g., to the well-established Rb atom platform. We demonstrate a high error threshold of 3.65% per cz gate for pure Rydberg decay and achieve a favorable error distance d_{e}≈d. Our method compares favorably with state-of-the-art erasure conversion protocols in the subthreshold performance, offering comparable or marginally larger logical error rates while significantly reducing experimental overhead.

arXiv:2411.04664•Physical Review Letters•Mar 23, 2026•17 citations

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

Fumiyoshi Kobayashi, Shota Nagayama

Neutral atom arrays manipulated with optical tweezers are promising candidates for fault tolerant quantum computers due to their advantageous properties, such as scalability, long coherence times, and optical accessibility for communication. A significant challenge to overcome is the presence of non-Pauli errors, specifically erasure errors and leakage errors. Previous work has shown that leakage errors can be converted into erasure errors; however, these (converted) erasure errors continuously occur and accumulate over time. Prior proposals have involved transporting atoms directly from a reservoir area—where spare atoms are stored—to the computational area—where computation and error correction are performed—to correct atom loss. While coherent transport is promising, it may not address all challenges—particularly its effectiveness in dense arrays and the efficacy of alternative methods should be investigated. In this study, we evaluate the effects of erasure errors on the surface code using circuit-based Monte Carlo simulations that incorporate depolarizing and accumulated erasure errors. We propose a new scheme to mitigate this problem: a k-shift erasure recovery scheme. Our scheme employs code deformation to repeatedly transfer the logical qubit from an imperfect array with accumulated erased qubits to a perfect array, thereby tolerating many accumulated erasures. Furthermore, our scheme corrects erasure errors in the atom arrays while the logical qubits are evacuated from the area being corrected; thus, manipulating optical tweezers for erasure correction does not disturb the qubits that constitute the logical data. Our scheme provides a practical pathway for neutral atom quantum computers to achieve feasible fault tolerance.

arXiv:2404.12656•IEEE Transactions on Quantum Engineering•Oct 31, 2025•5 citations
Atom-loss errors are a major limitation of current state-of-the-art neutral-atom quantum computers and pose a significant challenge for scalable systems. In a quantum processor with cesium atoms, we demonstrate proof-of-principle circuit-based conversion of this form of leakage error to erasure errors via leakage-detection units (LDUs), which nondestructively map information about the presence or absence of the qubit onto the state of an ancilla. We benchmark the performance of the LDU using a three-outcome low-loss state-detection method and find that the LDU detects atom-loss errors with approximately 93.4% accuracy, limited by technical imperfections of our apparatus. We further compile and execute a LDU, wherein the roles of the original data atom and ancilla atom are exchanged under the action of the LDU, providing “free refilling” of atoms in the case of atom loss. This circuit-based leakage-to-erasure error conversion is a critical component of a neutral-atom quantum processor where the quantum information may significantly outlive the lifetime of any individual atom in the quantum register. Finally, we demonstrate that LDUs may also be used to handle other forms of leakage errors where population moves to states outside of the computational subspace. Published by the American Physical Society 2024
We investigate quantum error correction protocols for neutral atoms quantum processors in the presence of atom loss. We complement the surface code with loss detection units (LDU) and analyze its performances by means of circuit-level simulations for two distinct protocols – the standard LDU and a teleportation-based LDU –, focussing on the impact of both atom loss and depolarizing noise on the logical error probability. We introduce and employ a new adaptive decoding procedure that leverages the knowledge of loss locations provided by the LDUs, improving logical error probabilities by nearly three orders of magnitude compared to a naive decoder. For the considered error models, our results demonstrate the existence of an error threshold line that depends linearly on the probabilities of atom loss and of depolarizing errors. For zero depolarizing noise, the atom loss threshold is about 2.6% .
Qubit leakage and loss, particularly Rydberg-induced decay during two-qubit gates, pose significant challenges to fault-tolerant quantum computing with neutral atom arrays, as they propagate to correlated errors and degrade code distance. Here, we present a hardware-efficient scheme for addressing Rydberg decay using the SWAP-Leakage Reduction Circuit (SWAP-LRC) protocol, which leverages ancilla-data qubit swaps for in-line leakage mitigation. This strategy eliminates the need for atom-species-specific mid-circuit detection or additional ancillary qubits. Based on experimental detection capabilities, we present two specialized decoders. For detectable leakage/loss (e.g., in 171^{171}171Yb), our Located Decoder achieves a high threshold of 2.33\% per CNOT gate and an improved error distance, significantly outperforming conventional Pauli error models. More interestingly, for scenarios where only one error type is detectable (e.g., atom loss for 87^{87}87Rb), our Critical Decoder specifically targets and mitigates the most detrimental critical faults caused by correlated leakage, achieving an error distance comparable to standard Pauli errors. Our findings offer insights for handling complex non-Pauli errors for neutral atom quantum computation.
Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.
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%3.2\%3.2% to 4%4\%4%. Our approach extends to experimentally relevant regimes with partially correlated loss, demonstrating robust gains beyond the idealized fully correlated setting.
Programmable neutral atom arrays show great promise for fault-tolerant quantum computing. A dominant physical error on this platform is qubit leakage and loss, notably decay errors from the Rydberg state during two-qubit gates. Such leakage events are particularly detrimental as they propagate, generating correlated errors that severely degrade the effective error distance of quantum error correction codes. Here, we present a novel approach to address Rydberg decay errors leveraging measurement-based quantum computation. Our scheme strategically exploits the inherent geometric structure of topological cluster states and only uses final leakage detection information to locate propagated errors originating from Rydberg decay. This eliminates the need for complex and atom-species-specific midcircuit leakage detection, offering broader applicability, e.g., to the well-established Rb atom platform. We demonstrate a high error threshold of 3.65% per cz gate for pure Rydberg decay and achieve a favorable error distance d_{e}≈d. Our method compares favorably with state-of-the-art erasure conversion protocols in the subthreshold performance, offering comparable or marginally larger logical error rates while significantly reducing experimental overhead.
Neutral atom arrays manipulated with optical tweezers are promising candidates for fault tolerant quantum computers due to their advantageous properties, such as scalability, long coherence times, and optical accessibility for communication. A significant challenge to overcome is the presence of non-Pauli errors, specifically erasure errors and leakage errors. Previous work has shown that leakage errors can be converted into erasure errors; however, these (converted) erasure errors continuously occur and accumulate over time. Prior proposals have involved transporting atoms directly from a reservoir area—where spare atoms are stored—to the computational area—where computation and error correction are performed—to correct atom loss. While coherent transport is promising, it may not address all challenges—particularly its effectiveness in dense arrays and the efficacy of alternative methods should be investigated. In this study, we evaluate the effects of erasure errors on the surface code using circuit-based Monte Carlo simulations that incorporate depolarizing and accumulated erasure errors. We propose a new scheme to mitigate this problem: a k-shift erasure recovery scheme. Our scheme employs code deformation to repeatedly transfer the logical qubit from an imperfect array with accumulated erased qubits to a perfect array, thereby tolerating many accumulated erasures. Furthermore, our scheme corrects erasure errors in the atom arrays while the logical qubits are evacuated from the area being corrected; thus, manipulating optical tweezers for erasure correction does not disturb the qubits that constitute the logical data. Our scheme provides a practical pathway for neutral atom quantum computers to achieve feasible fault tolerance.