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

Erasure Conversion and the Error Budget: What Detectable Errors Buy a Surface Code

William Alexander Aldred

Published Nov 15, 2026• 0 citations
Publisher

Abstract

An error whose location is known is far cheaper to correct than an error that must first be found: pure erasure channels tolerate error rates several times higher than Pauli channels, a fact known since the earliest threshold studies. Erasure conversion, engineering a qubit so that its dominant failures announce themselves, therefore buys fault tolerance with information rather than with distance. This paper budgets the purchase. If ninety per cent of a platform's errors are converted to located erasures, the unlocated residue falls from 1.00e-3 to 1.00e-4, and the effective threshold for the mixed channel rises by a factor of about 4 over the purely unlocated figure. Priced through the standard scaling ansatz, the conversion is worth several units of code distance at fixed logical quality, which at algorithmic distances is worth a third or more of the machine. The paper reviews the hardware routes that deliver conversion, dual-rail superconducting qubits, metastable-state ions and loss-detecting atom encodings, and charges each route its conversion overhead.

DOI
10.5281/zenodo.24245368

Related papers

Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays

Yue Wu, Shimon Kolkowitz, Shruti Puri +1 more

Abstract Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable quantum computing, but the requisite numbers of qubits and physical error rates are demanding for current experimental hardware. Recently, the development of error correcting codes tailored to particular physical noise models has helped relax these requirements. In this work, we propose a qubit encoding and gate protocol for 171 Yb neutral atom qubits that converts the dominant physical errors into erasures, that is, errors in known locations. The key idea is to encode qubits in a metastable electronic level, such that gate errors predominantly result in transitions to disjoint subspaces whose populations can be continuously monitored via fluorescence. We estimate that 98% of errors can be converted into erasures. We quantify the benefit of this approach via circuit-level simulations of the surface code, finding a threshold increase from 0.937% to 4.15%. We also observe a larger code distance near the threshold, leading to a faster decrease in the logical error rate for the same number of physical qubits, which is important for near-term implementations. Erasure conversion should benefit any error correcting code, and may also be applied to design new gates and encodings in other qubit platforms.

arXiv:2201.03540•Nature Communications•Aug 9, 2022•238 citations

Surface Code with Imperfect Erasure Checks

Kathleen Chang, Shraddha Singh, Jahan Claes +3 more

Recently, significant effort has been devoted towards designing erasure qubits in which dominant physical noise excites detectable leakage states that can be returned to the qubit subspace. Interest in these erasure qubits has been driven by studies showing that the requirements for fault-tolerant quantum error correction are significantly relaxed when noise in every gate operation is dominated by erasures. However, these studies assume perfectly accurate erasure checks after every gate operation which generally come with undesirable time and hardware overhead costs. In this work, we investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions on the imperfect erasure checks, the threshold error rate is still at least over twice that for Pauli noise. We also study the impact of imperfect erasure checks on the effective error distance and find that it degrades the effective distance under a general error model in which a qubit suffers from depolarizing noise when interacting with a leaked qubit. We then identify a more restrictive but realistic noise model for a qubit that interacts with a leaked qubit, under which the effective error distance is twice that for Pauli noise. We apply our analysis to recently proposed superconducting dual-rail erasure qubits and show that achieving good-performance surface code quantum memories with relaxed system requirements is possible.

arXiv:2408.00842•PRX Quantum•Oct 8, 2025•23 citations

Developments in superconducting erasure qubits for hardware-efficient quantum error correction

Maria Violaris, Luciana Henaut, James Wills +3 more

Quantum computers are inherently noisy, and a crucial challenge for achieving large-scale, fault-tolerant quantum computing is to implement quantum error correction. A promising direction that has made rapid recent progress is to design hardware that has a specific noise profile, leading to a significantly higher threshold for noise with certain quantum error correcting codes. This Perspective focuses on erasure qubits, which enable hardware-efficient quantum error correction, by concatenating an inner code built-in to the hardware with an outer code. We focus on implementations of dual-rail encoded erasure qubits using superconducting qubits, giving an overview of recent developments in theory and simulation, and hardware demonstrators. We also discuss the differences between implementations; near-term applications using quantum error detection; and the open problems for developing this approach towards early fault-tolerant quantum computers.

quant-pharXiv:2601.02183•Materials for Quantum Technology•Jan 6, 2026•0 citations

Quantum Error Correction with Metastable States of Trapped Ions Using Erasure Conversion

Mingyu Kang, Wesley C. Campbell, Kenneth R. Brown

Erasures, or errors with known locations, are a more favorable type of error for quantum error-correcting codes than Pauli errors.Converting physical noise into erasures can significantly improve the performance of quantum error correction.Here, we apply the idea of performing erasure conversion by encoding qubits into metastable atomic states, proposed by Wu, Kolkowitz, Puri, and Thompson [Nat.Comm.13, 4657 (2022)], to trapped ions.We suggest an erasure-conversion scheme for metastable trapped-ion qubits and develop a detailed model of various types of errors.We then compare the logical performance of ground and metastable qubits on the surface code under various physical constraints and conclude that metastable qubits may outperform ground qubits when the achievable laser power is higher for metastable qubits.

