{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TNQ6HYAFE777KE6KS5LZKCEOIA","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3f89faa221b29007bb7d911daf5489adcb49a210f691d8b1c4e72a1507160ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T19:03:18Z","title_canon_sha256":"7e1ff77e0fe4fdcc7cce5834ea4646c5e9dda3e993be56318066d684d3854947"},"schema_version":"1.0","source":{"id":"2605.14042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14042","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14042v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14042","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"TNQ6HYAFE777","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TNQ6HYAFE777KE6K","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TNQ6HYAF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:1b2324831596550c79095591c1f37f33889d6ea03a72141c48378082f2382dbe","target":"graph","created_at":"2026-05-17T23:39:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"achieves up to a 59.7× reduction in execution time compared to standard baselines"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times."}],"snapshot_sha256":"9b92345fdd0d0aeee1fca2359a55c6a78211c76cc4cf049c9dc79276d4f66c02"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"d89d34a354d65ab25030d3c25ab8b78c705993934d4e5da3923ac52aab0eae0f"},"paper":{"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","authors_text":"Dhanvi Bharadwaj, Gokul Subramanian Ravi, Siddharth Dangwal, Yuewen Hou","cross_cats":[],"headline":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T19:03:18Z","title":"C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution"},"references":{"count":49,"internal_anchors":5,"resolved_work":49,"sample":[{"cited_arxiv_id":"","doi":"10.1103/prxquantum.5.010337","is_internal_anchor":false,"ref_index":1,"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","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"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","year":2024},{"cited_arxiv_id":"","doi":"10.1103/prxquantum.2.020341","is_internal_anchor":false,"ref_index":4,"title":"and Kubica, Aleksander and Svore, Krysta M","work_id":"07affece-63f3-424d-bb65-1fb72ccd838f","year":2021},{"cited_arxiv_id":"2211.07629","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Assessing requirements to scale to practical quantum advantage","work_id":"e7813b83-6bed-4c93-bc82-53ef716563d6","year":2022}],"snapshot_sha256":"2332395c4787c2310c31b353ccd0a96316341b3374808f55987dce17e4288f4c"},"source":{"id":"2605.14042","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T05:31:39.698887Z","id":"aa5e136f-7888-4887-8468-3a4fb0cceeed","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Compiler exploits C-Phase commutativity to reduce fault-tolerant quantum execution time by up to 59.7 times.","strongest_claim":"achieves up to a 59.7× reduction in execution time compared to standard baselines","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."}},"verdict_id":"aa5e136f-7888-4887-8468-3a4fb0cceeed"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ddfb0597c01cf02d39d851072acda4c694211ab0145390209f466e08b36182c7","target":"record","created_at":"2026-05-17T23:39:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3f89faa221b29007bb7d911daf5489adcb49a210f691d8b1c4e72a1507160ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T19:03:18Z","title_canon_sha256":"7e1ff77e0fe4fdcc7cce5834ea4646c5e9dda3e993be56318066d684d3854947"},"schema_version":"1.0","source":{"id":"2605.14042","kind":"arxiv","version":1}},"canonical_sha256":"9b61e3e00527fff513ca975795088e4019dfd46ef48ac4f1f230f13177b0d53a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b61e3e00527fff513ca975795088e4019dfd46ef48ac4f1f230f13177b0d53a","first_computed_at":"2026-05-17T23:39:12.735051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.735051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PqGjh9grdaxp4c2ufq8BK+9I43hFNzsELARZrcNMaSgMxh5aqnYfEG7eQRqn9rKrqBWRDaWk9auBeWtSZF5IAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.735531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddfb0597c01cf02d39d851072acda4c694211ab0145390209f466e08b36182c7","sha256:1b2324831596550c79095591c1f37f33889d6ea03a72141c48378082f2382dbe","sha256:9eec2e3d37b08ddc9952239309faa8a027396c1bfb918bacc47cab57319a60d8"],"state_sha256":"c3737781d9e61e926028159c3d6e1078e57aa899c5a4fc800ad8ed31c3865ef5"}