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

Kvantfelskorrigering med balanserade produktkoder

Edy Alberto Flores Leal

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

Quantum computing is one of the most promising technological revolutions of the last few decades. Despite its potential, one problem it suffers from is that quantum bits (or qubits), its basic units of information, are intrinsically susceptible to noise. To counter the effects of such noise, we need fault-tolerant quantum computing, and for that, we need a systematic method to protect quantum information. This is the role of quantum error correction (QEC). However, most QEC codes are built on the assumption that X- and Z-type errors occur with equal frequency, which is not always the case for some realistic quantum hardware platforms. Among the several QEC protocols currently developed, surface codes are the leading implementation due to their high thresholds and local connectivity. Previous results have shown that modified variants of these codes, such as the XZZX surface code, can perform well under biased noise. Despite being realizable in two-dimensional real architectures, surface codes have poor encoding rates, leading to large overheads that prevent them from being scalable in fault-tolerant quantum architectures. Quantum low-density parity-check (qLDPC) codes provide a promising alternative, since they can achieve higher encoding rates. In this thesis, we study the code-capacity performance of bias-tailored qLDPC codes under both X- and Z-bias Pauli noise. We construct bias-tailored qLDPC codes, including bivariate bicycle codes, generalized toric codes, and clustered-cyclic codes, by applying Hadamard deformations that transform the Calderbank-Shor-Steane (CSS) codes into non-CSS codes. Using Monte Carlo simulations with minimum-weight perfect matching and belief propagation with localized-statistics decoding, we evaluate the word error rate of these bias-tailored qLDPC codes across different bias regimes. We show that Hadamard-deformed qLDPC codes can yield substantial performance improvements under biased noise and can match or even surpass those performances obtained from XZZX surface code implementations. In particular, we find that generalized toric codes perform consistently the best under bias noise in comparison to the bivariate and clustered-cyclic codes. These results indicate that bias tailoring can be extended to high-rate qLDPC constructions, leading to future work to study their performance in more realistic settings, such as circuit-level noise.

Related papers

Tailored XZZX codes for biased noise

Qian Xu, Nam Mannucci, Alireza Seif +3 more

Quantum error correction (QEC) for generic errors is challenging due to the demanding threshold and resource requirements. Interestingly, when physical noise is biased, we can tailor our QEC schemes to the noise to improve performance. Here we study a family of codes having XZZX-type stabilizer generators, including a set of cyclic codes generalized from the five-qubit code and a set of topological codes that we call generalized toric codes (GTCs). We show that these XZZX codes are highly qubit efficient if tailored to biased noise. To characterize the code performance, we use the notion of effective distance, which generalizes code distance to the case of biased noise and constitutes a proxy for the logical failure rate. We find that the XZZX codes can achieve a favorable resource scaling by this metric under biased noise. We also show that the XZZX codes have remarkably high thresholds that reach what is achievable by random codes, and furthermore they can be efficiently decoded using matching decoders. Finally, by adding only one flag qubit, the XZZX codes can realize fault-tolerant QEC while preserving their large effective distance. In combination, our results show that tailored XZZX codes give a resource-efficient scheme for fault-tolerant QEC against biased noise.

arXiv:2203.16486•Physical Review Research•Jan 23, 2023•45 citations

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

Designing and Simulating Quantum LDPC Codes for Superconducting Qubits

Hannes Tjulin

Quantum computers are predicted to be able to solve problems impossible for a classical supercomputer. The quantum computers that we have now are however very sensitive to noise from their environment, which makes their results unreliable. This necessitates quantum error correction, the main topic of this thesis. Specifically, this thesis concerns quantum Low Density Parity Check (qLDPC) codes for superconducting qubits. Superconducting qubits are one of the ways to implement a quantum computer, used for example by Google and IBM. qLDPC codes are error-correcting codes whose classical counterpart is used in 5G and Wi-Fi, among other applications. They are a type of stabilizer code, meaning that the quantum state we wish to store is subjected to a sequence of non-destructive measurements, whose results can tell if an error has occurred or not. Explaining this more in-depth is the bulk of this thesis. The qLDPC code chosen as most fitting for superconducting qubits is the bivariate bicycle (BB) code. In it, each qubit interacts with its four nearest neighbours as well as with two qubits further away, which allows for fewer qubits to be needed for the same error-correcting performance. The results were collected in the following order: First, different decoders (classical algorithms that determine the most likely error based on the results of the non-destructive measurements mentioned above) are compared to determine which performs best. That turned out to be relay Belief Propagation (BP-relay), which is a version of standard BP that uses information from failed decoding rounds to initialize new rounds. BP-relay is then used to compare BB codes with the surface code, another error-correcting code, with the result that the BB code outperforms the surface code. In addition, the feasibility of implementing BB codes on current hardware is explored, with the error rates of IBM's latest chip showing promising performance, even for much worse non-local connections. This implies that qLDPC codes could be used in the near term to increase the fault tolerance of current quantum computers.

