Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 24 min ago
PreprintarXiv licencearXiv

C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution

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. We introduce Qomet, a microarchitecture-aware compiler that tightly couples algorithmic properties with lattice surgery (LS) execution. By exploiting C-Phase gate commutativity, Qomet translates sequential operations into simultaneous multi-target interactions, natively leveraging LS to eliminate false dependencies and expose instruction-level parallelism. To support this, Qomet employs an adaptive, event-driven scheduler that captures precise spatial and routing constraints to overlap instructions temporally. By minimizing grid idling and routing contention, Qomet achieves a geometric-mean execution speedup of 4.29× and a maximum speedup of 59.7× across realistic workloads.

Related

  1. Fault-tolerant execution of error-corrected quantum algorithms
    Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas +9
    Physical Review XPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsCrossref
  2. Verified Pauli-Product Measurement Compilation for Fault-Tolerant Quantum Computation
    John Zhuoyang Ye, Jens Palsberg
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
    Srushti Patil, Susan X. Chen, Andreas Juul Bay-Smidt +4
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
    Llorenç Escolà-Farràs, Boris Škorić, Florian Speelman
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures
    Wan-Hsuan Lin, Milan Kornjača, Chen Zhao +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{bharadwaj2026cphaseaware,
  title = {{C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution}},
  author = {Dhanvi Bharadwaj and Siddharth Dangwal and Yuewen Hou and Gokul Subramanian Ravi},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2605.14042},
  eprint = {2605.14042},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.14042},
}
RIS
TY  - UNPB
TI  - C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
AU  - Dhanvi Bharadwaj
AU  - Siddharth Dangwal
AU  - Yuewen Hou
AU  - Gokul Subramanian Ravi
PY  - 2026
DA  - 2026/08/30
PB  - arXiv
DO  - 10.48550/arxiv.2605.14042
UR  - https://arxiv.org/abs/2605.14042
AB  - 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. We introduce Qomet, a microarchitecture-aware compiler that tightly couples algorithmic properties with lattice surgery (LS) execution. By exploiting C-Phase gate commutativity, Qomet translates sequential operations into simultaneous multi-target interactions, natively leveraging LS to eliminate false dependencies and expose instruction-level parallelism. To support this, Qomet employs an adaptive, event-driven scheduler that captures precise spatial and routing constraints to overlap instructions temporally. By minimizing grid idling and routing contention, Qomet achieves a geometric-mean execution speedup of 4.29× and a maximum speedup of 59.7× across realistic workloads.
ER  -