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:2505.17718 · Physical Review Applied

Leveraging biased noise for more efficient quantum error correction at the circuit level with two-level qubits

Josu Etxezarreta Martínez, Paul Schnabl, Javier Oliva del Moral, Reza Dastbasteh, Pedro M. Crespo, R. M. Otxoa

Published Dec 16, 2025• 1 citation
arXivHTMLPDF

Abstract

Tailoring quantum-error-correction codes (QECCs) to biased noise has demonstrated significant benefits. However, most of the prior research on this topic has focused on code-capacity noise models. Furthermore, a no-go theorem prevents the construction of controlled- () gates for two-level qubits in a bias-preserving manner which may, in principle, imply that noise bias cannot be leveraged in such systems. In this work, we show that a residual bias up to η ∼ 5 can be maintained in gates under certain conditions. Moreover, we employ controlled- () gates in syndrome-extraction circuits and show how to natively implement these in a bias-preserving manner for a broad class of qubit platforms. This motivates the introduction of what we call a (HBD) circuit-level noise model that captures these features. We numerically study the performance of the X Z Z X surface code and observe that bias-preserving gates are critical for leveraging biased noise. Accounting for the residual bias present in the gates, we observe an increase in the code threshold up to a 1.27 % physical error rate, representing a 90 % improvement. Additionally, we find that the required qubit footprint can be reduced by up to 75 % at relevant physical error rates.

DOI
10.1103/q7w6-nljp

Related papers

Optimizing bias-tailored quantum error correction beyond code-capacity noise

César Benito, I. Jesán Velázquez-Reséndiz, Alejandro Bermudez

We find that the substantial advantages predicted for bias-tailored quantum error correction (QEC) under code-capacity noise are strongly reduced once realistic syndrome extraction and circuit-level noise models are considered. We start by comparing XZZX codes to rectangular surface codes with a bias-dependent optimised anisotropy. Although code-capacity simulations predict an advantage of rectangular surface codes in the limit of high noise bias, this actually disappears under circuit-level noise, making the XZZX codes the preferred and simplest choice even for platforms that allow for a flexible variation of the code layout adapted to changes in noise calibration. Our results identify bias degradation during syndrome extraction under circuit-level noise as the central limitation of biased-tailored QEC. To partially mitigate this effect, we introduce a bias-filtering CNOT gadget that temporarily encodes the ancillary target qubit during syndrome extraction in a repetition code and, upon measurement and feed forward, manages to reduce the bias degradation. In a regime of high-bias and low-idle errors, this bias-filtering gadget yields a few-percent relative improvement of the XZZX code error threshold, demonstrating that lightweight bias-filtering strategies can recover part of the lost bias-tailoring advantage for realistic circuit-level noise.

quant-pharXiv:2606.17709•Jun 17, 2026•0 citations

Q-Pandora Unboxed: Characterizing Resilience of Quantum Error Correction Codes Under Biased Noise

Avimita Chatterjee, Subrata Kumar Das, Swaroop Ghosh

Quantum error correction codes (QECCs) are essential for reliable quantum computing as they protect quantum states against noise and errors. Limited research has explored the resilience of QECCs to biased noise, critical for selecting optimal codes. We examine how different noise types impact QECCs, considering the varying susceptibility of quantum systems to specific errors. Our goal is to identify opportunities to minimize the resources—or overhead—needed for effective error correction. We conduct a detailed study on two QECCs—rotated and unrotated surface codes—under various noise models using simulations. Rotated surface codes generally perform better due to their simplicity and lower qubit overhead. They exceed the noise threshold of current quantum processors, making them more effective at lower error rates. This study highlights a hierarchy in surface code implementation based on resource demand, consistently observed across both code types. Our analysis ranks the code-capacity model as the most pessimistic and the circuit-level model as the most realistic, mapping error thresholds that show surface code advantages. Additionally, higher code distances improve performance without excessively increasing qubit overhead. Tailoring surface codes to align with the target logical error rate and the biased physical error profile is crucial for optimizing reliability and resource use.

arXiv:2308.02769•Applied Sciences•Apr 21, 2025•2 citations

Threshold Behavior of ZX and ZY Surface Codes Under Circuit-Level Biased and Crosstalk Noise

Pritesh Thakur, Jean-François Van Huele

Studying the threshold behavior of surface codes under biased noise models is an active area of research. Previous work Tuckett et al. (2018), using an optimal tensor-network decoder, demonstrated that replacing $Z$-type stabilizers with $Y$-type stabilizers significantly improves the surface code threshold under code-capacity level dephasing noise. In this work, we construct and study a $ZY$ surface code by replacing the $X$-type stabilizers with $Y$-type stabilizers. We compare it with the standard $ZX$ surface code under circuit-level Pauli-$X$ biased noise, with and without an additional gate-based $XX$ crosstalk noise. We find that for the $ZX$ surface code, the $X$-memory threshold increases monotonically with bias while the $Z$-memory threshold decreases and saturates. For the $ZY$ surface code, the $Y$-memory threshold is nearly constant across all bias values. The $Z$-memory thresholds of the $ZX$ and $ZY$ codes are consistent within the uncertainty. Adding $XX$ crosstalk reduces the $Z$-memory threshold beyond the fitting uncertainty while leaving the $X$ memory threshold largely unaffected. The choice of CNOT ordering redistributes threshold performance between the two logical memories. Our work extends prior observations from code-capacity level noise to circuit-level noise. It also indicates the need for decoders capable of jointly reasoning over correlated syndrome information so that tailored stabilizer structures could be fully utilized for quantum error correction.

