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

Wiley eBooks

Error‐Correction Code in Quantum Noise

Kuldeep Singh Kaswan, Jagjit Singh Dhatterwal, Anupam Baliyan, Shalli Rani

Published Jul 14, 2023• 0 citations
Publisher

Abstract

Error-correcting codes are the primary method of transmitting data in the classical world. The effects of contact with the atmosphere are expected to be so widespread in any quantum system utilized to do quantum learning and memory that quantum error correction will always be needed. Group theory is used extensively in both conventional and quantum error correction. For linear quantum error-correcting codes, this chapter outlines a nonconstructive framework that specifies requirements for every code in the category. CSS codes (Calderbank-Shor-Steane), which belong to the larger category of stabilizer codes, have an advantage over other stabilizer codes since they may be built from pairs of classical codes that are coupled in a novel way. The chapter describes how to design a CSS code stabilizer. The stabilizer perspective is described as an alternative to the CSS code architecture described.

DOI
10.1002/9781394157846.ch7

Related papers

Quantum Error Correction with Reflexive Stabilizer Codes and Cayley Graphs.

Robert R. Vandermolen, Duncan Wright

Long distance communication of digital data, whether through a physical medium or a broadcast signal, is often subjected to noise. To deliver data reliably through noisy communication channels, one must use codes that can detect and correct the particular noise of the channel. For transmission of classical data, error correcting schemes can be as simple as the sending of replicates. For quantum data, and in tandem the development of machines that can process quantum data, quantum error correcting codes must be developed. In addition to a larger set of possible errors, quantum error correcting schemes must contend with other peculiarities of quantum mechanics, such as the no-cloning theorem which can prevent the sending of replicate messages. Stabilizer codes are one family of quantum error correcting codes which can protect and correct errors expressed in terms of the Pauli group, exploiting its group structure and utilizing classical codes and the corresponding duals. We develop and examine a family of quantum stabilizer codes which arise from reflexive stabilizers. Moreover, we provide a mapping from our reflexive stabilizer codes to the well-known CSS codes developed by Calderbank, Shor, and Steane. For the case of a 4-state system we show that these codes can obtain the minimal embedding for code which can correct any flip or phase error. We also provide heuristic algorithms for creating reflexive stabilizer codes starting from the noise of a quantum channel. Furthermore, we show that the problem can be posed in terms of finding maximal Cayley subgraphs with restrictions imposed by the set of potential errors.

•Oct 16, 2021•0 citations

Quantum error correction

E. Desurvire

This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.

Cambridge University Press eBooks•Feb 19, 2009•0 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

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

Quantum Error Correction

Ping Dong, Jinsoo Kim

We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.

•Jul 6, 2005•0 citations

Constructions and decoding procedures for quantum CSS codes

Yannick Saouter, Massinissa Zenia, Gilles Burel

This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes. A new algebraic decoding technique is also introduced. This technique is exemplified on CSS codes obtained from BCH, Reed-Muller and projective geometry codes.

arXiv:2502.03242•Feb 5, 2025•1 citation
Error-correcting codes are the primary method of transmitting data in the classical world. The effects of contact with the atmosphere are expected to be so widespread in any quantum system utilized to do quantum learning and memory that quantum error correction will always be needed. Group theory is used extensively in both conventional and quantum error correction. For linear quantum error-correcting codes, this chapter outlines a nonconstructive framework that specifies requirements for every code in the category. CSS codes (Calderbank-Shor-Steane), which belong to the larger category of stabilizer codes, have an advantage over other stabilizer codes since they may be built from pairs of classical codes that are coupled in a novel way. The chapter describes how to design a CSS code stabilizer. The stabilizer perspective is described as an alternative to the CSS code architecture described.
Long distance communication of digital data, whether through a physical medium or a broadcast signal, is often subjected to noise. To deliver data reliably through noisy communication channels, one must use codes that can detect and correct the particular noise of the channel. For transmission of classical data, error correcting schemes can be as simple as the sending of replicates. For quantum data, and in tandem the development of machines that can process quantum data, quantum error correcting codes must be developed. In addition to a larger set of possible errors, quantum error correcting schemes must contend with other peculiarities of quantum mechanics, such as the no-cloning theorem which can prevent the sending of replicate messages. Stabilizer codes are one family of quantum error correcting codes which can protect and correct errors expressed in terms of the Pauli group, exploiting its group structure and utilizing classical codes and the corresponding duals. We develop and examine a family of quantum stabilizer codes which arise from reflexive stabilizers. Moreover, we provide a mapping from our reflexive stabilizer codes to the well-known CSS codes developed by Calderbank, Shor, and Steane. For the case of a 4-state system we show that these codes can obtain the minimal embedding for code which can correct any flip or phase error. We also provide heuristic algorithms for creating reflexive stabilizer codes starting from the noise of a quantum channel. Furthermore, we show that the problem can be posed in terms of finding maximal Cayley subgraphs with restrictions imposed by the set of potential errors.
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
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.
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.
We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.