{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/threshold-error-rates-for-the-toric-and","title":"Threshold error rates for the toric and surface codes","arxiv_id":"0905.0531","date":"2009-05-05","proceeding":null,"authors":["D. S. Wang","A. G. Fowler","A. M. Stephens","L. C. L. Hollenberg"],"abstract":"The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correction procedure for the toric and surface codes, which is based on polynomial-time graph matching techniques and is efficiently implementable as the classical feed-forward processing step in a real quantum computer. By direct simulation of this error correction scheme, we determine the threshold error rates for the two codes (differing only in their boundary conditions) for both ideal and non-ideal syndrome extraction scenarios. We verify that the toric code has an asymptotic threshold of p = 15.5% under ideal syndrome extraction, and p = 7.8 10^-3 for the non-ideal case, in agreement with prior work. Simulations of the surface code indicate that the threshold is close to that of the toric code.","url_abs":"https://arxiv.org/abs/0905.0531v1","url_pdf":"https://arxiv.org/pdf/0905.0531v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"threshold-error-rates-for-the-toric-and","repo_url":"https://github.com/mcclow12/Surface-Code-Simulation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"threshold-error-rates-for-the-toric-and","repo_url":"https://github.com/mcclow12/surface_code_simulation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=0905.0531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0905.0531"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mcclow12/surface_code_simulation","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mcclow12/Surface-Code-Simulation","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"listed":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"877f4402d6ebac88","entry":"get_data_qubit_pairs","repo":"mcclow12/Surface-Code-Simulation","repo_kind":"listed","path":"pyquil_surface_code/utils.py","file_url":"https://github.com/mcclow12/Surface-Code-Simulation/blob/HEAD/pyquil_surface_code/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"877f4402d6ebac88"}},{"code_sha256_prefix":"114a2e715ac22ed2","entry":"pair_to_single","repo":"mcclow12/Surface-Code-Simulation","repo_kind":"listed","path":"pyquil_surface_code/utils.py","file_url":"https://github.com/mcclow12/Surface-Code-Simulation/blob/HEAD/pyquil_surface_code/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"114a2e715ac22ed2"}},{"code_sha256_prefix":"b008bfa7a851f621","entry":"triple_to_single","repo":"mcclow12/Surface-Code-Simulation","repo_kind":"listed","path":"pyquil_surface_code/utils.py","file_url":"https://github.com/mcclow12/Surface-Code-Simulation/blob/HEAD/pyquil_surface_code/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b008bfa7a851f621"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}