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:2506.15636 · IEEE Transactions on Information Theory

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound

Kenta Kasai

Published Jan 1, 2026• 5 citations
arXivHTMLPDF

Abstract

Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at a coding rate of 1/3, achieves a frame error rate as low as $10^{-4}$ at a physical error rate of 9.45% for a code with 104,000 logical qubits and 312,000 physical qubits, approaching the quantum hashing bound. These findings highlight the critical role of degeneracy in closing the gap to the fundamental limits of quantum error correction.

DOI
10.1109/tit.2026.3747884

Related papers

Quantum error correction near the coding theoretical bound

Daiki Komoto, Kenta Kasai

Abstract Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits1. However, many impactful applications demand quantum computations with millions of logical qubits2, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes3 can approach channel capacity efficiently4. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound—a fundamental limit on quantum capacity—despite decades of research5–7. Here, we present quantum LDPC codes that not only approach the hashing bound but also allow decoding with computational cost linear in the number of physical qubits. This breakthrough paves the way for large-scale, fault-tolerant quantum computation. Combined with emerging hardware that manages many qubits, our approach brings quantum solutions to important real-world problems significantly closer to reality.

arXiv:2412.21171•npj Quantum Information•Sep 30, 2025•15 citations

Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening

Shobhit Bhatnagar, Michele Pacenti, Nithin Raveendran +2 more

Quantum error correction is essential for building scalable quantum computers. Within the stabilizer formalism, the Calderbank-Shor-Steane framework constructs quantum codes from pairs of classical linear codes. A distinctive feature in this setting is degeneracy, where multiple equivalent error estimates exist-a phenomenon that has no classical counterpart, and the lack of a meaningful classical coding-theoretic interpretation of which has remained a gap in the literature. In this paper, we demonstrate that degeneracy is closely related to the classical operation of shortening of a linear block code. Interestingly, the shortening here takes place at the decoder rather than at the encoder. Leveraging this insight, we present a parallel decoding scheme for quantum low-density parity-check codes, which we term impulse decoding, that significantly outperforms belief propagation with ordered statistics decoding, as well as several other existing techniques, under both code-capacity and circuit-level noise, with significantly lesser complexity. We then present another algorithm based on decoding of residual errors, which when combined with impulse decoding achieves further performance improvement under circuit-level noise.

quant-pharXiv:2606.18240•Jun 17, 2026•4 citations

Quantum Error Correction Beyond the Bounded Distance Decoding Limit

Kenta Kasai, Manabu Hagiwara, Hideki Imai +1 more

In this paper, we consider quantum error correction over depolarizing channels with nonbinary low-density parity-check codes defined over Galois field of size 2p. The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., 2p, the error floors are considerably improved.

arXiv:1007.1778•IEEE Transactions on Information Theory•Sep 21, 2011•50 citations

High-Rate Quantum Low-Density Parity-Check Codes Assisted by Reliable Qubits

Yuichiro Fujiwara, Alexander Gruner, Peter Vandendriessche

Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes with desirable properties for quantum information processing than for traditional digital communications and computation. A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. Recently, promising solutions to this problem have been proposed in quantum information science, where in principle any binary linear code can be turned into a quantum error-correcting code by assuming a small number of reliable quantum bits. This paper studies how best to take advantage of these latest ideas to construct desirable quantum error-correcting codes of very high information rate. Our methods exploit structured high-rate low-density parity-check codes available in the classical domain and provide quantum analogues that inherit their characteristic low decoding complexity and high error correction performance even at moderate code lengths. Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation where promising quantum analogues of low-density parity-check codes are difficult to find.

arXiv:1309.5587•IEEE Transactions on Information Theory•Jan 30, 2015•17 citations

Quantum Error Correction: Overcoming the Fragility of Qubits for Reliable Quantum Computing

Swathi Mummadi, Gnaneshwara Chary Udari

Quantum Error Correction (QEC) is essential for overcoming the fragility of qubits, enabling reliable and scalable quantum computing by mitigating the effects of noise, decoherence, and operational errors. This chapter explores QEC's foundational principles, including error types, noise impact, and syndrome measurement techniques for identifying and correcting errors. It covers key codes such as Shor and Steane, which provide basic error protection, and advanced codes like concatenated codes, surface codes, and quantum Low-Density Parity-Check (LDPC) codes. Concatenated codes employ hierarchical encoding to exponentially reduce logical error rates, while surface codes, including Toric codes, utilize topological properties of qubits arranged on a 2D lattice to detect and correct errors with high fault tolerance and scalability. Quantum LDPC codes leverage sparse parity-check matrices to offer efficient and scalable error correction, closely approaching theoretical performance limits. The chapter concludes by exploring current research efforts to optimize QEC codes.

Advances in computational intelligence and robotics book series•Apr 17, 2025•1 citation

Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation

