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:2210.06661 · npj Quantum Information

Decoding general error correcting codes and the role of complementarity

Yoshifumi Nakata, Takaya Matsuura, Masato Koashi

Published Jan 10, 2025• 8 citations
arXivHTMLPDF

Abstract

Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Steane (CSS) codes can be straightforwardly extended to handle general QECCs. The key to the extension lies in the use of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded. The decoding error of the proposed decoding circuit depends on the classical decoding errors of the CQ codes and their degree of complementarity. We demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, improving decoding errors compared to previous results. In addition, we reveal that black hole dynamics may optimally encode quantum information but poorly encode classical information.

DOI
10.1038/s41534-024-00951-5

Related papers

Coherent information for Calderbank-Shor-Steane codes under decoherence

Ryotaro Niwa, Jong Yeon Lee

Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.

arXiv:2407.02564•Physical Review A•Mar 3, 2025•22 citations

Duality of Quantum and Classical Error Correction Codes: Design Principles and Examples

Zunaira Babar, Daryus Chandra, Hung Viet Nguyen +4 more

Quantum error correction codes (QECCs) can be constructed from the known classical coding paradigm by exploiting the inherent isomorphism between the classical and quantum regimes, while also addressing the challenges imposed by the strange laws of quantum physics. In this spirit, this paper provides deep insights into the duality of quantum and classical coding theory, hence aiming for bridging the gap between them. Explicitly, we survey the rich history of both classical as well as quantum codes. We then provide a comprehensive slow-paced tutorial for constructing stabilizer-based QECCs from arbitrary binary as well as quaternary codes, as exemplified by the dual-containing and non-dual-containing Calderbank-Shor-Steane (CSS) codes, non-CSS codes and entanglement-assisted codes. Finally, we apply our discussions to two popular code families, namely to the family of Bose-Chaudhuri-Hocquenghem as well as of convolutional codes and provide detailed design examples for both their classical as well as their quantum versions.

IEEE Communications Surveys & Tutorials•Jan 1, 2019•69 citations

Fault-tolerant preparation of stabilizer states for quantum Calderbank-Shor-Steane codes by classical error-correcting codes

Ching–Yi Lai, Yi-Cong Zheng, Todd A. Brun

Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome encoding by classical codes or quantum CSS codes. Along the same lines, we show that classical coding techniques can reduce the ancilla consumption in Steane syndrome extraction by using additional transversal controlled-not gates and classical computing power. In the scenario of a fixed ancilla consumption rate, we can increase the frequency of quantum error correction and effectively lower the error rate.

arXiv:1605.05647•Physical Review A•Mar 31, 2017•17 citations

Quantum error correcting codes based on privacy amplification

Zhicheng Luo

Calderbank-Shor-Steane (CSS) quantum error-correcting codes are based on pairs of classical codes which are mutually dual containing. Explicit constructions of such codes for large blocklengths and with good error correcting properties are not easy to find. In this paper we propose a construction of CSS codes which combines a classical code with a two-universal hash function. We show, using the results of Renner and Koenig, that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. While the bit-flip errors can be decoded as efficiently as the classical code used, the problem of efficiently decoding the phase-flip errors remains open.

arXiv:0808.1392•Aug 10, 2008•2 citations

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Dongxiao Quan, Chensong Liu, Xiaojie Lv +1 more

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.

Entropy•Aug 11, 2022•8 citations

Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial

Arijit Mondal, Keshab K. Parhi

Quantum computers have the potential to provide exponential speedups over their classical counterparts. Quantum principles are being applied to fields such as communications, information processing, and artificial intelligence to achieve quantum advantage. However, quantum bits are extremely noisy and prone to decoherence. Thus, keeping the qubits error free is extremely important toward reliable quantum computing. Quantum error correcting codes have been studied for several decades and methods have been proposed to import classical error correcting codes to the quantum domain. Along with the exploration into novel and more efficient quantum error correction codes, it is also essential to design circuits for practical realization of these codes. This article serves as a tutorial on designing and simulating quantum encoder and decoder circuits for stabilizer codes. We first describe Shor’s 9-qubit code which was the first quantum error correcting code. We discuss the stabilizer formalism along with the design of encoding and decoding circuits for stabilizer codes such as the five-qubit code and Steane code. We also design nearest neighbor compliant circuits for the above codes. The circuits were simulated and verified using IBM Qiskit.

arXiv:2309.11793•IEEE Circuits and Systems Magazine•Jan 1, 2024•19 citations
Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Steane (CSS) codes can be straightforwardly extended to handle general QECCs. The key to the extension lies in the use of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded. The decoding error of the proposed decoding circuit depends on the classical decoding errors of the CQ codes and their degree of complementarity. We demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, improving decoding errors compared to previous results. In addition, we reveal that black hole dynamics may optimally encode quantum information but poorly encode classical information.
Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.
Quantum error correction codes (QECCs) can be constructed from the known classical coding paradigm by exploiting the inherent isomorphism between the classical and quantum regimes, while also addressing the challenges imposed by the strange laws of quantum physics. In this spirit, this paper provides deep insights into the duality of quantum and classical coding theory, hence aiming for bridging the gap between them. Explicitly, we survey the rich history of both classical as well as quantum codes. We then provide a comprehensive slow-paced tutorial for constructing stabilizer-based QECCs from arbitrary binary as well as quaternary codes, as exemplified by the dual-containing and non-dual-containing Calderbank-Shor-Steane (CSS) codes, non-CSS codes and entanglement-assisted codes. Finally, we apply our discussions to two popular code families, namely to the family of Bose-Chaudhuri-Hocquenghem as well as of convolutional codes and provide detailed design examples for both their classical as well as their quantum versions.
Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome encoding by classical codes or quantum CSS codes. Along the same lines, we show that classical coding techniques can reduce the ancilla consumption in Steane syndrome extraction by using additional transversal controlled-not gates and classical computing power. In the scenario of a fixed ancilla consumption rate, we can increase the frequency of quantum error correction and effectively lower the error rate.
Calderbank-Shor-Steane (CSS) quantum error-correcting codes are based on pairs of classical codes which are mutually dual containing. Explicit constructions of such codes for large blocklengths and with good error correcting properties are not easy to find. In this paper we propose a construction of CSS codes which combines a classical code with a two-universal hash function. We show, using the results of Renner and Koenig, that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. While the bit-flip errors can be decoded as efficiently as the classical code used, the problem of efficiently decoding the phase-flip errors remains open.
Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.
Quantum computers have the potential to provide exponential speedups over their classical counterparts. Quantum principles are being applied to fields such as communications, information processing, and artificial intelligence to achieve quantum advantage. However, quantum bits are extremely noisy and prone to decoherence. Thus, keeping the qubits error free is extremely important toward reliable quantum computing. Quantum error correcting codes have been studied for several decades and methods have been proposed to import classical error correcting codes to the quantum domain. Along with the exploration into novel and more efficient quantum error correction codes, it is also essential to design circuits for practical realization of these codes. This article serves as a tutorial on designing and simulating quantum encoder and decoder circuits for stabilizer codes. We first describe Shor’s 9-qubit code which was the first quantum error correcting code. We discuss the stabilizer formalism along with the design of encoding and decoding circuits for stabilizer codes such as the five-qubit code and Steane code. We also design nearest neighbor compliant circuits for the above codes. The circuits were simulated and verified using IBM Qiskit.