•Jan 1, 2026•0 citations

Bias-tailored quantum LDPC codes

Joschka Roffe, Lawrence Z. Cohen, Armanda O. Quintavalle +2 more

Bias-tailoring allows quantum error correction codes to exploit qubit noise asymmetry. Recently, it was shown that a modified form of the surface code, the XZZX code, exhibits considerably improved performance under biased noise. In this work, we demonstrate that quantum low density parity check codes can be similarly bias-tailored. We introduce a bias-tailored lifted product code construction that provides the framework to expand bias-tailoring methods beyond the family of 2D topological codes. We present examples of bias-tailored lifted product codes based on classical quasi-cyclic codes and numerically assess their performance using a belief propagation plus ordered statistics decoder. Our Monte Carlo simulations, performed under asymmetric noise, show that bias-tailored codes achieve several orders of magnitude improvement in their error suppression relative to depolarising noise.

arXiv:2202.01702•Quantum•May 15, 2023•55 citations

Quantum low-density parity-check codes for erasure-biased atomic quantum processors

Laura Pecorari, Guido Pupillo

Identifying the best families of quantum error correction (QEC) codes for near-term experiments is key to enabling fault-tolerant quantum computing. Ideally, such codes should have low overhead in qubit number, high physical error thresholds, and moderate requirements on qubit connectivity to simplify experiments, while allowing for high logical error suppression. Quantum low-density parity-check (LDPC) codes have been recently shown to provide a path towards QEC with low qubit overhead and small logical error probabilities. Here, we demonstrate that when the dominant errors are erasures, as can be engineered in different quantum computing architectures, quantum LDPC codes additionally provide high thresholds and even stronger logical error suppression in parameter regimes that are accessible to current experiments. Using large-scale QEC numerical simulations, we benchmark the performance of two families of high-rate quantum LDPC codes, namely the so-called Clifford-deformed La-cross codes and the bivariate bicycle codes, under a noise model strongly biased towards erasure errors. Both codes outperform the surface code by offering up to orders of magnitude lower logical error probabilities. Interestingly, we find that this decrease in the logical error probability may not be accompanied by an increase in the code threshold, as different QEC codes benefit differently from large erasure fractions. While here we focus on neutral atom qubits, the results also hold for other quantum platforms, such as trapped ions and superconducting qubits, for which erasure conversion has been demonstrated.

arXiv:2502.20189•Physical Review A•Nov 10, 2025•12 citations

X-Z Round Scheduling for the Surface Code with Defects under Biased Noise

Lakshika Rathi, Pau Escofet, Joshua Viszlai +1 more

Fault-tolerant Quantum Computing (FTQC) relies on Quantum Error Correction (QEC) codes that encode logical qubits across many physical qubits to detect and correct errors. The surface code is among the most widely studied codes due to its high error threshold, the existence of efficient decoders, and hardware-friendly properties: a planar, two-dimensional layout with nearest-neighbor connectivity. In practice, however, the fabrication of solid-state quantum processors introduces hardware defects, resulting in defective qubits and couplers that must be discarded. Adapting the surface code to these defects often requires measuring the $X$- and $Z$-type checks in separate rounds rather than simultaneously. In this work, we investigate the optimal $X$-to-$Z$ checks round-scheduling ratio under biased noise systems. Our results characterize how key architectural parameters, such as noise bias, code distance, and defect rate, impact the logical error rate. We provide insights into how to determine the optimal scheduling ratio directly from device calibration data, enabling manufacturers to maximize performance without extensive simulations. Our approach reduces the logical error rate by up to $4.25\times$ at a $1\%$ defect rate and up to $8.46\times$ at a $2\%$ defect rate for a distance-$13$ surface code under moderately biased noise. Furthermore, we demonstrate that the benefits of round-scheduling extend beyond the defective-hardware setting. In biased-noise architectures subject to CNOT crosstalk, separating $X$ and $Z$ measurement rounds yields up to $4.5\times$ reduction in logical error rate.

