Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling

Tan, Daniel Bochen, Lin, Wan-Hsuan, Cong, Jason · 2025 · Proceedings of the 30th Asia and South Pacific Design Automation Conference

| 编号 NA028 | 主题 编译、布局与调度 | DOI 10.1145/3658617.3697778 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

2025 · Proceedings of the 30th Asia and South Pacific Design Automation Conference Dynamically field-programmable qubit arrays based on neutral atoms feature high fidelity and highly parallel gates for quantum computing. However, it is challenging for compilers to fully leverage the novel flexibility offered by such hardware while respecting its various constraints. In this study, we break down the compilation for this architecture into three tasks: scheduling, placement, and routing. We formulate these three problems and present efficient solutions to them. Notably, our scheduling based on graph edge-coloring is provably near-optimal in terms of the number of two-qubit gate stages (at most one more than the optimum). As a result, our compiler, Enola, reduces this number of stages by 3.7x and improves the fidelity by 5.9x compared to OLSQ-DPQA, the current state of the art. Additionally, Enola is highly scalable, e.g., within 30 minutes, it can compile circuits with 10,000 qubits, a scale sufficient for the current era of quantum computing. Enola is open source at https://github.com/UCLA-VAST/Enola

全文共 9 页；文本提取件位于 .extracted/papers/NA028.txt（不随站点发布）。

本站词条在引用该文献时，会以 wikilink（sources/NA028）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。