Chapter 35 Further Reading

Primary Textbook References

Nielsen & Chuang, Quantum Computation and Quantum Information (10th Anniversary ed., Cambridge, 2010)

  • Chapter 10 — "Quantum Error Correction." The definitive textbook treatment, covering the 3-qubit codes, Shor code, CSS codes, stabilizer formalism, and the threshold theorem. Nielsen and Chuang's presentation is mathematically rigorous while remaining accessible to physics graduate students. This is the primary reference for the material in this chapter.
  • Chapter 10.1–10.3 — Three-qubit codes and the Shor code, with detailed circuit diagrams.
  • Chapter 10.4 — The theory of quantum error-correcting codes, including the quantum Hamming bound and quantum Singleton bound.
  • Chapter 10.5 — The stabilizer formalism, developed systematically.
  • Chapter 10.6 — Fault-tolerant quantum computation and the threshold theorem.

Preskill, J., Quantum Information Lecture Notes (Caltech, continuously updated)

  • Chapter 7 — "Quantum Error Correction." Freely available at theory.caltech.edu/~preskill/ph229/. Preskill's notes are legendary for their clarity, depth, and physical insight. His treatment of the stabilizer formalism is particularly elegant, and his discussion of the threshold theorem is more detailed and nuanced than most textbook treatments.
  • Chapter 9 — "Topological Quantum Computation." Covers the toric code and surface code as approaches to fault tolerance.

Lidar, D.A. & Brun, T.A. (eds.), Quantum Error Correction (Cambridge, 2013)

  • A comprehensive edited volume covering all aspects of quantum error correction, from the mathematical foundations to experimental implementations. Chapters are written by leading researchers in the field. Particularly useful as a reference for specific topics and as a bridge to the research literature.

The Foundational Papers

Shor, P.W., "Scheme for reducing decoherence in quantum computer memory," Phys. Rev. A 52, R2493 (1995)

  • The paper that started it all. Shor introduces the 9-qubit code and proves that quantum error correction is possible. Remarkably concise (4 pages) and readable. Essential reading for anyone interested in the history of quantum computing.

Steane, A.M., "Error correcting codes in quantum theory," Phys. Rev. Lett. 77, 793 (1996)

  • Introduces the 7-qubit code and the connection between quantum error correction and classical coding theory. Steane's insight that classical codes could be "lifted" to quantum codes via the CSS construction opened up an entire field.

Calderbank, A.R. & Shor, P.W., "Good quantum error-correcting codes exist," Phys. Rev. A 54, 1098 (1996)

  • Proves the existence of good quantum codes by constructing them from pairs of classical codes. This paper, together with Steane's, established the CSS (Calderbank-Shor-Steane) framework.

Gottesman, D., "Stabilizer codes and quantum error correction," Ph.D. thesis, Caltech (1997)

  • The foundational work on the stabilizer formalism, which provides a unified mathematical framework for analyzing quantum error-correcting codes. Gottesman showed that stabilizer codes can be described entirely in terms of commuting Pauli operators, reducing quantum coding theory to linear algebra over $\mathbb{F}_2$.

Knill, E., Laflamme, R., & Zurek, W.H., "Resilient quantum computation," Science 279, 342 (1998)

  • One of the first proofs of the threshold theorem. Knill, Laflamme, and Zurek showed that fault-tolerant quantum computation is possible with concatenated codes, provided the error rate per gate is below approximately $10^{-4}$.

Aharonov, D. & Ben-Or, M., "Fault-tolerant quantum computation with constant error," STOC 1997

  • An independent and more general proof of the threshold theorem, applicable to a broader class of noise models. Aharonov and Ben-Or showed that the threshold exists even for non-Markovian noise (where errors can be correlated in time).

Surface Codes and Topological Approaches

Kitaev, A.Yu., "Fault-tolerant quantum computation by anyons," Ann. Phys. 303, 2 (2003)

  • The foundational paper on topological quantum error correction. Kitaev introduced the toric code — a topological quantum code defined on a torus — and showed that it provides a natural framework for fault tolerance. The surface code (used on a planar geometry) is a close relative.

Dennis, E., Kitaev, A., Landahl, A., & Preskill, J., "Topological quantum memory," J. Math. Phys. 43, 4452 (2002)

  • Analyzes the surface code as a quantum memory and proves that its threshold is approximately 10.3% for independent depolarizing noise — the highest known threshold for any quantum code. This paper established the surface code as the leading candidate for practical fault tolerance.

