The classical-to-quantum coding evolution is characterized by formalizing the isomorphism between classical linear block codes and quantum stabilizer codes. We commence with a review of classical block code constructions and decoding principles, including repetition codes and parity-check matrices. The chapter introduces the stabilizer formalism and demonstrates how classical codes can be transformed into quantum codes using Pauli-to-binary and Pauli-to-quaternary isomorphisms. We discuss the classification of quantum errors and the specific conditions under which classical codes lend themselves to quantum code construction. The chapter also details the design of quantum convolutional codes and entanglement-assisted quantum stabilizer codes, which facilitate the use of arbitrary classical codes in quantum settings. These concepts collectively establish a generalized framework for designing quantum codes from classical codes.
The classical-to-quantum coding evolution is characterized by formalizing the isomorphism between classical linear block codes and quantum stabilizer codes. We commence with a review of classical block code constructions and decoding principles, including repetition codes and parity-check matrices. The chapter introduces the stabilizer formalism and demonstrates how classical codes can be transformed into quantum codes using Pauli-to-binary and Pauli-to-quaternary isomorphisms. We discuss the classification of quantum errors and the specific conditions under which classical codes lend themselves to quantum code construction. The chapter also details the design of quantum convolutional codes and entanglement-assisted quantum stabilizer codes, which facilitate the use of arbitrary classical codes in quantum settings. These concepts collectively establish a generalized framework for designing quantum codes from classical codes.
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.
The motivation of quantum error correction codes (QECCs) is that of mitigating quantum decoherence. The chapter outlines the historical evolution of QECCs, beginning with Shor's 9-qubit code and progressing through Steane's and Laflamme's constructions. It introduces key families of quantum codes, including quantum stabilizer codes, quantum topological error correction codes, quantum convolutional codes, quantum low-density parity check codes, quantum turbo codes, and entanglement-assisted quantum error correction codes. The concept of protecting quantum gates is also touched upon, emphasizing the need for fault-tolerant architectures. The chapter concludes with an outline of the book's structure, which gradually evolves from classical coding foundations to advanced quantum code designs.
An expert discussion of the potential evolution of quantum codes In From Classical to Quantum Coding, a team of distinguished researchers deliver a seamless book on the subject of quantum error correction codes (QECC) designed for mitigating the environment-induced decoherence imposed on quantum computing and communications. Commencing from first principles, Part I is dedicated to readers familiar with classical coding and wishing to move into quantum coding. Part II focuses on near-term quantum codes requiring a modest to moderate number of qubits. Finally, Part III of the book offers an outlook on the classical to quantum evolution of QECCs, to advanced codes that rely on numerous qubits as quantum technology matures. The book incorporates several advanced topics, including the universal decoding of arbitrary linear codes, iterative short turbo block codes, turbo convolutional codes, and the family of low-density parity check codes. The powerful design tool of extrinsic information transfer charts plays a central role in the associated near-hashing-bound designs. Readers will also find: An easy-reading introduction to quantum information processing and quantum coding An evolutionary portrayal of the classical to quantum coding paradigm Practical discussions of near-term quantum topological error correction codes and how they protect quantum gates from decoherence Detailed treatments of syndrome-based decoding of diverse quantum turbo codes and quantum low-density parity check codes From Classical to Quantum Coding will benefit doctoral students, and industrial and academic researchers wishing to expand their expertise from the classical to the quantum field of signal processing, computing and communications.
In this paper, a new but simple construction of stabilizer codes and related entanglement-assisted quantum error-correcting codes is proposed based on syndrome assignment by classical parity-check matrices. This method turns the construction of quantum stabilizer codes to the construction of classical parity-check matrices satisfying a specific commutative condition. The designed minimum distance 2t*+1 of the constructed quantum stabilizer codes can be achieved by a commutative classical parity-check matrix with classical minimum distance 4t*-m, where the parameterm, 0 ≤m≤ 2t*, depends on a property of the parity-check matrix. Asmdecreases, there is an increasing set of additional correctable error operators beyond the designed error correcting capability t*. The (asymptotic) coding efficiency is at least comparable to that of CSS codes. A class of quantum Reed-Muller codes is constructed and codes in this class have a larger set of correctable error operators than that of the quantum Reed-Muller codes previously developed in the literature. Quantum circulant codes are also constructed and many of them are optimal in terms of their coding parameters.
We develop the theory of entanglement-assisted quantum error-correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to preshared entanglement. Conventional stabilizer codes are equivalent to self-orthogonal symplectic codes. In contrast, EAQEC codes do not require self-orthogonality, which greatly simplifies their construction. We show how any classical binary or quaternary block code can be made into an EAQEC code. We provide a table of best known EAQEC codes with code length up to 10. With the self-orthogonality constraint removed, we see that the distance of an EAQEC code can be better than any standard quantum error-correcting code with the same fixed net yield. In a quantum computation setting, EAQEC codes give rise to catalytic quantum codes, which assume a subset of the qubits are noiseless. We also give an alternative construction of EAQEC codes by making classical entanglement-assisted codes coherent.
We present a general formalism for quantum-error-correcting codes that encode both classical and quantum information (the EACQ formalism). This formalism unifies the entanglement-assisted coding theory and the classical coding theory in the sense that, after the encoding, error-correcting, and decoding steps, the encoded quantum and classical information can be correctly recovered by the receiver. We formally define this kind of quantum codes using stabilizer language, and derive the appropriate error-correcting conditions. We give several examples to demonstrate the construction of such codes.