arXiv:2210.15024•PRX Quantum•Jun 30, 2023•89 citations

Magic State Injection with Erasure Qubits

Shoham Jacoby, Yotam Vaknin, Alex Retzker +1 more

Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding of erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical error rate are significantly improved. While previous research has focused primarily on fault-tolerant quantum memories, we extend this investigation to magic state injection—a critical yet resource-intensive component of fault-tolerant quantum computation. We show that, after postselection on erasures, the logical error rate of the injected magic state is set by the residual Pauli error, while the space-time overhead is only marginally increased as compared with the case of non-erasure qubits with a similar noise strength. These conclusions hold both for injection into the surface code and for injection and cultivation on the color code. For the former, we show that most of the gains can be achieved by the use of just three strategically placed erasure qubits in the surface code patch, independent of the patch size. For the latter, in contrast, it is beneficial to have all the qubits in the cultivation patch be erasure qubits. Our results for cultivation suggest that algorithmically relevant logical error rates may be within reach magic state distillation for erasure rates ≲ 4 × 10 − 3 and residual Pauli error rates of ∼ 10 − 4 .

arXiv:2504.02935•PRX Quantum•Sep 4, 2025•7 citations

Hardware-Efficient Erasure Qubits With Superconducting Transmon Qutrits

Bao-Jie Liu, Ying-Ying Wang, Yu-Xin Wang +3 more

Quantum error correction using erasure qubits offers higher fault-tolerant thresholds and improved scaling by converting dominant physical errors into detectable erasures. In superconducting circuits, erasure qubits can be constructed using the dual-rail approach, which, however, requires additional qubit-count overhead and tailored coupling elements. Here, we demonstrate a hardware-efficient scheme that operates transmon qutrits as erasure qubits, which is compatible with standard superconducting circuit-QED hardware. The logical states $\ket{0_\text{L}}$ and $\ket{1_\text{L}}$ are represented by the ground and second excited states, while the dominant relaxation errors can be detected via an ancilla qubit using a microwave-activated two-qutrit SWAP gate. We demonstrate a logical qubit $T_1$ lifetime exceeding $500\,μ\mathrm{s}$, post-selected with repeated mid-circuit erasure detection, which is ten times longer than the $T_1$ time of the transmon physical qubit. Coherence times beyond $300\,μ\mathrm{s}$ are achieved using dynamical decoupling. Single-qubit gate operations reach average Clifford gate infidelity on the order of $10^{-4}$. We further demonstrate dual-purposing an ancilla qubit for both erasure detection and parity checking, showing heralded generation of Bell states between erasure qubits. These results suggest that mainstream architectures of transmon qubit arrays may already be capable of implementing erasure-based QEC strategies for hardware-efficient fault-tolerant quantum computing.

