{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:02:13Z","timestamp":1772020933663,"version":"3.50.1"},"reference-count":36,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T00:00:00Z","timestamp":1771718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Error correction is an essential part of the theory of quantum computation. However, new quantum computation students may find the theories of error correction and fault tolerance daunting, or they may be stuck with theoretical\/outdated schemes (such as the one in the original proof of the threshold theorem by Aharonov and Ben-or) with unrealistically low thresholds and\/or high overhead. In this article, we describe an adequately modern approach to fault-tolerant quantum computation based on the surface code and lattice surgery. The reader is assumed to have a basic understanding of quantum computation (state vectors, unitary gates, and measurements, etc.), but no prior knowledge about quantum codes or quantum error correction is needed.<\/jats:p>","DOI":"10.3390\/e28020251","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T10:00:52Z","timestamp":1771840852000},"page":"251","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Hitchhiker\u2019s Guide to the Surface Code"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0000-7101","authenticated-orcid":false,"given":"Fang","family":"Zhang","sequence":"first","affiliation":[{"name":"Zhongguancun Laboratory, Beijing 100095, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9365-776X","authenticated-orcid":false,"given":"Jianxin","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., and Chuang, I.L. (2011). Quantum Computation and Quantum Information: 10th Anniversary Edition, Cambridge University Press. [10th ed.].","DOI":"10.1017\/CBO9780511976667"},{"key":"ref_2","unstructured":"Everett, H., Wheeler, J.A., Dewitt, B.S., Cooper, L.N., Van Vechten, D., and Graham, N. (1973). The theory of the universal wave function. The Many-Worlds Interpretation of Quantum Mechanics, Princeton University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","article-title":"Scheme for reducing decoherence in quantum computer memory","volume":"52","author":"Shor","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Aharonov, D., and Ben-Or, M. (1997, January 4\u20136). Fault-tolerant quantum computation with constant error. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, TX, USA.","DOI":"10.1145\/258533.258579"},{"key":"ref_5","first-page":"021004","article-title":"Strong Resilience of Topological Codes to Depolarization","volume":"2","author":"Bombin","year":"2012","journal-title":"Phys. Rev. X"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"052328","DOI":"10.1103\/PhysRevA.70.052328","article-title":"Improved simulation of stabilizer circuits","volume":"70","author":"Aaronson","year":"2004","journal-title":"Phys. Rev. A\u2014At. Mol. Opt. Phys."},{"key":"ref_7","unstructured":"Gottesman, D. (1998). The Heisenberg Representation of Quantum Computers. arXiv."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"012336","DOI":"10.1103\/PhysRevA.71.012336","article-title":"Fault-tolerant quantum computation for local non-Markovian noise","volume":"71","author":"Terhal","year":"2005","journal-title":"Phys. Rev. A"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.22331\/q-2025-01-20-1600","article-title":"Sparse Blossom: Correcting a million errors per core second with minimum-weight matching","volume":"9","author":"Higgott","year":"2025","journal-title":"Quantum"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"180502","DOI":"10.1103\/PhysRevLett.109.180502","article-title":"Proof of Finite Surface Code Threshold for Matching","volume":"109","author":"Fowler","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.22331\/q-2021-07-06-497","article-title":"Stim: A fast stabilizer circuit simulator","volume":"5","author":"Gidney","year":"2021","journal-title":"Quantum"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"128","DOI":"10.22331\/q-2019-03-05-128","article-title":"A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery","volume":"3","author":"Litinski","year":"2019","journal-title":"Quantum"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Google Quantum AI and Collaborators (2025). Quantum error correction below the surface code threshold. Nature, 638, 920\u2013926.","DOI":"10.1038\/s41586-024-08449-y"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.22331\/q-2018-05-04-62","article-title":"Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes","volume":"2","author":"Litinski","year":"2018","journal-title":"Quantum"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.22331\/q-2024-04-08-1310","article-title":"Inplace Access to the Surface Code Y Basis","volume":"8","author":"Gidney","year":"2024","journal-title":"Quantum"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","article-title":"Surface codes: Towards practical large-scale quantum computation","volume":"86","author":"Fowler","year":"2012","journal-title":"Phys. Rev. A"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"010331","DOI":"10.1103\/PRXQuantum.3.010331","article-title":"Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery","volume":"3","author":"Chamberland","year":"2022","journal-title":"PRX Quantum"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"010348","DOI":"10.1103\/PRXQuantum.5.010348","article-title":"Tangling Schedules Eases Hardware Connectivity Requirements for Quantum Error Correction","volume":"5","author":"Crawford","year":"2024","journal-title":"PRX Quantum"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"064081","DOI":"10.1103\/PhysRevApplied.19.064081","article-title":"Quantum Computing is Scalable on a Planar Array of Qubits with Fabrication Defects","volume":"19","author":"Strikis","year":"2023","journal-title":"Phys. Rev. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.22331\/q-2023-07-25-1065","article-title":"Adaptive surface code for quantum error correction in the presence of temporary or permanent defects","volume":"7","author":"Siegel","year":"2023","journal-title":"Quantum"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Wei, Z., He, T., Ye, Y., Wu, D., Zhang, Y., Zhao, Y., Lin, W., Huang, H.L., Zhu, X., and Pan, J.W. (2024). Low-Overhead Defect-Adaptive Surface Code with Bandage-Like Super-Stabilizers. arXiv.","DOI":"10.1038\/s41534-025-01023-y"},{"key":"ref_22","unstructured":"Zhou, R., Zhang, F., Kong, L., and Chen, J. (2024). Halma: A routing-based technique for defect mitigation in quantum error correction. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.22331\/q-2023-11-07-1172","article-title":"Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics","volume":"7","author":"McEwen","year":"2023","journal-title":"Quantum"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Debroy, D.M., McEwen, M., Gidney, C., Shutty, N., and Zalcman, A. (2024). LUCI in the surface code with dropouts. arXiv.","DOI":"10.22331\/q-2025-12-11-1936"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"040344","DOI":"10.1103\/PRXQuantum.4.040344","article-title":"Scalable Surface-Code Decoders with Parallelization in Time","volume":"4","author":"Tan","year":"2022","journal-title":"PRX Quantum"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"7040","DOI":"10.1038\/s41467-023-42482-1","article-title":"Parallel window decoding enables scalable fault tolerant quantum computation","volume":"14","author":"Skoric","year":"2022","journal-title":"Nat. Commun."},{"key":"ref_27","unstructured":"Bomb\u00edn, H., Dawson, C., Liu, Y.H., Nickerson, N., Pastawski, F., and Roberts, S. (2023). Modular decoding: Parallelizable real-time decoding for quantum computers. arXiv."},{"key":"ref_28","unstructured":"Fowler, A.G. (2013). Optimal complexity correction of correlated errors in the surface code. arXiv."},{"key":"ref_29","first-page":"031007","article-title":"Improved decoding of circuit noise and fragile boundaries of tailored surface codes","volume":"13","author":"Higgott","year":"2023","journal-title":"Phys. Rev. X"},{"key":"ref_30","unstructured":"Shutty, N., Newman, M., and Villalonga, B. (2024). Efficient near-optimal decoding of the surface code through ensembling. arXiv."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1038\/s41586-024-08148-8","article-title":"Learning high-accuracy error decoding for quantum processors","volume":"635","author":"Bausch","year":"2024","journal-title":"Nature"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"023037","DOI":"10.1088\/1367-2630\/17\/2\/023037","article-title":"A magic state\u2019s fidelity can be superior to the operations that created it","volume":"17","author":"Li","year":"2015","journal-title":"New J. Phys."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"135","DOI":"10.22331\/q-2019-04-30-135","article-title":"Efficient magic state factories with a catalyzed |CCZ\u232a to 2|T\u232a transformation","volume":"3","author":"Gidney","year":"2019","journal-title":"Quantum"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1038\/s41534-020-00319-5","article-title":"Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits","volume":"6","author":"Chamberland","year":"2020","journal-title":"Npj Quantum Inf."},{"key":"ref_35","unstructured":"Gidney, C., Shutty, N., and Jones, C. (2024). Magic state cultivation: Growing T states as cheap as CNOT gates. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Tan, D.B., Niu, M.Y., and Gidney, C. (2024). A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing. 2024 ACM\/IEEE 51st Annual International Symposium on Computer Architecture (ISCA), IEEE.","DOI":"10.1109\/ISCA59077.2024.00032"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/251\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T11:05:35Z","timestamp":1772017535000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,22]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["e28020251"],"URL":"https:\/\/doi.org\/10.3390\/e28020251","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,22]]}}}