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

Proceedings of symposia in applied mathematics

An introduction to quantum error correction

Daniel Gottesman

Published Jan 1, 2002• 90 citations
Publisher
DOI
10.1090/psapm/058/1922900

Related papers

Introduction to quantum error correction

Victor V. Albert

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

Introduction to quantum error correction with stabilizer codes

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

arXiv:2507.07121•Annals of Physics•Jan 27, 2026•5 citations

Introduction to quantum error correction

Andrew M. Steane

An introduction to quantum error correction (QEC) is given, and some recent developments are described. QEC consists of two parts: the physics of error processes and their reversal, and the construction of quantum error–correcting codes. Errors are caused both by imperfect quantum operations, and by coupling between the quantum system and its environment. Any such process can be analysed into a sum of ‘error operators’, which are tensor products of Pauli spin operators. These are the analogues of classical error vectors. A quantum error correcting code is a set of orthogonal states, ‘quantum codewords’, which behave in a certain useful way under the action of the most likely error operators. A computer or channel which only uses such states can be corrected by measurements which determine the error while yielding no information about which codeword or superposition of codewords is involved. Powerful codes can be found using a construction based on classical error–correcting codes. An analysis which allows even the corrective operations themselves to be imperfect leads to powerful and counter–intuitive results: the quantum coherence of a long quantum computation can be preserved even though every qubit in the computer relaxes spontaneously many times before the computation is complete.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Aug 15, 1998•39 citations

Quantum Error Correction‐Based Repeaters

Rodney Van Meter

An important advance in repeater design has been the introduction of error correction-based connection architectures. The two principal ideas are the Calderbank-Shor-Steane (CSS) code-based approach [JIA 09] and the surface code-based approach [FOW 10]. This chapter gives a very brief introduction to quantum error correction (QEC) and then look at these two connection architectures. The two quantum error correction-based schemes presented here represents a significant advance in our capabilities, potentially altering the demands made of the underlying physical layer, especially memory time, and may simplify the network architecture by reducing the number of nodes that each repeater must communicate with. The chapter concludes that these approaches present different challenges in resource management than purify-and-swap repeaters.

Wiley eBooks•Apr 14, 2014•6 citations

Basic concepts in quantum error correction

Chiara Macchiavello

•Jan 1, 2002•0 citations

Quantum error correction fundamentals

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2022•3 citations
An introduction to quantum error correction (QEC) is given, and some recent developments are described. QEC consists of two parts: the physics of error processes and their reversal, and the construction of quantum error–correcting codes. Errors are caused both by imperfect quantum operations, and by coupling between the quantum system and its environment. Any such process can be analysed into a sum of ‘error operators’, which are tensor products of Pauli spin operators. These are the analogues of classical error vectors. A quantum error correcting code is a set of orthogonal states, ‘quantum codewords’, which behave in a certain useful way under the action of the most likely error operators. A computer or channel which only uses such states can be corrected by measurements which determine the error while yielding no information about which codeword or superposition of codewords is involved. Powerful codes can be found using a construction based on classical error–correcting codes. An analysis which allows even the corrective operations themselves to be imperfect leads to powerful and counter–intuitive results: the quantum coherence of a long quantum computation can be preserved even though every qubit in the computer relaxes spontaneously many times before the computation is complete.
An important advance in repeater design has been the introduction of error correction-based connection architectures. The two principal ideas are the Calderbank-Shor-Steane (CSS) code-based approach [JIA 09] and the surface code-based approach [FOW 10]. This chapter gives a very brief introduction to quantum error correction (QEC) and then look at these two connection architectures. The two quantum error correction-based schemes presented here represents a significant advance in our capabilities, potentially altering the demands made of the underlying physical layer, especially memory time, and may simplify the network architecture by reducing the number of nodes that each repeater must communicate with. The chapter concludes that these approaches present different challenges in resource management than purify-and-swap repeaters.