quant-pharXiv:2604.08672•Apr 13, 2026•3 citations
An error whose location is known is far cheaper to correct than an error that must first be found: pure erasure channels tolerate error rates several times higher than Pauli channels, a fact known since the earliest threshold studies. Erasure conversion, engineering a qubit so that its dominant failures announce themselves, therefore buys fault tolerance with information rather than with distance. This paper budgets the purchase. If ninety per cent of a platform's errors are converted to located erasures, the unlocated residue falls from 1.00e-3 to 1.00e-4, and the effective threshold for the mixed channel rises by a factor of about 4 over the purely unlocated figure. Priced through the standard scaling ansatz, the conversion is worth several units of code distance at fixed logical quality, which at algorithmic distances is worth a third or more of the machine. The paper reviews the hardware routes that deliver conversion, dual-rail superconducting qubits, metastable-state ions and loss-detecting atom encodings, and charges each route its conversion overhead.
Abstract Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable quantum computing, but the requisite numbers of qubits and physical error rates are demanding for current experimental hardware. Recently, the development of error correcting codes tailored to particular physical noise models has helped relax these requirements. In this work, we propose a qubit encoding and gate protocol for 171 Yb neutral atom qubits that converts the dominant physical errors into erasures, that is, errors in known locations. The key idea is to encode qubits in a metastable electronic level, such that gate errors predominantly result in transitions to disjoint subspaces whose populations can be continuously monitored via fluorescence. We estimate that 98% of errors can be converted into erasures. We quantify the benefit of this approach via circuit-level simulations of the surface code, finding a threshold increase from 0.937% to 4.15%. We also observe a larger code distance near the threshold, leading to a faster decrease in the logical error rate for the same number of physical qubits, which is important for near-term implementations. Erasure conversion should benefit any error correcting code, and may also be applied to design new gates and encodings in other qubit platforms.
Recently, significant effort has been devoted towards designing erasure qubits in which dominant physical noise excites detectable leakage states that can be returned to the qubit subspace. Interest in these erasure qubits has been driven by studies showing that the requirements for fault-tolerant quantum error correction are significantly relaxed when noise in every gate operation is dominated by erasures. However, these studies assume perfectly accurate erasure checks after every gate operation which generally come with undesirable time and hardware overhead costs. In this work, we investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions on the imperfect erasure checks, the threshold error rate is still at least over twice that for Pauli noise. We also study the impact of imperfect erasure checks on the effective error distance and find that it degrades the effective distance under a general error model in which a qubit suffers from depolarizing noise when interacting with a leaked qubit. We then identify a more restrictive but realistic noise model for a qubit that interacts with a leaked qubit, under which the effective error distance is twice that for Pauli noise. We apply our analysis to recently proposed superconducting dual-rail erasure qubits and show that achieving good-performance surface code quantum memories with relaxed system requirements is possible.
Quantum computers are inherently noisy, and a crucial challenge for achieving large-scale, fault-tolerant quantum computing is to implement quantum error correction. A promising direction that has made rapid recent progress is to design hardware that has a specific noise profile, leading to a significantly higher threshold for noise with certain quantum error correcting codes. This Perspective focuses on erasure qubits, which enable hardware-efficient quantum error correction, by concatenating an inner code built-in to the hardware with an outer code. We focus on implementations of dual-rail encoded erasure qubits using superconducting qubits, giving an overview of recent developments in theory and simulation, and hardware demonstrators. We also discuss the differences between implementations; near-term applications using quantum error detection; and the open problems for developing this approach towards early fault-tolerant quantum computers.
Erasures, or errors with known locations, are a more favorable type of error for quantum error-correcting codes than Pauli errors.Converting physical noise into erasures can significantly improve the performance of quantum error correction.Here, we apply the idea of performing erasure conversion by encoding qubits into metastable atomic states, proposed by Wu, Kolkowitz, Puri, and Thompson [Nat.Comm.13, 4657 (2022)], to trapped ions.We suggest an erasure-conversion scheme for metastable trapped-ion qubits and develop a detailed model of various types of errors.We then compare the logical performance of ground and metastable qubits on the surface code under various physical constraints and conclude that metastable qubits may outperform ground qubits when the achievable laser power is higher for metastable qubits.
Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding of erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical error rate are significantly improved. While previous research has focused primarily on fault-tolerant quantum memories, we extend this investigation to magic state injection—a critical yet resource-intensive component of fault-tolerant quantum computation. We show that, after postselection on erasures, the logical error rate of the injected magic state is set by the residual Pauli error, while the space-time overhead is only marginally increased as compared with the case of non-erasure qubits with a similar noise strength. These conclusions hold both for injection into the surface code and for injection and cultivation on the color code. For the former, we show that most of the gains can be achieved by the use of just three strategically placed erasure qubits in the surface code patch, independent of the patch size. For the latter, in contrast, it is beneficial to have all the qubits in the cultivation patch be erasure qubits. Our results for cultivation suggest that algorithmically relevant logical error rates may be within reach magic state distillation for erasure rates ≲ 4 × 10 − 3 and residual Pauli error rates of ∼ 10 − 4 .
Quantum error correction using erasure qubits offers higher fault-tolerant thresholds and improved scaling by converting dominant physical errors into detectable erasures. In superconducting circuits, erasure qubits can be constructed using the dual-rail approach, which, however, requires additional qubit-count overhead and tailored coupling elements. Here, we demonstrate a hardware-efficient scheme that operates transmon qutrits as erasure qubits, which is compatible with standard superconducting circuit-QED hardware. The logical states ∣0L⟩\ket{0_\text{L}}∣0L​⟩ and ∣1L⟩\ket{1_\text{L}}∣1L​⟩ are represented by the ground and second excited states, while the dominant relaxation errors can be detected via an ancilla qubit using a microwave-activated two-qutrit SWAP gate. We demonstrate a logical qubit T1T_1T1​ lifetime exceeding 500 μs500\,μ\mathrm{s}500μs, post-selected with repeated mid-circuit erasure detection, which is ten times longer than the T1T_1T1​ time of the transmon physical qubit. Coherence times beyond 300 μs300\,μ\mathrm{s}300μs are achieved using dynamical decoupling. Single-qubit gate operations reach average Clifford gate infidelity on the order of 10−410^{-4}10−4. We further demonstrate dual-purposing an ancilla qubit for both erasure detection and parity checking, showing heralded generation of Bell states between erasure qubits. These results suggest that mainstream architectures of transmon qubit arrays may already be capable of implementing erasure-based QEC strategies for hardware-efficient fault-tolerant quantum computing.