{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WQ2DVVJRBWKWSTV32YFWJECQSU","short_pith_number":"pith:WQ2DVVJR","schema_version":"1.0","canonical_sha256":"b4343ad5310d95694ebbd60b6490509521122223134d6b7a24464a9f9a9a09a4","source":{"kind":"arxiv","id":"2504.21854","version":2},"attestation_state":"computed","paper":{"title":"SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Chenxu Liu, Meng Wang, Samuel Stein, Shuwen Kan, Ying Mao, Yufei Ding, Zefan Du","submitted_at":"2025-04-30T17:59:53Z","abstract_excerpt":"Surface codes represent a leading approach for quantum error correction (QEC), offering a path towards universal fault-tolerant quantum computing (FTQC). However, efficiently implementing algorithms, particularly using Pauli-based computation (PBC) with lattice surgery, necessitates careful resource optimization. Prior work often employs static layouts and simplified error models. These typically fail to capture the full costs and dynamic nature of active computation, leading to resource bottlenecks and suboptimal architectural designs. To address this, we introduce SPARO. SPARO features a 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":"2504.21854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-30T17:59:53Z","cross_cats_sorted":[],"title_canon_sha256":"85d6dd162c39198d353af033ff402f60cc7c1d46f8832029663eaf33e8fefcaa","abstract_canon_sha256":"378d3d51f4ad80c6c8cc19c63be5c59a680bb123b8864de78b745a098acb2e40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:40.171021Z","signature_b64":"HCsgEp1cEoci1aKTWYicdRfH/5WSTjj5FlMyy32+XuOrUAxtNYoV1CGy6MyfqlfVgdTHsEwQBn5hZNFHvKBUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4343ad5310d95694ebbd60b6490509521122223134d6b7a24464a9f9a9a09a4","last_reissued_at":"2026-07-05T10:56:40.170521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:40.170521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SPARO: Surface-code Pauli-based Architectural Resource Optimization for Fault-tolerant Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ang Li, Chenxu Liu, Meng Wang, Samuel Stein, Shuwen Kan, Ying Mao, Yufei Ding, Zefan Du","submitted_at":"2025-04-30T17:59:53Z","abstract_excerpt":"Surface codes represent a leading approach for quantum error correction (QEC), offering a path towards universal fault-tolerant quantum computing (FTQC). However, efficiently implementing algorithms, particularly using Pauli-based computation (PBC) with lattice surgery, necessitates careful resource optimization. Prior work often employs static layouts and simplified error models. These typically fail to capture the full costs and dynamic nature of active computation, leading to resource bottlenecks and suboptimal architectural designs. To address this, we introduce SPARO. SPARO features a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21854","kind":"arxiv","version":2},"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/2504.21854/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":"2504.21854","created_at":"2026-07-05T10:56:40.170581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21854v2","created_at":"2026-07-05T10:56:40.170581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21854","created_at":"2026-07-05T10:56:40.170581+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ2DVVJRBWKW","created_at":"2026-07-05T10:56:40.170581+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ2DVVJRBWKWSTV3","created_at":"2026-07-05T10:56:40.170581+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ2DVVJR","created_at":"2026-07-05T10:56:40.170581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","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":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06319","citing_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15099","citing_title":"O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU","json":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU.json","graph_json":"https://pith.science/api/pith-number/WQ2DVVJRBWKWSTV32YFWJECQSU/graph.json","events_json":"https://pith.science/api/pith-number/WQ2DVVJRBWKWSTV32YFWJECQSU/events.json","paper":"https://pith.science/paper/WQ2DVVJR"},"agent_actions":{"view_html":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU","download_json":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU.json","view_paper":"https://pith.science/paper/WQ2DVVJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21854&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ2DVVJRBWKWSTV32YFWJECQSU/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ2DVVJRBWKWSTV32YFWJECQSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU/action/storage_attestation","attest_author":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU/action/author_attestation","sign_citation":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU/action/citation_signature","submit_replication":"https://pith.science/pith/WQ2DVVJRBWKWSTV32YFWJECQSU/action/replication_record"}},"created_at":"2026-07-05T10:56:40.170581+00:00","updated_at":"2026-07-05T10:56:40.170581+00:00"}