{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TNQ6HYAFE777KE6KS5LZKCEOIA","short_pith_number":"pith:TNQ6HYAF","schema_version":"1.0","canonical_sha256":"9b61e3e00527fff513ca975795088e4019dfd46ef48ac4f1f230f13177b0d53a","source":{"kind":"arxiv","id":"2605.14042","version":1},"attestation_state":"computed","paper":{"title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dhanvi Bharadwaj, Gokul Subramanian Ravi, Siddharth Dangwal, Yuewen Hou","submitted_at":"2026-05-13T19:03:18Z","abstract_excerpt":"Achieving practical quantum advantage on fault-tolerant quantum computers (FTQC) is fundamentally constrained by the substantial spatial and temporal overheads required to map logical operations onto physical hardware. Existing compilation approaches typically adopt coarse-grained, slice-based abstractions that overlook fine-grained microarchitectural effects, such as routing contention, leading to inefficient resource utilization and limited alignment between algorithm structure and hardware capabilities.\n  This work presents a microarchitecture-aware compilation approach that integrates algo"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T19:03:18Z","cross_cats_sorted":[],"title_canon_sha256":"7e1ff77e0fe4fdcc7cce5834ea4646c5e9dda3e993be56318066d684d3854947","abstract_canon_sha256":"c3f89faa221b29007bb7d911daf5489adcb49a210f691d8b1c4e72a1507160ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.735531Z","signature_b64":"PqGjh9grdaxp4c2ufq8BK+9I43hFNzsELARZrcNMaSgMxh5aqnYfEG7eQRqn9rKrqBWRDaWk9auBeWtSZF5IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b61e3e00527fff513ca975795088e4019dfd46ef48ac4f1f230f13177b0d53a","last_reissued_at":"2026-05-17T23:39:12.735051Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.735051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dhanvi Bharadwaj, Gokul Subramanian Ravi, Siddharth Dangwal, Yuewen Hou","submitted_at":"2026-05-13T19:03:18Z","abstract_excerpt":"Achieving practical quantum advantage on fault-tolerant quantum computers (FTQC) is fundamentally constrained by the substantial spatial and temporal overheads required to map logical operations onto physical hardware. Existing compilation approaches typically adopt coarse-grained, slice-based abstractions that overlook fine-grained microarchitectural effects, such as routing contention, leading to inefficient resource utilization and limited alignment between algorithm structure and hardware capabilities.\n  This work presents a microarchitecture-aware compilation approach that integrates algo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"achieves up to a 59.7× reduction in execution time compared to standard baselines","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the commutativity of C-Phase operations can be safely exploited in the lattice-surgery fault-tolerant setting without introducing logical errors, and that the dynamic event-driven scheduler can model spatial and routing constraints with negligible overhead.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A microarchitecture-aware compiler for lattice surgery that exploits C-Phase commutativity to enable concurrent multi-target operations and dynamic event-driven scheduling, cutting execution time by up to 59.7 times versus standard baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9b92345fdd0d0aeee1fca2359a55c6a78211c76cc4cf049c9dc79276d4f66c02"},"source":{"id":"2605.14042","kind":"arxiv","version":1},"verdict":{"id":"aa5e136f-7888-4887-8468-3a4fb0cceeed","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:31:39.698887Z","strongest_claim":"achieves up to a 59.7× reduction in execution time compared to standard baselines","one_line_summary":"A microarchitecture-aware compiler for lattice surgery that exploits C-Phase commutativity to enable concurrent multi-target operations and dynamic event-driven scheduling, cutting execution time by up to 59.7 times versus standard baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the commutativity of C-Phase operations can be safely exploited in the lattice-surgery fault-tolerant setting without introducing logical errors, and that the dynamic event-driven scheduler can model spatial and routing constraints with negligible overhead.","pith_extraction_headline":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times."},"references":{"count":49,"sample":[{"doi":"10.1103/prxquantum.5.010337","year":2024,"title":"Yutaro Akahoshi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato, and Keisuke Fujii. 2024. Partially Fault-Tolerant Quantum Com- puting Architecture with Error-Corrected Clifford Gates and Space- Ti","work_id":"323ccb48-8e30-4fe8-a0fc-d032ad6be672","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"George S Barron, Fernando A Calderon-Vargas, Junling Long, David P Pappas, and Sophia E Economou. 2020. Microwave-based arbitrary cphase gates for transmon qubits.Physical Review B101, 5 (2020), 05450","work_id":"3d3296e0-6a71-4026-be45-1e98455d13a7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Elisa Bäumer, Vinay Tripathi, Alireza Seif, Daniel Lidar, and Derek S Wang. 2024. Quantum Fourier transform using dynamic circuits. Physical Review Letters133, 15 (2024), 150602","work_id":"857b1f92-7cfd-4e23-8678-b3eb16432aa2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/prxquantum.2.020341","year":2021,"title":"and Kubica, Aleksander and Svore, Krysta M","work_id":"07affece-63f3-424d-bb65-1fb72ccd838f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Assessing requirements to scale to practical quantum advantage","work_id":"e7813b83-6bed-4c93-bc82-53ef716563d6","ref_index":5,"cited_arxiv_id":"2211.07629","is_internal_anchor":true}],"resolved_work":49,"snapshot_sha256":"2332395c4787c2310c31b353ccd0a96316341b3374808f55987dce17e4288f4c","internal_anchors":5},"formal_canon":{"evidence_count":1,"snapshot_sha256":"d89d34a354d65ab25030d3c25ab8b78c705993934d4e5da3923ac52aab0eae0f"},"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":"2605.14042","created_at":"2026-05-17T23:39:12.735128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14042v1","created_at":"2026-05-17T23:39:12.735128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14042","created_at":"2026-05-17T23:39:12.735128+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNQ6HYAFE777","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNQ6HYAFE777KE6K","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNQ6HYAF","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03315","citing_title":"Harvest: Resource-Aware Quantum Compilation for Magic State Protocols","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA","json":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA.json","graph_json":"https://pith.science/api/pith-number/TNQ6HYAFE777KE6KS5LZKCEOIA/graph.json","events_json":"https://pith.science/api/pith-number/TNQ6HYAFE777KE6KS5LZKCEOIA/events.json","paper":"https://pith.science/paper/TNQ6HYAF"},"agent_actions":{"view_html":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA","download_json":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA.json","view_paper":"https://pith.science/paper/TNQ6HYAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14042&json=true","fetch_graph":"https://pith.science/api/pith-number/TNQ6HYAFE777KE6KS5LZKCEOIA/graph.json","fetch_events":"https://pith.science/api/pith-number/TNQ6HYAFE777KE6KS5LZKCEOIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA/action/storage_attestation","attest_author":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA/action/author_attestation","sign_citation":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA/action/citation_signature","submit_replication":"https://pith.science/pith/TNQ6HYAFE777KE6KS5LZKCEOIA/action/replication_record"}},"created_at":"2026-05-17T23:39:12.735128+00:00","updated_at":"2026-05-17T23:39:12.735128+00:00"}