{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:54NOLBVXVTLHUUGULSG43TR2LH","short_pith_number":"pith:54NOLBVX","schema_version":"1.0","canonical_sha256":"ef1ae586b7acd67a50d45c8dcdce3a59dcd0a27d6d60110125f95465f3e5ef42","source":{"kind":"arxiv","id":"2211.15465","version":1},"attestation_state":"computed","paper":{"title":"Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski, Naomi Nickerson","submitted_at":"2022-11-28T15:51:58Z","abstract_excerpt":"In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum com"},"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":"2211.15465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-28T15:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"650639f4bb865008b5d9ec08c3fdf058449139ea55706cce607d7049a7184312","abstract_canon_sha256":"ad0ecefd8e74bcd2e6d44ca99df0407d95649d71d31f57b0cc344311e890159e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:04.082697Z","signature_b64":"gC6xq9NHX5cWUTKFdG2yERDwt+MwK0bmU1FX8uIErqQepn2ujPMgpv1kixw5F0CldgMeExg+/a0mUh8W8ag6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1ae586b7acd67a50d45c8dcdce3a59dcd0a27d6d60110125f95465f3e5ef42","last_reissued_at":"2026-07-05T05:20:04.082236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:04.082236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Litinski, Naomi Nickerson","submitted_at":"2022-11-28T15:51:58Z","abstract_excerpt":"In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15465","kind":"arxiv","version":1},"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/2211.15465/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":"2211.15465","created_at":"2026-07-05T05:20:04.082292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.15465v1","created_at":"2026-07-05T05:20:04.082292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15465","created_at":"2026-07-05T05:20:04.082292+00:00"},{"alias_kind":"pith_short_12","alias_value":"54NOLBVXVTLH","created_at":"2026-07-05T05:20:04.082292+00:00"},{"alias_kind":"pith_short_16","alias_value":"54NOLBVXVTLHUUGU","created_at":"2026-07-05T05:20:04.082292+00:00"},{"alias_kind":"pith_short_8","alias_value":"54NOLBVX","created_at":"2026-07-05T05:20:04.082292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30741","citing_title":"Theory and practice of Trotter product formulas for quantum chemistry","ref_index":4,"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":145,"is_internal_anchor":false},{"citing_arxiv_id":"2602.05956","citing_title":"Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2506.16113","citing_title":"Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":43,"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":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03854","citing_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH","json":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH.json","graph_json":"https://pith.science/api/pith-number/54NOLBVXVTLHUUGULSG43TR2LH/graph.json","events_json":"https://pith.science/api/pith-number/54NOLBVXVTLHUUGULSG43TR2LH/events.json","paper":"https://pith.science/paper/54NOLBVX"},"agent_actions":{"view_html":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH","download_json":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH.json","view_paper":"https://pith.science/paper/54NOLBVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.15465&json=true","fetch_graph":"https://pith.science/api/pith-number/54NOLBVXVTLHUUGULSG43TR2LH/graph.json","fetch_events":"https://pith.science/api/pith-number/54NOLBVXVTLHUUGULSG43TR2LH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH/action/storage_attestation","attest_author":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH/action/author_attestation","sign_citation":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH/action/citation_signature","submit_replication":"https://pith.science/pith/54NOLBVXVTLHUUGULSG43TR2LH/action/replication_record"}},"created_at":"2026-07-05T05:20:04.082292+00:00","updated_at":"2026-07-05T05:20:04.082292+00:00"}