Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors

• URL: http://arxiv.org/abs/2607.20143v1
• Date: Wed, 22 Jul 2026 13:45:09 GMT
• Title: Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors
• Abstract summary: We review the most prominent fault-tolerant protocols for biased-noise qubits.<n>We show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias.<n>We present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place.
• Score: 1.0499611180329804
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by engineering, as in stabilized cat qubits. This noise structure holds the promise of reducing the daunting hardware overhead of fault-tolerant quantum computing, but exploiting it requires physical operations that do not convert frequent phase-flips into rare bit-flips. In this review, we analyze the most prominent fault-tolerant protocols for biased-noise qubits, organized according to the available set of such bias-preserving operations. When this set is restricted to the CZ gate together with preparation and measurement in the X basis, we show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias: at experimentally relevant error rates, one may as well ignore the bias and rely on standard error correction designed for depolarizing noise. The situation changes drastically when a bias-preserving CX gate is available: the hierarchy of errors can then be reflected in the structure of the code, with frequent phase-flips corrected by a dedicated high-threshold code and rare bit-flips by concatenation with a high-rate code. The same hierarchy also enables hardware-efficient preparation of magic states. Finally, as a bias-preserving CX is forbidden in naturally biased platforms and challenging in engineered ones, we present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place, extending these overhead reductions to a much broader range of physical platforms.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Untangling QLDPC Codes with Biased Noise Ancilla [0.0]
  It is hard to design low-depth syndrome extraction circuits that do not spread errors from ancilla qubits to multiple data qubits.<n>Here, we investigate a hardware-aware approach to avoid these hooks and loops using biased noise ancillas.<n>This can result in almost an order of magnitude improvement in the logical error rate at circuit noise of $2times 10-3$.
  arXiv  Detail & Related papers  (2026-06-29T17:34:21Z)
• Fault tolerance against amplitude-damping noise using Bacon-Shor codes [1.7522836112265399]
  We design a fault tolerance scheme based on the Bacon-Shor codes which can protect against amplitude-damping noise in the device.<n>Our work thus establishes the possibility of achieving fault tolerance against amplitude-damping noise using noise-adapted quantum codes.
  arXiv  Detail & Related papers  (2025-03-28T02:59:30Z)
• Low bit-flip rate probabilistic error cancellation [0.0]
  Noise remains one of the most significant challenges in the development of reliable and scalable quantum processors.<n>In quantum computing architectures utilizing cat-qubits, the inherent exponential suppression of bit-flip errors can significantly reduce qubit count needed for effective error correction.<n>We demonstrate that the sampling cost associated with probabilistic error cancellation methods can be exponentially reduced with the depth of the circuit.
  arXiv  Detail & Related papers  (2024-11-10T11:04:16Z)
• Fault-tolerant quantum computation using large spin cat-codes [0.8640652806228457]
  We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code. We show how to generate a universal gate set, including the rank-preserving CNOT gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.
  arXiv  Detail & Related papers  (2024-01-08T22:56:05Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Quantum error correction with dissipatively stabilized squeezed cat qubits [68.8204255655161]
  We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit. We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
  arXiv  Detail & Related papers  (2022-10-24T16:02:20Z)
• Construction of Bias-preserving Operations for Pair-cat Code [17.34207569961146]
  Multi-level systems can achieve a desirable set of bias-preserving quantum operations. Cat codes are not compatible with continuous quantum error correction against excitation loss error. We generalize the bias-preserving operations to pair-cat codes to be compatible with continuous quantum error correction against both bosonic loss and dephasing errors.
  arXiv  Detail & Related papers  (2022-08-14T20:45:26Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.