Affiliate disclosure

Book titles on this page link to Amazon. As an Amazon Associate, DataField.Dev earns from qualifying purchases — at no additional cost to you.

Further Reading: Chapter 25 — Surface Codes and Fault-Tolerant Computation: The Path from Noisy Qubits to Reliable Quantum Computers

  1. Kitaev, A. Y. (2003). "Fault-tolerant quantum computation by anyons." Annals of Physics, 303(1), 2–30.
  2. Bravyi, S. B., & Kitaev, A. Y. (1998). "Quantum codes on a lattice with boundary." arXiv:quant-ph/9811052.
  3. Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012). "Surface codes: Towards practical large-scale quantum computation." Physical Review A, 86(3), 032324.
  4. Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002). "Topological quantum memory." Journal of Mathematical Physics, 43(9), 4452–4505.
  5. Eastin, B., & Knill, E. (2009). "Restrictions on transversal encoded quantum gate sets." Physical Review Letters, 102(11), 110502.
  6. Bravyi, S., & Kitaev, A. (2005). "Universal quantum computation with ideal Clifford gates and noisy ancillas." Physical Review A, 71(2), 022316.
  7. Google Quantum AI. (2025). "Quantum error correction below the surface code threshold." Nature, 638, 920–926.
  8. IBM Quantum. (2023). "IBM Quantum Development Roadmap." https://www.ibm.com/quantum/roadmap
  9. Delfosse, N., & Nickerson, N. H. (2017). "Almost-linear time decoding algorithm for topological codes." arXiv:1709.06289.
  10. Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L. (2011). "Surface code quantum computing with error rates over Gaussian noise." Physical Review A, 83(2), 020302.