quant-pharXiv:2609.10876•Sep 11, 2026•0 citations

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

Diego Ruiz, Jérémie Guillaud, Christophe Vuillot +1 more

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.

quant-pharXiv:2607.20143•Jul 23, 2026•0 citations

Tailoring surface codes: Improvements in quantum error correction with biased noise

David K. Tuckett

For quantum computers to reach their full potential will require error correction. We study the surface code, one of the most promising quantum error correcting codes, in the context of predominantly dephasing (Z-biased) noise, as found in many quantum architectures. We find that the surface code is highly resilient to Y-biased noise, and tailor it to Z-biased noise, whilst retaining its practical features. We demonstrate ultrahigh thresholds for the tailored surface code: ~39% with a realistic bias of  = 100, and ~50% with pure Z noise, far exceeding known thresholds for the standard surface code: ~11% with pure Z noise, and ~19% with depolarizing noise. Furthermore, we provide strong evidence that the threshold of the tailored surface code tracks the hashing bound for all biases. We reveal the hidden structure of the tailored surface code with pure Z noise that is responsible for these ultrahigh thresholds. As a consequence, we prove that its threshold with pure Z noise is 50%, and we show that its distance to Z errors, and the number of failure modes, can be tuned by modifying its boundary. For codes with appropriately modified boundaries, the distance to Z errors is O(n) compared to O(n1/2) for square codes, where n is the number of physical qubits. We demonstrate that these characteristics yield a significant improvement in logical error rate with pure Z and Z-biased noise. Finally, we introduce an efficient approach to decoding that exploits code symmetries with respect to a given noise model, and extends readily to the fault-tolerant context, where measurements are unreliable. We use this approach to define a decoder for the tailored surface code with Z-biased noise. Although the decoder is suboptimal, we observe exceptionally high fault-tolerant thresholds of ~5% with bias  = 100 and exceeding 6% with pure Z noise. Our results open up many avenues of research and, recent developments in bias-preserving gates, highlight their direct relevance to experiment.

•Jan 14, 2021•16 citations

Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise

Peter Shanahan, Diego Ruiz

