{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JPFKTAVORGWB2RF4Q5E6QFCONU","short_pith_number":"pith:JPFKTAVO","schema_version":"1.0","canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","source":{"kind":"arxiv","id":"1808.02892","version":3},"attestation_state":"computed","paper":{"title":"A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2018-08-08T18:00:01Z","abstract_excerpt":"Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a "},"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.02892","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-08-08T18:00:01Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"958055401712c99feb3f20245e14c0844173608fbdbf105cc780334b0b6d0e65","abstract_canon_sha256":"c275604e82ddb1b9c6f3cb005923332149d22733b1047fcdc9c41bf88c15535a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:58.923781Z","signature_b64":"7sypnE6ochdZbp+xhGPg/KlEm/c1gnlgj2bAfnsMdvYVFh0ecXRXPDiRn05nzncMSnROgVcEkOKfNhRUt5euAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bcaa982ae89ac1d44bc8749e8144e6d25f492d8631164a05efb6bd4d7cbb08b","last_reissued_at":"2026-05-17T23:51:58.923421Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:58.923421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Daniel Litinski","submitted_at":"2018-08-08T18:00:01Z","abstract_excerpt":"Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02892","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":"1808.02892","created_at":"2026-05-17T23:51:58.923484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02892v3","created_at":"2026-05-17T23:51:58.923484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02892","created_at":"2026-05-17T23:51:58.923484+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPFKTAVORGWB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPFKTAVORGWB2RF4","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPFKTAVO","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2605.23738","citing_title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2412.01446","citing_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14042","citing_title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26792","citing_title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25094","citing_title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04892","citing_title":"Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12841","citing_title":"Fast and accurate AI-based pre-decoders for surface codes","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU","json":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU.json","graph_json":"https://pith.science/api/pith-number/JPFKTAVORGWB2RF4Q5E6QFCONU/graph.json","events_json":"https://pith.science/api/pith-number/JPFKTAVORGWB2RF4Q5E6QFCONU/events.json","paper":"https://pith.science/paper/JPFKTAVO"},"agent_actions":{"view_html":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU","download_json":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU.json","view_paper":"https://pith.science/paper/JPFKTAVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02892&json=true","fetch_graph":"https://pith.science/api/pith-number/JPFKTAVORGWB2RF4Q5E6QFCONU/graph.json","fetch_events":"https://pith.science/api/pith-number/JPFKTAVORGWB2RF4Q5E6QFCONU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/action/storage_attestation","attest_author":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/action/author_attestation","sign_citation":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/action/citation_signature","submit_replication":"https://pith.science/pith/JPFKTAVORGWB2RF4Q5E6QFCONU/action/replication_record"}},"created_at":"2026-05-17T23:51:58.923484+00:00","updated_at":"2026-05-17T23:51:58.923484+00:00"}