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:2507.07121 · Annals of Physics

Introduction to quantum error correction with stabilizer codes

Zachary P. Bradshaw, Jeffrey J. Dale, Ethan N. Evans

Published Jan 27, 2026• 5 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2026.170353

Related papers

An Introduction to Quantum Error Correction

Daniel Gottesman

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.

arXiv:quant-ph/0004072•Apr 18, 2000•103 citations

Introduction to quantum error correction

Victor V. Albert

Quantum Computing, Communication, and Simulation•Mar 13, 2024•8 citations

Optimal Quaternary Hermitian Linear Complementary Dual Codes for Entanglement-Assisted Quantum Error Correction

Maysara Al Jumaily

The objective of this thesis is to find suboptimal and optimal parameters from classical codes and import them into entanglement-assisted quantum codes. The thesis begins by introducing classical error correction, followed by a detailed introduction to quantum computing. Topics that are discussed in the introduction include qubits, quantum phenomena, such as superposition and entanglement, and quantum gates/circuits. The thesis then reviews the basics of quantum error correction and provides Shor's code to reinforce the reader's understanding. Subsequently, the formalism of stabilizer codes is thoroughly examined. We then explain the generalized concept of stabilizer codes which is entanglement-assisted quantum codes. They do not require generators to satisfy the commutativity property. Rather, they utilize the usage of ebits to resolve the anti-commutativity constraint. Next, the thesis explains quaternary field and then the Java program implemented to find the optimal parameters. Lastly, the thesis concludes with presenting the parameters of the new codes that were obtained throughout the research. We have found the suboptimal largest distance for quaternary hermitian linear complementary dual codes that can be imported as entanglement-assisted quantum error correction for parameters [22, 9, 9 or 10]₄, [22, 12, 7 or 8]₄, [23, 8, 11 or 12]₄, [23, 10, 9 or 10]₄, [23, 13, 7 or 8]₄, [24, 10, 10 or 11]₄, [24, 11, 9 or 10]₄, [24, 14, 7 or 8]₄, [25, 12, 9 or 10]₄, [25, 13, 8 or 9]₄, as well as the optimal largest distance for [17, 11, 5]₄ and [17, 13, 3]₄.

•Nov 16, 2021•0 citations

An introduction to quantum error correction

Daniel Gottesman

Proceedings of symposia in applied mathematics•Jan 1, 2002•90 citations

Quantum error correction fundamentals

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2022•3 citations

Quantum Error Correction

Markus Grassl

This chapter gives an introduction to the basic concepts of quantum error correction, illustrated by some simple quantum error-correcting codes (QECCs). It shows that it is sufficient to be able to correct a finite number of different errors. Additionally, using error bases whose elements are tensor products, one has the notion of the weight of an error. This is very similar to the situation for classical error correction. The direct application of a fundamental principle of classical error-correcting codes, namely, the replication of information, essentially fails because quantum mechanics allows the coherent superposition of basis states. When restricted to basis states, the theory becomes completely classical, and error correction is possible. The chapter further discusses the CSS construction and stabilizer codes. Both of these are reduce the problem of quantum error correction to the problem of the correction of errors for a classical code.

Wiley eBooks•Apr 18, 2016•3 citations
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.
The objective of this thesis is to find suboptimal and optimal parameters from classical codes and import them into entanglement-assisted quantum codes. The thesis begins by introducing classical error correction, followed by a detailed introduction to quantum computing. Topics that are discussed in the introduction include qubits, quantum phenomena, such as superposition and entanglement, and quantum gates/circuits. The thesis then reviews the basics of quantum error correction and provides Shor's code to reinforce the reader's understanding. Subsequently, the formalism of stabilizer codes is thoroughly examined. We then explain the generalized concept of stabilizer codes which is entanglement-assisted quantum codes. They do not require generators to satisfy the commutativity property. Rather, they utilize the usage of ebits to resolve the anti-commutativity constraint. Next, the thesis explains quaternary field and then the Java program implemented to find the optimal parameters. Lastly, the thesis concludes with presenting the parameters of the new codes that were obtained throughout the research. We have found the suboptimal largest distance for quaternary hermitian linear complementary dual codes that can be imported as entanglement-assisted quantum error correction for parameters [22, 9, 9 or 10]₄, [22, 12, 7 or 8]₄, [23, 8, 11 or 12]₄, [23, 10, 9 or 10]₄, [23, 13, 7 or 8]₄, [24, 10, 10 or 11]₄, [24, 11, 9 or 10]₄, [24, 14, 7 or 8]₄, [25, 12, 9 or 10]₄, [25, 13, 8 or 9]₄, as well as the optimal largest distance for [17, 11, 5]₄ and [17, 13, 3]₄.
This chapter gives an introduction to the basic concepts of quantum error correction, illustrated by some simple quantum error-correcting codes (QECCs). It shows that it is sufficient to be able to correct a finite number of different errors. Additionally, using error bases whose elements are tensor products, one has the notion of the weight of an error. This is very similar to the situation for classical error correction. The direct application of a fundamental principle of classical error-correcting codes, namely, the replication of information, essentially fails because quantum mechanics allows the coherent superposition of basis states. When restricted to basis states, the theory becomes completely classical, and error correction is possible. The chapter further discusses the CSS construction and stabilizer codes. Both of these are reduce the problem of quantum error correction to the problem of the correction of errors for a classical code.