{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4UM2QTQUD56AQEMILZTVJT4UPE","short_pith_number":"pith:4UM2QTQU","schema_version":"1.0","canonical_sha256":"e519a84e141f7c0811885e6754cf94793afde26e6b7d2bf6ffdc91c1193bf617","source":{"kind":"arxiv","id":"2404.18369","version":3},"attestation_state":"computed","paper":{"title":"A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Daniel Bochen Tan, Murphy Yuezhen Niu","submitted_at":"2024-04-29T02:14:45Z","abstract_excerpt":"Quantum error correction is necessary for large-scale quantum computing. A promising quantum error correcting code is the surface code. For this code, fault-tolerant quantum computing (FTQC) can be performed via lattice surgery, i.e., splitting and merging patches of code. Given the frequent use of certain lattice-surgery subroutines (LaS), it becomes crucial to optimize their design in order to minimize the overall spacetime volume of FTQC. In this study, we define the variables to represent LaS and the constraints on these variables. Leveraging this formulation, we develop a synthesizer for "},"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":"2404.18369","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-29T02:14:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"da7ca1c115b43c4c71b0ac249f569488285dbf833f467f4eaa933a70c8840ab5","abstract_canon_sha256":"bbb5453a45d226d404be5db9c2ce99f7bac6abd4ce553ea8870809eca56692d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:33.719113Z","signature_b64":"3GOpdr6+bVJGlyT1uk0rJqKxwC1yF7fRB0Hhqgd9UwOzDXmMv4mZ0PtKT2tnHRgr7VI1PNdbs4GJWjFCJ1H9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e519a84e141f7c0811885e6754cf94793afde26e6b7d2bf6ffdc91c1193bf617","last_reissued_at":"2026-07-05T09:01:33.718635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:33.718635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Daniel Bochen Tan, Murphy Yuezhen Niu","submitted_at":"2024-04-29T02:14:45Z","abstract_excerpt":"Quantum error correction is necessary for large-scale quantum computing. A promising quantum error correcting code is the surface code. For this code, fault-tolerant quantum computing (FTQC) can be performed via lattice surgery, i.e., splitting and merging patches of code. Given the frequent use of certain lattice-surgery subroutines (LaS), it becomes crucial to optimize their design in order to minimize the overall spacetime volume of FTQC. In this study, we define the variables to represent LaS and the constraints on these variables. Leveraging this formulation, we develop a synthesizer for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.18369/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":"2404.18369","created_at":"2026-07-05T09:01:33.718690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18369v3","created_at":"2026-07-05T09:01:33.718690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18369","created_at":"2026-07-05T09:01:33.718690+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UM2QTQUD56A","created_at":"2026-07-05T09:01:33.718690+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UM2QTQUD56AQEMI","created_at":"2026-07-05T09:01:33.718690+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UM2QTQU","created_at":"2026-07-05T09:01:33.718690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14042","citing_title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","ref_index":44,"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":78,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE","json":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE.json","graph_json":"https://pith.science/api/pith-number/4UM2QTQUD56AQEMILZTVJT4UPE/graph.json","events_json":"https://pith.science/api/pith-number/4UM2QTQUD56AQEMILZTVJT4UPE/events.json","paper":"https://pith.science/paper/4UM2QTQU"},"agent_actions":{"view_html":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE","download_json":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE.json","view_paper":"https://pith.science/paper/4UM2QTQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18369&json=true","fetch_graph":"https://pith.science/api/pith-number/4UM2QTQUD56AQEMILZTVJT4UPE/graph.json","fetch_events":"https://pith.science/api/pith-number/4UM2QTQUD56AQEMILZTVJT4UPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE/action/storage_attestation","attest_author":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE/action/author_attestation","sign_citation":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE/action/citation_signature","submit_replication":"https://pith.science/pith/4UM2QTQUD56AQEMILZTVJT4UPE/action/replication_record"}},"created_at":"2026-07-05T09:01:33.718690+00:00","updated_at":"2026-07-05T09:01:33.718690+00:00"}