FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures
Abstract
Fault-tolerant quantum computing (FTQC) is essential for large-scale quantum computation, but realizing useful application throughput requires coordinating resource preparation, assignment, routing, and logical execution under strict hardware and timing constraints. Many FTQC compilation approaches construct offline schedules using nominal or fixed magic-state factory throughput. Such schedules cannot respond to stochastic resource-preparation and teleportation outcomes, leading to execution stalls and hardware underutilization. In this work, we introduce FT-Weave, a stage-aware real-time FTQC compilation framework that jointly coordinates resource preparation, resource assignment, teleportation routing, and correction handling. By adapting to runtime resource availability and hardware constraints, FT-Weave allows preparation, communication, and logical execution to overlap. We instantiate FT-Weave on two representative neutral-atom, early FTQC architectures: transversal STAR and a T-state cultivation architecture. Under the evaluated hardware and latency model, FT-Weave achieves a speedup of up to 3X over a baseline compilation flow for simulations of the two-dimensional transverse-field Ising model. In the case study, we further find that maximizing exposed concurrency does not necessarily minimize execution time. Although fine-grained asynchronous execution can reduce local idle time, its smaller optimization windows and increased routing contention can outweigh these gains. Together, these results show that effective runtime coordination, rather then exposed parallelism alone, determines how efficiently FTQC resources translate into application throughput:FT-Weave provides a blueprint for solving this real-time orchestration problem across resource protocols and architectures.
Related
- A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
- C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
- Verified Pauli-Product Measurement Compilation for Fault-Tolerant Quantum Computation
- From QCCD Trapped-Ion Hardware to Quantum Compilers: Capabilities, Architectures, and Compilation
- CUDA-Q Logical: Retargetable Compilation for Fault-Tolerant Quantum Computing
BibTeX
@misc{lin2026ftweave,
title = {{FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures}},
author = {Wan-Hsuan Lin and Milan Kornjača and Chen Zhao and Sheng-Tao Wang and Jason Cong},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.20573},
eprint = {2609.20573},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.20573},
}
RIS
TY - UNPB
TI - FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures
AU - Wan-Hsuan Lin
AU - Milan Kornjača
AU - Chen Zhao
AU - Sheng-Tao Wang
AU - Jason Cong
PY - 2026
DA - 2026/09/17
PB - arXiv
DO - 10.48550/arxiv.2609.20573
UR - https://arxiv.org/abs/2609.20573
AB - Fault-tolerant quantum computing (FTQC) is essential for large-scale quantum computation, but realizing useful application throughput requires coordinating resource preparation, assignment, routing, and logical execution under strict hardware and timing constraints. Many FTQC compilation approaches construct offline schedules using nominal or fixed magic-state factory throughput. Such schedules cannot respond to stochastic resource-preparation and teleportation outcomes, leading to execution stalls and hardware underutilization. In this work, we introduce FT-Weave, a stage-aware real-time FTQC compilation framework that jointly coordinates resource preparation, resource assignment, teleportation routing, and correction handling. By adapting to runtime resource availability and hardware constraints, FT-Weave allows preparation, communication, and logical execution to overlap. We instantiate FT-Weave on two representative neutral-atom, early FTQC architectures: transversal STAR and a T-state cultivation architecture. Under the evaluated hardware and latency model, FT-Weave achieves a speedup of up to 3X over a baseline compilation flow for simulations of the two-dimensional transverse-field Ising model. In the case study, we further find that maximizing exposed concurrency does not necessarily minimize execution time. Although fine-grained asynchronous execution can reduce local idle time, its smaller optimization windows and increased routing contention can outweigh these gains. Together, these results show that effective runtime coordination, rather then exposed parallelism alone, determines how efficiently FTQC resources translate into application throughput:FT-Weave provides a blueprint for solving this real-time orchestration problem across resource protocols and architectures.
ER -