Andi Gu, J. Pablo Bonilla Ataides, Mikhail D. Lukin +1 more

Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have recently emerged as a promising route to efficient fault tolerance, current decoding algorithms do not allow one to realize the full potential of these codes in practical settings. Here, we introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes, and use it to probe a novel "waterfall" regime of error suppression, demonstrating that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes at current physical error rates, and with latencies within the real-time budgets of several leading hardware platforms. For example, for the $[144, 12, 12]$ Gross code, the decoder achieves logical error rates up to $\sim 17$x below existing decoders - reaching logical error rates $\sim 10^{-10}$ at physical error $p=0.1\%$ - with 3-5 orders of magnitude higher throughput. This decoder also produces well-calibrated confidence estimates that can significantly reduce the time overhead of repeat-until-success protocols. Taken together, these results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.

quant-pharXiv:2604.08358•Apr 10, 2026•52 citations
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at a coding rate of 1/3, achieves a frame error rate as low as 10−410^{-4}10−4 at a physical error rate of 9.45% for a code with 104,000 logical qubits and 312,000 physical qubits, approaching the quantum hashing bound. These findings highlight the critical role of degeneracy in closing the gap to the fundamental limits of quantum error correction.
Abstract Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits1. However, many impactful applications demand quantum computations with millions of logical qubits2, necessitating highly scalable quantum error correction. In classical information theory, low-density parity-check (LDPC) codes3 can approach channel capacity efficiently4. Yet, no quantum error-correcting codes with efficient decoding have been shown to approach the hashing bound—a fundamental limit on quantum capacity—despite decades of research5–7. Here, we present quantum LDPC codes that not only approach the hashing bound but also allow decoding with computational cost linear in the number of physical qubits. This breakthrough paves the way for large-scale, fault-tolerant quantum computation. Combined with emerging hardware that manages many qubits, our approach brings quantum solutions to important real-world problems significantly closer to reality.
Quantum error correction is essential for building scalable quantum computers. Within the stabilizer formalism, the Calderbank-Shor-Steane framework constructs quantum codes from pairs of classical linear codes. A distinctive feature in this setting is degeneracy, where multiple equivalent error estimates exist-a phenomenon that has no classical counterpart, and the lack of a meaningful classical coding-theoretic interpretation of which has remained a gap in the literature. In this paper, we demonstrate that degeneracy is closely related to the classical operation of shortening of a linear block code. Interestingly, the shortening here takes place at the decoder rather than at the encoder. Leveraging this insight, we present a parallel decoding scheme for quantum low-density parity-check codes, which we term impulse decoding, that significantly outperforms belief propagation with ordered statistics decoding, as well as several other existing techniques, under both code-capacity and circuit-level noise, with significantly lesser complexity. We then present another algorithm based on decoding of residual errors, which when combined with impulse decoding achieves further performance improvement under circuit-level noise.
In this paper, we consider quantum error correction over depolarizing channels with nonbinary low-density parity-check codes defined over Galois field of size 2p. The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., 2p, the error floors are considerably improved.
Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes with desirable properties for quantum information processing than for traditional digital communications and computation. A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. Recently, promising solutions to this problem have been proposed in quantum information science, where in principle any binary linear code can be turned into a quantum error-correcting code by assuming a small number of reliable quantum bits. This paper studies how best to take advantage of these latest ideas to construct desirable quantum error-correcting codes of very high information rate. Our methods exploit structured high-rate low-density parity-check codes available in the classical domain and provide quantum analogues that inherit their characteristic low decoding complexity and high error correction performance even at moderate code lengths. Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation where promising quantum analogues of low-density parity-check codes are difficult to find.
Quantum Error Correction (QEC) is essential for overcoming the fragility of qubits, enabling reliable and scalable quantum computing by mitigating the effects of noise, decoherence, and operational errors. This chapter explores QEC's foundational principles, including error types, noise impact, and syndrome measurement techniques for identifying and correcting errors. It covers key codes such as Shor and Steane, which provide basic error protection, and advanced codes like concatenated codes, surface codes, and quantum Low-Density Parity-Check (LDPC) codes. Concatenated codes employ hierarchical encoding to exponentially reduce logical error rates, while surface codes, including Toric codes, utilize topological properties of qubits arranged on a 2D lattice to detect and correct errors with high fault tolerance and scalability. Quantum LDPC codes leverage sparse parity-check matrices to offer efficient and scalable error correction, closely approaching theoretical performance limits. The chapter concludes by exploring current research efforts to optimize QEC codes.
Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have recently emerged as a promising route to efficient fault tolerance, current decoding algorithms do not allow one to realize the full potential of these codes in practical settings. Here, we introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes, and use it to probe a novel "waterfall" regime of error suppression, demonstrating that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes at current physical error rates, and with latencies within the real-time budgets of several leading hardware platforms. For example, for the [144,12,12][144, 12, 12][144,12,12] Gross code, the decoder achieves logical error rates up to ∼17\sim 17∼17x below existing decoders - reaching logical error rates ∼10−10\sim 10^{-10}∼10−10 at physical error p=0.1%p=0.1\%p=0.1% - with 3-5 orders of magnitude higher throughput. This decoder also produces well-calibrated confidence estimates that can significantly reduce the time overhead of repeat-until-success protocols. Taken together, these results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated.