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:2310.01512 · Physical Review Letters

Quantum Sensing with Erasure Qubits

Pradeep Niroula, Jonathan Dolde, Xin Zheng, Jacob Bringewatt, Adam Ehrenberg, Kevin C. Cox, Jeff Thompson, Michael J. Gullans, Shimon Kolkowitz, Alexey Vyacheslavovich Gorshkov

Published Aug 19, 2024• 17 citations
arXivHTMLPDF

Abstract

The dominant noise in an "erasure qubit" is an erasure-a type of error whose occurrence and location can be detected. Erasure qubits have potential to reduce the overhead associated with fault tolerance. To date, research on erasure qubits has primarily focused on quantum computing and quantum networking applications. Here, we consider the applicability of erasure qubits to quantum sensing and metrology. We show theoretically that, for the same level of noise, an erasure qubit acts as a more precise sensor or clock compared to its nonerasure counterpart. We experimentally demonstrate this by artificially injecting either erasure errors (in the form of atom loss) or dephasing errors into a differential optical lattice clock comparison, and observe enhanced precision in the case of erasure errors for the same injected error rate. In the context of a clock with repeated measurement cycles, erasure can improve the stability by a factor of 2. Similar benefits of erasure qubits to sensing can be realized in other quantum platforms like Rydberg atoms and superconducting qubits.

DOI
10.1103/physrevlett.133.080801

Related papers

Optimal quantum metrology protocols with erasure qubits

Michal Arieli, Alex Retzker, Tuvia Gefen

We investigate the precision limits and optimal protocols for sensing single qubit signals in the presence of erasure noise. We study a hierarchy of precision limits achievable with metrological strategies of differing complexity, and identify the optimal protocol for each. The detectability of erasure noise is shown to lead to enhanced precision limits and simplified sensing protocols. For energy gap estimation, we demonstrate that a simple product-state strategy with continuous erasure detection yields significant improvements, outperforming optimal passive entangled protocols over a broad range of finite system sizes. We show that for other single-qubit signals, quantum error correction provides a substantial advantage by correcting the dominant erasure processes, and can restore Heisenberg-limited precision in certain erasure configurations. As a byproduct of our analysis, we find erasure-conversion schemes for qubits subject to thermal noise that attain the corresponding ultimate precision limits.

quant-pharXiv:2603.11807•Mar 13, 2026•2 citations

Fault-tolerant quantum architectures based on erasure qubits

Shouzhen Gu, Alex Retzker, Aleksander Kubica

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We start by introducing a formalism for QEC schemes with erasure qubits and express the corresponding decoding problem as a matching problem. Then, we propose and optimize QEC schemes based on erasure qubits and the recently introduced Floquet codes. Our schemes are well suited for superconducting circuits, being compatible with planar layouts. We numerically estimate the memory thresholds for the circuit noise model that includes spreading (via entangling operations) and imperfect detection of erasures. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.

arXiv:2312.14060•Physical Review Research•Mar 6, 2025•28 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

Fault-Tolerant Heisenberg-Limited Quantum Sensing

Lorcan O. Conlon, Yu-Xin Wang, Erfan Abbasgholinejad +3 more

Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions under which quantum advantage in sensing can be achieved are rather restrictive, and most quantum enhancements in sensing are lost in the presence of noise, errors, or a poorly calibrated system. To overcome these limitations, we are motivated to import ideas from fault-tolerant quantum computing to quantum sensing. Specifically, we consider a qubit noise model where the probability of phase-flip errors is exponentially smaller (in qubit number) compared to the probability of bit-flip errors that occur with probability $p$. For this noise structure, we demonstrate that, given a total sensing time $T$, Heisenberg scaling can be attained for times up to $T\propto 1/p^{(N+1)/2}$ for a $N$-qubit repetition code, in contrast with $T\propto 1/p$ without using a fault-tolerant sensing protocol.

quant-pharXiv:2608.00171•Aug 4, 2026•5 citations

Optimizing Quantum Error-Correction Protocols with Erasure Qubits

Shouzhen Gu, Yotam Vaknin, Alex Retzker +1 more

Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction (QEC) protocols. However, they require additional operations, such as erasure checks, that may add extra noise and increase the run-time of QEC protocols. To assess the benefits provided by erasure qubits, we focus on the performance of the surface code as a quantum memory. In particular, we analyze various erasure check schedules, find the correctable regions in the phase space of error parameters, and probe the subthreshold scaling of the logical error rate. We then consider a realization of erasure qubits in the superconducting hardware architectures via dual-rail qubits. We use the standard transmon-based implementation of the surface code as the performance benchmark. Our results indicate that QEC protocols with erasure qubits can outperform the ones with state-of-the-art transmons, even in the absence of precise information about the locations of erasure errors.

arXiv:2408.00829•PRX Quantum•Oct 22, 2025•28 citations

A biased-erasure cavity qubit with hardware-efficient quantum error detection

Jiasheng Mai, Qiyu Liu, Xiaowei Deng +8 more

Erasure qubits are beneficial for quantum error correction due to their relaxed threshold requirements. While dual-rail erasure qubits have been demonstrated with a strong error hierarchy in circuit quantum electrodynamics, biased-erasure qubits -- where erasures originate predominantly from one logical basis state -- offer further advantages. Here, we realize a hardware-efficient biased-erasure qubit encoded in the vacuum and two-photon Fock states of a single microwave cavity. The qubit exhibits an erasure bias ratio of over 265. By using a transmon ancilla for logical measurements and mid-circuit erasure detections, we achieve logical state assignment errors below 1% and convert over 99.3% leakage errors into detected erasures. After postselection against erasures, we achieve effective logical relaxation and dephasing rates of $(6.2~\mathrm{ms})^{-1}$ and $(3.1~\mathrm{ms})^{-1}$, respectively, which exceed the erasure error rate by factors of 31 and 15, establishing a strong error hierarchy within the logical subspace. These postselected error rates indicate a coherence gain of about 6.0 beyond the break-even point set by the best physical qubit encoded in the two lowest Fock states in the cavity. Moreover, randomized benchmarking with interleaved erasure detections reveals a residual logical gate error of 0.29%. This work establishes a compact and hardware-efficient platform for biased-erasure qubits, promising concatenations into outer-level stabilizer codes toward fault-tolerant quantum computation.

