C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
Dhanvi Bharadwaj, Siddharth Dangwal, Yuewen Hou, Gokul Subramanian Ravi

TL;DR
This paper introduces a microarchitecture-aware compilation method for fault-tolerant quantum computers that leverages C-Phase operation commutativity to enhance parallelism and reduce execution time.
Contribution
It presents a novel compilation approach that integrates algorithmic structure with lattice surgery, enabling concurrent operations and dynamic scheduling to optimize resource utilization.
Findings
Achieves up to 59.7× reduction in execution time.
Transforms sequential gate sequences into concurrent multi-target interactions.
Effectively models spatial layout and routing constraints for better scheduling.
Abstract
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. This work presents a microarchitecture-aware compilation approach that integrates algorithmic structure directly with lattice surgery (LS) execution. By leveraging the commutativity of C-Phase operations, the method transforms inherently sequential gate sequences into concurrent multi-target interactions, effectively removing artificial dependencies and exposing significant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