Fowler, A.G., Mariantoni, M., Martinis, J.M., & Cleland, A.N., "Surface codes: Towards practical large-scale quantum computation," Phys. Rev. A 86, 032324 (2012)

  • A practical guide to implementing the surface code on superconducting qubit architectures. Covers resource estimates, decoder algorithms, and magic state distillation. This paper strongly influenced the research direction of Google, IBM, and other superconducting qubit groups.

Experimental Demonstrations

Chiaverini, J. et al., "Realization of quantum error correction," Nature 432, 602 (2004)

  • First demonstration of a complete quantum error correction cycle (encode, introduce error, measure syndrome, correct) using three trapped $^{9}$Be$^{+}$ ions.

Ofek, N. et al., "Extending the lifetime of a quantum bit with error correction in superconducting circuits," Nature 536, 441 (2016)

  • Demonstrated that encoding a qubit in a bosonic mode of a superconducting cavity (using the "cat code") extends the qubit lifetime beyond the break-even point — the first time error correction actually improved qubit performance.

Google Quantum AI, "Suppressing quantum errors by scaling a surface code logical qubit," Nature 614, 676 (2023)

  • The landmark "below threshold" demonstration: a distance-5 surface code logical qubit outperformed a distance-3 logical qubit under repeated error correction. This was widely seen as the first experimental evidence that quantum error correction can work at scale.

Bluvstein, D. et al., "Logical quantum processor based on reconfigurable atom arrays," Nature 626, 58 (2024)

  • Demonstrated fault-tolerant operations on error-corrected logical qubits using neutral atom arrays, including entangling operations between logical qubits.

Advanced Topics

Bravyi, S. & Kitaev, A., "Universal quantum computation with ideal Clifford gates and noisy ancillas," Phys. Rev. A 71, 022316 (2005)

  • Introduces magic state distillation — the technique for implementing non-Clifford gates ($T$ gates) fault-tolerantly. This paper is essential for understanding the resource overhead of fault-tolerant quantum computing.

Eastin, B. & Knill, E., "Restrictions on transversal encoded quantum gate sets," Phys. Rev. Lett. 102, 110502 (2009)

  • Proves the Eastin-Knill theorem: no quantum error-correcting code can implement a universal gate set using only transversal gates. This is why magic state distillation (or some equivalent technique) is necessary for fault-tolerant universality.

Terhal, B.M., "Quantum error correction for quantum memories," Rev. Mod. Phys. 87, 307 (2015)

  • An excellent review article covering the theory of quantum error correction from the stabilizer formalism through topological codes to practical implementations. Accessible to graduate students with a background in quantum information.

Campbell, E.T., Terhal, B.M., & Vuillot, C., "Roads towards fault-tolerant universal quantum computation," Nature 549, 172 (2017)

  • A review of different approaches to fault-tolerant quantum computing, comparing their resource requirements and tradeoffs. Useful for understanding the landscape of current approaches.

Accessible Introductions

Devitt, S.J., Munro, W.J., & Nemoto, K., "Quantum error correction for beginners," Rep. Prog. Phys. 76, 076001 (2013)

  • An unusually accessible review article that covers the basics of quantum error correction without requiring advanced mathematical background. Recommended for students who want an overview before diving into Nielsen & Chuang.

Aaronson, S., "Quantum Computing Since Democritus" (Cambridge, 2013)

  • Chapter 14 — An informal but insightful discussion of quantum error correction and the threshold theorem. Aaronson's characteristic style makes the conceptual points vivid and memorable.

Mermin, N.D., Quantum Computer Science (Cambridge, 2007)

  • Chapter 5 — A concise treatment of quantum error correction aimed at readers with a computer science background. Mermin's approach emphasizes the algebraic structure of stabilizer codes.

Online Resources

  • IBM Quantum Learning — Interactive tutorials on quantum error correction, including hands-on exercises using IBM's quantum hardware. Freely available at learning.quantum.ibm.com.
  • Qiskit Textbook — Open-source online textbook with chapters on quantum error correction, including executable Python code. Available at qiskit.org/textbook.
  • Preskill's Quantum Error Correction Zoo — errorcorrectionzoo.org — A comprehensive catalog of quantum error-correcting codes with descriptions, properties, and references.
  • arXiv quant-ph — The field moves quickly. For the latest results on quantum error correction, the arXiv preprint server is the primary source.