{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:E4VRCXNOV3XBIPAEX7LSBP2DKX","short_pith_number":"pith:E4VRCXNO","schema_version":"1.0","canonical_sha256":"272b115daeaeee143c04bfd720bf4355ee57cbdb69e81fae28e15a7c87228942","source":{"kind":"arxiv","id":"0803.0272","version":5},"attestation_state":"computed","paper":{"title":"High threshold universal quantum computation on the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley M. Stephens, Austin G. Fowler, Peter Groszkowski","submitted_at":"2008-03-03T16:01:13Z","abstract_excerpt":"We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%, natural asymmetric and adjustable strength error correction and low overhead arbitrarily long-range logical gates. These features make it by far the best and most practical quantum computing scheme devised to date. We restrict the discussion to direct manipulation of the surface code using the stabilizer formalism, both of which we also briefly review, to mak"},"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":"0803.0272","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-03-03T16:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"8e34de219b14408137352c234ab97126168545c51e963f9e2684e1e7553e97e1","abstract_canon_sha256":"467adede09fc07bb1e0a1f504857b22e80a9b0a8def1e011fe01a263bd35ad38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:57.561494Z","signature_b64":"z4jGHeNiGHud7hwnSvNtvsRgdXida8B7Pj4ozUjnIItHvHSJ6PfXyNKyy0y5oA5fwpRlmAyBZWrG/CWPWB1IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272b115daeaeee143c04bfd720bf4355ee57cbdb69e81fae28e15a7c87228942","last_reissued_at":"2026-05-18T02:24:57.560658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:57.560658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High threshold universal quantum computation on the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley M. Stephens, Austin G. Fowler, Peter Groszkowski","submitted_at":"2008-03-03T16:01:13Z","abstract_excerpt":"We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%, natural asymmetric and adjustable strength error correction and low overhead arbitrarily long-range logical gates. These features make it by far the best and most practical quantum computing scheme devised to date. We restrict the discussion to direct manipulation of the surface code using the stabilizer formalism, both of which we also briefly review, to mak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0272","kind":"arxiv","version":5},"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":"0803.0272","created_at":"2026-05-18T02:24:57.560783+00:00"},{"alias_kind":"arxiv_version","alias_value":"0803.0272v5","created_at":"2026-05-18T02:24:57.560783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0272","created_at":"2026-05-18T02:24:57.560783+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4VRCXNOV3XB","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4VRCXNOV3XBIPAE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4VRCXNO","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX","json":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX.json","graph_json":"https://pith.science/api/pith-number/E4VRCXNOV3XBIPAEX7LSBP2DKX/graph.json","events_json":"https://pith.science/api/pith-number/E4VRCXNOV3XBIPAEX7LSBP2DKX/events.json","paper":"https://pith.science/paper/E4VRCXNO"},"agent_actions":{"view_html":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX","download_json":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX.json","view_paper":"https://pith.science/paper/E4VRCXNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0803.0272&json=true","fetch_graph":"https://pith.science/api/pith-number/E4VRCXNOV3XBIPAEX7LSBP2DKX/graph.json","fetch_events":"https://pith.science/api/pith-number/E4VRCXNOV3XBIPAEX7LSBP2DKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX/action/storage_attestation","attest_author":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX/action/author_attestation","sign_citation":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX/action/citation_signature","submit_replication":"https://pith.science/pith/E4VRCXNOV3XBIPAEX7LSBP2DKX/action/replication_record"}},"created_at":"2026-05-18T02:24:57.560783+00:00","updated_at":"2026-05-18T02:24:57.560783+00:00"}