Erasure Error vs Pauli Error

The distinction between erasure errors and Pauli errors is one of the most consequential in quantum error correction. A Pauli error is hidden inside the computational space: the decoder must infer which qubit failed and which logical action occurred from syndrome data. An erasure error comes with location information: loss, leakage, or a heralding measurement identifies the affected qubit even though its encoded state must be treated as lost or arbitrary. The advantage is therefore not that the physical fault is intrinsically smaller, but that the decoder receives side information about where it happened. For independent erasures, the surface-code threshold can approach the roughly 50% bond-percolation limit, compared with order-1% circuit-level thresholds for generic unflagged Pauli noise; those numbers are model-dependent and should not be compared without stating the noise and measurement assumptions.

This note is about the flagging axis of an error model. It is deliberately separate from noise-bias-and-asymmetric-error-channels, which asks whether hidden in-codespace faults favor one Pauli direction over another. A device can have a large erasure fraction and little Pauli bias, strong Pauli bias and no erasure flag, both, or neither.

Routing boundary

If the architectural resource is…Start with…Track…
A known fault location supplied by loss, leakage, or heraldingThis noteErasure fraction, flag-detection fidelity, and unflagged residual error
A skew among hidden , , and faultsnoise-bias-and-asymmetric-error-channelsA declared Pauli-bias convention and its decoder assumptions
Both flagged loss and biased residual Pauli noiseRead both notesErasure and Pauli components separately; do not collapse them into one “bias” number

The physics behind engineering erasure dominance is elegant: the dominant physical error processes are converted into transitions that leave the computational subspace entirely, landing in a detectable “leaked” state. The paradigmatic example is the dual-rail encoding in superconducting circuits. A logical qubit is encoded as and across two transmon modes (or a transmon and a cavity). The dominant error — single-photon loss ( decay) — sends or . The leaked state is outside the code space and is detected by a parity check before each round of syndrome extraction. Once detected, the error is flagged as an erasure and the decoder operates in the favorable erasure regime. Crucially, the residual Pauli errors (dephasing within the code space, correlated multi-photon events) are much rarer than the converted erasures, establishing an error hierarchy where erasures dominate by a large factor.

Neutral atom platforms achieve erasure conversion through a different mechanism: atom loss. When a Yb or Rb atom in a tweezer array undergoes an off-resonant scattering event during a Rydberg gate, it is ejected from the trap. The resulting empty site is detected by fluorescence imaging with near-unit efficiency before the next error correction cycle. Since atom loss is the dominant gate error mechanism, the error budget is erasure-dominated. Wu et al. (2022) and related alkaline-earth neutral-atom work demonstrated that engineering this erasure hierarchy in Yb yields gate error budgets where erasures outnumber Pauli errors by , directly translating to reduced surface code overhead.

The erasure-vs-Pauli hierarchy is now a deliberate design principle for next-generation quantum architectures. Rather than fighting the dominant error channel, the strategy is to convert it: choose an encoding where the most common physical process produces a detectable leakage event rather than an undetected rotation. The dual-rail superconducting qubit (Teoh et al. 2023, Levine et al. 2024), dual-rail photonic qubit (photon loss → vacuum detection), and metastable-state neutral atom encodings all follow this philosophy. The key metric is the erasure fraction : architectures with can operate at significantly relaxed physical error rates while still achieving low logical error rates, potentially accelerating the timeline to fault-tolerant quantum computation.

Key relationships

References