{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:5PJMVSCE4EFNNMJQ7O3R3VJJAO","short_pith_number":"pith:5PJMVSCE","schema_version":"1.0","canonical_sha256":"ebd2cac844e10ad6b130fbb71dd52903a8ef42ea2a94a6df60849f3c36f6da69","source":{"kind":"arxiv","id":"0905.0531","version":1},"attestation_state":"computed","paper":{"title":"Threshold error rates for the toric and surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. G. Fowler, A. M. Stephens, D. S. Wang, L. C. L. Hollenberg","submitted_at":"2009-05-05T06:19:06Z","abstract_excerpt":"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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0905.0531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-05-05T06:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"3757456bb56bb5eeb9e38e94428dd8aa185485f909a9f9b10cb19a7f5c03f1a4","abstract_canon_sha256":"33ff1efdf829c91dbac5f47c66c6de7ad3acad38c5a28da580467a6142d868a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:59.382383Z","signature_b64":"ngXVblxcn3F6LNNVUAA6Wepe4abL1i191nwlyJcxKSw2myvBes6CFKlgyZjbAdMO06ZV0qG83Q+0fUvfOBHkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebd2cac844e10ad6b130fbb71dd52903a8ef42ea2a94a6df60849f3c36f6da69","last_reissued_at":"2026-05-18T02:34:59.381927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:59.381927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold error rates for the toric and surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. G. Fowler, A. M. Stephens, D. S. Wang, L. C. L. Hollenberg","submitted_at":"2009-05-05T06:19:06Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0531","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"0905.0531","created_at":"2026-05-18T02:34:59.381985+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.0531v1","created_at":"2026-05-18T02:34:59.381985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0531","created_at":"2026-05-18T02:34:59.381985+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PJMVSCE4EFN","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PJMVSCE4EFNNMJQ","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PJMVSCE","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2312.03508","citing_title":"Convolutional neural network based decoders for surface codes","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2412.01446","citing_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2603.29439","citing_title":"PAEMS: Precise and Adaptive Error Model for Superconducting Quantum Processors","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO","json":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO.json","graph_json":"https://pith.science/api/pith-number/5PJMVSCE4EFNNMJQ7O3R3VJJAO/graph.json","events_json":"https://pith.science/api/pith-number/5PJMVSCE4EFNNMJQ7O3R3VJJAO/events.json","paper":"https://pith.science/paper/5PJMVSCE"},"agent_actions":{"view_html":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO","download_json":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO.json","view_paper":"https://pith.science/paper/5PJMVSCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.0531&json=true","fetch_graph":"https://pith.science/api/pith-number/5PJMVSCE4EFNNMJQ7O3R3VJJAO/graph.json","fetch_events":"https://pith.science/api/pith-number/5PJMVSCE4EFNNMJQ7O3R3VJJAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO/action/storage_attestation","attest_author":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO/action/author_attestation","sign_citation":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO/action/citation_signature","submit_replication":"https://pith.science/pith/5PJMVSCE4EFNNMJQ7O3R3VJJAO/action/replication_record"}},"created_at":"2026-05-18T02:34:59.381985+00:00","updated_at":"2026-05-18T02:34:59.381985+00:00"}