{"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"}