{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZFH64BBDVMRXFTRA5LTBRSEWD7","short_pith_number":"pith:ZFH64BBD","schema_version":"1.0","canonical_sha256":"c94fee0423ab2372ce20eae618c8961ff5c4cd9a0789060fc3d5985e0b2f4284","source":{"kind":"arxiv","id":"1808.06709","version":4},"attestation_state":"computed","paper":{"title":"Low overhead quantum computation using lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Craig Gidney","submitted_at":"2018-08-20T22:09:39Z","abstract_excerpt":"When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\\times 10^5$ physical qubits capable of executing gates with error $p\\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated 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":"1808.06709","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-20T22:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"93d6b8d6681a852944d0738119bb9e54b8b8470056a6e3d3ed86d3b331756c8d","abstract_canon_sha256":"021768858d6ba76be04b969fbc55ecd183e4ead2d505959fee82c74633cbd215"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:51.786076Z","signature_b64":"z5KuzyFI6B5O+BF3nKLH+7nJlSv049IhHQ4Mn4jNis8BFOradede4ExzxuM8zt+ru/Es7KUV+yfojvOPGbVuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94fee0423ab2372ce20eae618c8961ff5c4cd9a0789060fc3d5985e0b2f4284","last_reissued_at":"2026-07-05T00:00:51.785584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:51.785584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low overhead quantum computation using lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Craig Gidney","submitted_at":"2018-08-20T22:09:39Z","abstract_excerpt":"When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\\times 10^5$ physical qubits capable of executing gates with error $p\\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06709","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1808.06709/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1808.06709","created_at":"2026-07-05T00:00:51.785652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06709v4","created_at":"2026-07-05T00:00:51.785652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06709","created_at":"2026-07-05T00:00:51.785652+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFH64BBDVMRX","created_at":"2026-07-05T00:00:51.785652+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFH64BBDVMRXFTRA","created_at":"2026-07-05T00:00:51.785652+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFH64BBD","created_at":"2026-07-05T00:00:51.785652+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.21192","citing_title":"Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19593","citing_title":"Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07734","citing_title":"Exploring the landscape of compact magic-state distillation factories","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31544","citing_title":"More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"1907.03044","citing_title":"Credit Risk Analysis using Quantum Computers","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2401.15829","citing_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2406.09340","citing_title":"Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers","ref_index":116,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2504.05611","citing_title":"Transversal Fault Tolerant Distributed Quantum Computing Operations","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21746","citing_title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06758","citing_title":"Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19471","citing_title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2508.06236","citing_title":"Space and Time Cost of Continuous Rotations in Surface Codes","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12600","citing_title":"Fermion lattices can be simulated by same-size qubit lattices with $\\mathcal{O}(1)$ interaction overhead","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25524","citing_title":"Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05315","citing_title":"Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12841","citing_title":"Fast and accurate AI-based pre-decoders for surface codes","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12560","citing_title":"Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings","ref_index":7,"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":28,"is_internal_anchor":false},{"citing_arxiv_id":"2508.19160","citing_title":"Architecting Distributed Quantum Computers: Design Insights from Resource Estimation","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04459","citing_title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","ref_index":31,"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":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7","json":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7.json","graph_json":"https://pith.science/api/pith-number/ZFH64BBDVMRXFTRA5LTBRSEWD7/graph.json","events_json":"https://pith.science/api/pith-number/ZFH64BBDVMRXFTRA5LTBRSEWD7/events.json","paper":"https://pith.science/paper/ZFH64BBD"},"agent_actions":{"view_html":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7","download_json":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7.json","view_paper":"https://pith.science/paper/ZFH64BBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06709&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFH64BBDVMRXFTRA5LTBRSEWD7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFH64BBDVMRXFTRA5LTBRSEWD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7/action/storage_attestation","attest_author":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7/action/author_attestation","sign_citation":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7/action/citation_signature","submit_replication":"https://pith.science/pith/ZFH64BBDVMRXFTRA5LTBRSEWD7/action/replication_record"}},"created_at":"2026-07-05T00:00:51.785652+00:00","updated_at":"2026-07-05T00:00:51.785652+00:00"}