{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2WSLQPIFWD7ICCB4YH34OZMOD2","short_pith_number":"pith:2WSLQPIF","schema_version":"1.0","canonical_sha256":"d5a4b83d05b0fe81083cc1f7c7658e1e8a6b43dfe10241b8977deee680eaecd8","source":{"kind":"arxiv","id":"1310.2984","version":3},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Quantum Computation with Constant Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"2013-10-10T23:21:37Z","abstract_excerpt":"What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol."},"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":"1310.2984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-10T23:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"00a0255aff82c90f42be2010e0e44ce600e8365152a369a0d1ebc090ac91bdce","abstract_canon_sha256":"03a52f66421f77f1e0fea2907b79c743a00ff32afb119340d4ae351699eadc92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:07.719271Z","signature_b64":"U1616pJxRfPlESI30BBH2tp/qKyWC5XCkaY+zw6jSNMFIZ/i4Mmj2EzZ7SLCn7QwvlAKxtRSjlnTQ6aF8mTfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a4b83d05b0fe81083cc1f7c7658e1e8a6b43dfe10241b8977deee680eaecd8","last_reissued_at":"2026-05-18T02:47:07.718696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:07.718696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Quantum Computation with Constant Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"2013-10-10T23:21:37Z","abstract_excerpt":"What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2984","kind":"arxiv","version":3},"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":"1310.2984","created_at":"2026-05-18T02:47:07.718786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2984v3","created_at":"2026-05-18T02:47:07.718786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2984","created_at":"2026-05-18T02:47:07.718786+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WSLQPIFWD7I","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WSLQPIFWD7ICCB4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WSLQPIF","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":18,"internal_anchor_count":13,"sample":[{"citing_arxiv_id":"2607.06177","citing_title":"Using Tanner Spectral Reduction to Improve Multi-Layer Optical Lattice Routing for Hypergraph-Product and Bivariate Bicycle qLDPC Codes","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19848","citing_title":"QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12394","citing_title":"Scaling-optimal purification of noisy qubit unitary channels","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23443","citing_title":"Asymptotic Limits of Entanglement Distribution","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2501.08036","citing_title":"Decoding Quantum LDPC Codes using Collaborative Check Node Removal","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18877","citing_title":"Logical Resource Estimation for Quantum State Preparation with Compilation","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17796","citing_title":"LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2509.01892","citing_title":"Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2","json":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2.json","graph_json":"https://pith.science/api/pith-number/2WSLQPIFWD7ICCB4YH34OZMOD2/graph.json","events_json":"https://pith.science/api/pith-number/2WSLQPIFWD7ICCB4YH34OZMOD2/events.json","paper":"https://pith.science/paper/2WSLQPIF"},"agent_actions":{"view_html":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2","download_json":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2.json","view_paper":"https://pith.science/paper/2WSLQPIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2984&json=true","fetch_graph":"https://pith.science/api/pith-number/2WSLQPIFWD7ICCB4YH34OZMOD2/graph.json","fetch_events":"https://pith.science/api/pith-number/2WSLQPIFWD7ICCB4YH34OZMOD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2/action/storage_attestation","attest_author":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2/action/author_attestation","sign_citation":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2/action/citation_signature","submit_replication":"https://pith.science/pith/2WSLQPIFWD7ICCB4YH34OZMOD2/action/replication_record"}},"created_at":"2026-05-18T02:47:07.718786+00:00","updated_at":"2026-05-18T02:47:07.718786+00:00"}