发表机构
University of California, Los Angeles; QuEra Computing Inc.（加州大学洛杉矶分校; QuEra计算公司）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对容错量子编译中离线调度无法适应随机资源结果的问题，提出实时编译框架FT-Weave，联合协调资源制备、分配、路由与纠错，在两种中性原子架构上实现高达3倍加速，并揭示运行时协调比暴露并行性更关键。
AI 中文摘要
容错量子计算（FTQC）对于大规模量子计算至关重要，但实现有用的应用吞吐量需要在严格的硬件和时序约束下协调资源制备、分配、路由和逻辑执行。许多FTQC编译方法使用标称或固定的魔法态工厂吞吐量来构建离线调度。此类调度无法响应随机的资源制备和隐形传态结果，导致执行停滞和硬件利用率不足。在本工作中，我们引入了FT-Weave，一种阶段感知的实时FTQC编译框架，它联合协调资源制备、资源分配、隐形传态路由和纠错处理。通过适应运行时资源可用性和硬件约束，FT-Weave允许制备、通信和逻辑执行重叠进行。我们在两种具有代表性的中性原子早期FTQC架构上实例化了FT-Weave：横向STAR和T态培育架构。在评估的硬件和延迟模型下，对于二维横向伊辛模型的模拟，FT-Weave相比基线编译流程实现了高达3倍的加速。在案例研究中，我们进一步发现，最大化暴露的并发性并不一定最小化执行时间。尽管细粒度的异步执行可以减少局部空闲时间，但其较小的优化窗口和增加的路由争用可能抵消这些收益。综合来看，这些结果表明，有效的运行时协调（而非仅暴露的并行性）决定了FTQC资源转化为应用吞吐量的效率：FT-Weave为跨资源协议和架构解决这一实时编排问题提供了蓝图。
英文摘要
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.
Comments28 pages, 10 figures