quant-pharXiv:2608.05518•Aug 7, 2026•1 citation
Quantum computing is one of the most promising technological revolutions of the last few decades. Despite its potential, one problem it suffers from is that quantum bits (or qubits), its basic units of information, are intrinsically susceptible to noise. To counter the effects of such noise, we need fault-tolerant quantum computing, and for that, we need a systematic method to protect quantum information. This is the role of quantum error correction (QEC). However, most QEC codes are built on the assumption that X- and Z-type errors occur with equal frequency, which is not always the case for some realistic quantum hardware platforms. Among the several QEC protocols currently developed, surface codes are the leading implementation due to their high thresholds and local connectivity. Previous results have shown that modified variants of these codes, such as the XZZX surface code, can perform well under biased noise. Despite being realizable in two-dimensional real architectures, surface codes have poor encoding rates, leading to large overheads that prevent them from being scalable in fault-tolerant quantum architectures. Quantum low-density parity-check (qLDPC) codes provide a promising alternative, since they can achieve higher encoding rates. In this thesis, we study the code-capacity performance of bias-tailored qLDPC codes under both X- and Z-bias Pauli noise. We construct bias-tailored qLDPC codes, including bivariate bicycle codes, generalized toric codes, and clustered-cyclic codes, by applying Hadamard deformations that transform the Calderbank-Shor-Steane (CSS) codes into non-CSS codes. Using Monte Carlo simulations with minimum-weight perfect matching and belief propagation with localized-statistics decoding, we evaluate the word error rate of these bias-tailored qLDPC codes across different bias regimes. We show that Hadamard-deformed qLDPC codes can yield substantial performance improvements under biased noise and can match or even surpass those performances obtained from XZZX surface code implementations. In particular, we find that generalized toric codes perform consistently the best under bias noise in comparison to the bivariate and clustered-cyclic codes. These results indicate that bias tailoring can be extended to high-rate qLDPC constructions, leading to future work to study their performance in more realistic settings, such as circuit-level noise.
Quantum error correction (QEC) for generic errors is challenging due to the demanding threshold and resource requirements. Interestingly, when physical noise is biased, we can tailor our QEC schemes to the noise to improve performance. Here we study a family of codes having XZZX-type stabilizer generators, including a set of cyclic codes generalized from the five-qubit code and a set of topological codes that we call generalized toric codes (GTCs). We show that these XZZX codes are highly qubit efficient if tailored to biased noise. To characterize the code performance, we use the notion of effective distance, which generalizes code distance to the case of biased noise and constitutes a proxy for the logical failure rate. We find that the XZZX codes can achieve a favorable resource scaling by this metric under biased noise. We also show that the XZZX codes have remarkably high thresholds that reach what is achievable by random codes, and furthermore they can be efficiently decoded using matching decoders. Finally, by adding only one flag qubit, the XZZX codes can realize fault-tolerant QEC while preserving their large effective distance. In combination, our results show that tailored XZZX codes give a resource-efficient scheme for fault-tolerant QEC against biased noise.
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 computers are predicted to be able to solve problems impossible for a classical supercomputer. The quantum computers that we have now are however very sensitive to noise from their environment, which makes their results unreliable. This necessitates quantum error correction, the main topic of this thesis. Specifically, this thesis concerns quantum Low Density Parity Check (qLDPC) codes for superconducting qubits. Superconducting qubits are one of the ways to implement a quantum computer, used for example by Google and IBM. qLDPC codes are error-correcting codes whose classical counterpart is used in 5G and Wi-Fi, among other applications. They are a type of stabilizer code, meaning that the quantum state we wish to store is subjected to a sequence of non-destructive measurements, whose results can tell if an error has occurred or not. Explaining this more in-depth is the bulk of this thesis. The qLDPC code chosen as most fitting for superconducting qubits is the bivariate bicycle (BB) code. In it, each qubit interacts with its four nearest neighbours as well as with two qubits further away, which allows for fewer qubits to be needed for the same error-correcting performance. The results were collected in the following order: First, different decoders (classical algorithms that determine the most likely error based on the results of the non-destructive measurements mentioned above) are compared to determine which performs best. That turned out to be relay Belief Propagation (BP-relay), which is a version of standard BP that uses information from failed decoding rounds to initialize new rounds. BP-relay is then used to compare BB codes with the surface code, another error-correcting code, with the result that the BB code outperforms the surface code. In addition, the feasibility of implementing BB codes on current hardware is explored, with the error rates of IBM's latest chip showing promising performance, even for much worse non-local connections. This implies that qLDPC codes could be used in the near term to increase the fault tolerance of current quantum computers.
Bias-tailoring allows quantum error correction codes to exploit qubit noise asymmetry. Recently, it was shown that a modified form of the surface code, the XZZX code, exhibits considerably improved performance under biased noise. In this work, we demonstrate that quantum low density parity check codes can be similarly bias-tailored. We introduce a bias-tailored lifted product code construction that provides the framework to expand bias-tailoring methods beyond the family of 2D topological codes. We present examples of bias-tailored lifted product codes based on classical quasi-cyclic codes and numerically assess their performance using a belief propagation plus ordered statistics decoder. Our Monte Carlo simulations, performed under asymmetric noise, show that bias-tailored codes achieve several orders of magnitude improvement in their error suppression relative to depolarising noise.
Identifying the best families of quantum error correction (QEC) codes for near-term experiments is key to enabling fault-tolerant quantum computing. Ideally, such codes should have low overhead in qubit number, high physical error thresholds, and moderate requirements on qubit connectivity to simplify experiments, while allowing for high logical error suppression. Quantum low-density parity-check (LDPC) codes have been recently shown to provide a path towards QEC with low qubit overhead and small logical error probabilities. Here, we demonstrate that when the dominant errors are erasures, as can be engineered in different quantum computing architectures, quantum LDPC codes additionally provide high thresholds and even stronger logical error suppression in parameter regimes that are accessible to current experiments. Using large-scale QEC numerical simulations, we benchmark the performance of two families of high-rate quantum LDPC codes, namely the so-called Clifford-deformed La-cross codes and the bivariate bicycle codes, under a noise model strongly biased towards erasure errors. Both codes outperform the surface code by offering up to orders of magnitude lower logical error probabilities. Interestingly, we find that this decrease in the logical error probability may not be accompanied by an increase in the code threshold, as different QEC codes benefit differently from large erasure fractions. While here we focus on neutral atom qubits, the results also hold for other quantum platforms, such as trapped ions and superconducting qubits, for which erasure conversion has been demonstrated.
Fault-tolerant Quantum Computing (FTQC) relies on Quantum Error Correction (QEC) codes that encode logical qubits across many physical qubits to detect and correct errors. The surface code is among the most widely studied codes due to its high error threshold, the existence of efficient decoders, and hardware-friendly properties: a planar, two-dimensional layout with nearest-neighbor connectivity. In practice, however, the fabrication of solid-state quantum processors introduces hardware defects, resulting in defective qubits and couplers that must be discarded. Adapting the surface code to these defects often requires measuring the XXX- and ZZZ-type checks in separate rounds rather than simultaneously. In this work, we investigate the optimal XXX-to-ZZZ checks round-scheduling ratio under biased noise systems. Our results characterize how key architectural parameters, such as noise bias, code distance, and defect rate, impact the logical error rate. We provide insights into how to determine the optimal scheduling ratio directly from device calibration data, enabling manufacturers to maximize performance without extensive simulations. Our approach reduces the logical error rate by up to 4.25×4.25\times4.25× at a 1%1\%1% defect rate and up to 8.46×8.46\times8.46× at a 2%2\%2% defect rate for a distance-131313 surface code under moderately biased noise. Furthermore, we demonstrate that the benefits of round-scheduling extend beyond the defective-hardware setting. In biased-noise architectures subject to CNOT crosstalk, separating XXX and ZZZ measurement rounds yields up to 4.5×4.5\times4.5× reduction in logical error rate.