quant-pharXiv:2601.21616•Jan 30, 2026•5 citations
The dominant noise in an "erasure qubit" is an erasure-a type of error whose occurrence and location can be detected. Erasure qubits have potential to reduce the overhead associated with fault tolerance. To date, research on erasure qubits has primarily focused on quantum computing and quantum networking applications. Here, we consider the applicability of erasure qubits to quantum sensing and metrology. We show theoretically that, for the same level of noise, an erasure qubit acts as a more precise sensor or clock compared to its nonerasure counterpart. We experimentally demonstrate this by artificially injecting either erasure errors (in the form of atom loss) or dephasing errors into a differential optical lattice clock comparison, and observe enhanced precision in the case of erasure errors for the same injected error rate. In the context of a clock with repeated measurement cycles, erasure can improve the stability by a factor of 2. Similar benefits of erasure qubits to sensing can be realized in other quantum platforms like Rydberg atoms and superconducting qubits.
We investigate the precision limits and optimal protocols for sensing single qubit signals in the presence of erasure noise. We study a hierarchy of precision limits achievable with metrological strategies of differing complexity, and identify the optimal protocol for each. The detectability of erasure noise is shown to lead to enhanced precision limits and simplified sensing protocols. For energy gap estimation, we demonstrate that a simple product-state strategy with continuous erasure detection yields significant improvements, outperforming optimal passive entangled protocols over a broad range of finite system sizes. We show that for other single-qubit signals, quantum error correction provides a substantial advantage by correcting the dominant erasure processes, and can restore Heisenberg-limited precision in certain erasure configurations. As a byproduct of our analysis, we find erasure-conversion schemes for qubits subject to thermal noise that attain the corresponding ultimate precision limits.
The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We start by introducing a formalism for QEC schemes with erasure qubits and express the corresponding decoding problem as a matching problem. Then, we propose and optimize QEC schemes based on erasure qubits and the recently introduced Floquet codes. Our schemes are well suited for superconducting circuits, being compatible with planar layouts. We numerically estimate the memory thresholds for the circuit noise model that includes spreading (via entangling operations) and imperfect detection of erasures. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
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.
Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions under which quantum advantage in sensing can be achieved are rather restrictive, and most quantum enhancements in sensing are lost in the presence of noise, errors, or a poorly calibrated system. To overcome these limitations, we are motivated to import ideas from fault-tolerant quantum computing to quantum sensing. Specifically, we consider a qubit noise model where the probability of phase-flip errors is exponentially smaller (in qubit number) compared to the probability of bit-flip errors that occur with probability ppp. For this noise structure, we demonstrate that, given a total sensing time TTT, Heisenberg scaling can be attained for times up to T∝1/p(N+1)/2T\propto 1/p^{(N+1)/2}T∝1/p(N+1)/2 for a NNN-qubit repetition code, in contrast with T∝1/pT\propto 1/pT∝1/p without using a fault-tolerant sensing protocol.
Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction (QEC) protocols. However, they require additional operations, such as erasure checks, that may add extra noise and increase the run-time of QEC protocols. To assess the benefits provided by erasure qubits, we focus on the performance of the surface code as a quantum memory. In particular, we analyze various erasure check schedules, find the correctable regions in the phase space of error parameters, and probe the subthreshold scaling of the logical error rate. We then consider a realization of erasure qubits in the superconducting hardware architectures via dual-rail qubits. We use the standard transmon-based implementation of the surface code as the performance benchmark. Our results indicate that QEC protocols with erasure qubits can outperform the ones with state-of-the-art transmons, even in the absence of precise information about the locations of erasure errors.
Erasure qubits are beneficial for quantum error correction due to their relaxed threshold requirements. While dual-rail erasure qubits have been demonstrated with a strong error hierarchy in circuit quantum electrodynamics, biased-erasure qubits -- where erasures originate predominantly from one logical basis state -- offer further advantages. Here, we realize a hardware-efficient biased-erasure qubit encoded in the vacuum and two-photon Fock states of a single microwave cavity. The qubit exhibits an erasure bias ratio of over 265. By using a transmon ancilla for logical measurements and mid-circuit erasure detections, we achieve logical state assignment errors below 1% and convert over 99.3% leakage errors into detected erasures. After postselection against erasures, we achieve effective logical relaxation and dephasing rates of (6.2 ms)−1(6.2~\mathrm{ms})^{-1}(6.2 ms)−1 and (3.1 ms)−1(3.1~\mathrm{ms})^{-1}(3.1 ms)−1, respectively, which exceed the erasure error rate by factors of 31 and 15, establishing a strong error hierarchy within the logical subspace. These postselected error rates indicate a coherence gain of about 6.0 beyond the break-even point set by the best physical qubit encoded in the two lowest Fock states in the cavity. Moreover, randomized benchmarking with interleaved erasure detections reveals a residual logical gate error of 0.29%. This work establishes a compact and hardware-efficient platform for biased-erasure qubits, promising concatenations into outer-level stabilizer codes toward fault-tolerant quantum computation.