Biased-noise qubits, in which one type of error (e.g. $X$- and $Y$-type errors) is significantly suppressed relative to the other (e.g. $Z$-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases $η\ge 7\times10^{4}$, reducing the qubit overhead by over 50% at $p_Z=10^{-3}$ and $η= 2 \times 10^6$ to achieve a logical error rate of $10^{-12}$. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.

quant-pharXiv:2601.10786•Jan 19, 2026•0 citations
Tailoring quantum-error-correction codes (QECCs) to biased noise has demonstrated significant benefits. However, most of the prior research on this topic has focused on code-capacity noise models. Furthermore, a no-go theorem prevents the construction of controlled- () gates for two-level qubits in a bias-preserving manner which may, in principle, imply that noise bias cannot be leveraged in such systems. In this work, we show that a residual bias up to η ∼ 5 can be maintained in gates under certain conditions. Moreover, we employ controlled- () gates in syndrome-extraction circuits and show how to natively implement these in a bias-preserving manner for a broad class of qubit platforms. This motivates the introduction of what we call a (HBD) circuit-level noise model that captures these features. We numerically study the performance of the X Z Z X surface code and observe that bias-preserving gates are critical for leveraging biased noise. Accounting for the residual bias present in the gates, we observe an increase in the code threshold up to a 1.27 % physical error rate, representing a 90 % improvement. Additionally, we find that the required qubit footprint can be reduced by up to 75 % at relevant physical error rates.
We find that the substantial advantages predicted for bias-tailored quantum error correction (QEC) under code-capacity noise are strongly reduced once realistic syndrome extraction and circuit-level noise models are considered. We start by comparing XZZX codes to rectangular surface codes with a bias-dependent optimised anisotropy. Although code-capacity simulations predict an advantage of rectangular surface codes in the limit of high noise bias, this actually disappears under circuit-level noise, making the XZZX codes the preferred and simplest choice even for platforms that allow for a flexible variation of the code layout adapted to changes in noise calibration. Our results identify bias degradation during syndrome extraction under circuit-level noise as the central limitation of biased-tailored QEC. To partially mitigate this effect, we introduce a bias-filtering CNOT gadget that temporarily encodes the ancillary target qubit during syndrome extraction in a repetition code and, upon measurement and feed forward, manages to reduce the bias degradation. In a regime of high-bias and low-idle errors, this bias-filtering gadget yields a few-percent relative improvement of the XZZX code error threshold, demonstrating that lightweight bias-filtering strategies can recover part of the lost bias-tailoring advantage for realistic circuit-level noise.
Quantum error correction codes (QECCs) are essential for reliable quantum computing as they protect quantum states against noise and errors. Limited research has explored the resilience of QECCs to biased noise, critical for selecting optimal codes. We examine how different noise types impact QECCs, considering the varying susceptibility of quantum systems to specific errors. Our goal is to identify opportunities to minimize the resources—or overhead—needed for effective error correction. We conduct a detailed study on two QECCs—rotated and unrotated surface codes—under various noise models using simulations. Rotated surface codes generally perform better due to their simplicity and lower qubit overhead. They exceed the noise threshold of current quantum processors, making them more effective at lower error rates. This study highlights a hierarchy in surface code implementation based on resource demand, consistently observed across both code types. Our analysis ranks the code-capacity model as the most pessimistic and the circuit-level model as the most realistic, mapping error thresholds that show surface code advantages. Additionally, higher code distances improve performance without excessively increasing qubit overhead. Tailoring surface codes to align with the target logical error rate and the biased physical error profile is crucial for optimizing reliability and resource use.
Studying the threshold behavior of surface codes under biased noise models is an active area of research. Previous work Tuckett et al. (2018), using an optimal tensor-network decoder, demonstrated that replacing ZZZ-type stabilizers with YYY-type stabilizers significantly improves the surface code threshold under code-capacity level dephasing noise. In this work, we construct and study a ZYZYZY surface code by replacing the XXX-type stabilizers with YYY-type stabilizers. We compare it with the standard ZXZXZX surface code under circuit-level Pauli-XXX biased noise, with and without an additional gate-based XXXXXX crosstalk noise. We find that for the ZXZXZX surface code, the XXX-memory threshold increases monotonically with bias while the ZZZ-memory threshold decreases and saturates. For the ZYZYZY surface code, the YYY-memory threshold is nearly constant across all bias values. The ZZZ-memory thresholds of the ZXZXZX and ZYZYZY codes are consistent within the uncertainty. Adding XXXXXX crosstalk reduces the ZZZ-memory threshold beyond the fitting uncertainty while leaving the XXX memory threshold largely unaffected. The choice of CNOT ordering redistributes threshold performance between the two logical memories. Our work extends prior observations from code-capacity level noise to circuit-level noise. It also indicates the need for decoders capable of jointly reasoning over correlated syndrome information so that tailored stabilizer structures could be fully utilized for quantum error correction.
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.
For quantum computers to reach their full potential will require error correction. We study the surface code, one of the most promising quantum error correcting codes, in the context of predominantly dephasing (Z-biased) noise, as found in many quantum architectures. We find that the surface code is highly resilient to Y-biased noise, and tailor it to Z-biased noise, whilst retaining its practical features. We demonstrate ultrahigh thresholds for the tailored surface code: ~39% with a realistic bias of  = 100, and ~50% with pure Z noise, far exceeding known thresholds for the standard surface code: ~11% with pure Z noise, and ~19% with depolarizing noise. Furthermore, we provide strong evidence that the threshold of the tailored surface code tracks the hashing bound for all biases. We reveal the hidden structure of the tailored surface code with pure Z noise that is responsible for these ultrahigh thresholds. As a consequence, we prove that its threshold with pure Z noise is 50%, and we show that its distance to Z errors, and the number of failure modes, can be tuned by modifying its boundary. For codes with appropriately modified boundaries, the distance to Z errors is O(n) compared to O(n1/2) for square codes, where n is the number of physical qubits. We demonstrate that these characteristics yield a significant improvement in logical error rate with pure Z and Z-biased noise. Finally, we introduce an efficient approach to decoding that exploits code symmetries with respect to a given noise model, and extends readily to the fault-tolerant context, where measurements are unreliable. We use this approach to define a decoder for the tailored surface code with Z-biased noise. Although the decoder is suboptimal, we observe exceptionally high fault-tolerant thresholds of ~5% with bias  = 100 and exceeding 6% with pure Z noise. Our results open up many avenues of research and, recent developments in bias-preserving gates, highlight their direct relevance to experiment.
Biased-noise qubits, in which one type of error (e.g. XXX- and YYY-type errors) is significantly suppressed relative to the other (e.g. ZZZ-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases η≥7×104η\ge 7\times10^{4}η≥7×104, reducing the qubit overhead by over 50% at pZ=10−3p_Z=10^{-3}pZ​=10−3 and η=2×106η= 2 \times 10^6η=2×106 to achieve a logical error rate of 10−1210^{-12}10−12. Our construction relies on the concatenation of two classical codes. The inner codes are repetition phase-flip codes while the outer codes are high-rate bit-flip codes enabled by their implementation at the logical level, which circumvents device connectivity constraints. These results indicate that under sufficiently biased noise, it is advantageous to address phase-flip and bit-flip errors at different layers of the coding scheme. The inner code should prioritize a high threshold for phase-flip errors, while the bit-flip outer code should optimize for encoding rate efficiency. In the strong biased-noise regime, high-rate outer codes keep the overhead for correcting residual bit-flip errors comparable to that of the repetition code itself, meaningfully lower than that required by earlier approaches.