Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing

Stade, Yannick, Lin, Wan-Hsuan, Cong, Jason, Wille, Robert · 2025 · 2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD)

| 编号 NA034 | 主题 编译、布局与调度 | DOI 10.1109/iccad66269.2025.11240721 |

摘要

摘要保留原文（英文）

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

2025 · 2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD) Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense parallelism and higher coherence times by shielding idling atoms from interference with laser beams. However, in addition to hardware, successful quantum computation requires sophisticated software support, particularly compilers that optimize quantum algorithms for hardware execution. In the compilation flow for zoned neutral atom architectures, the effective interplay of the placement and routing stages decides the overhead caused by rearranging the atoms during the quantum computation. Sub-optimal placements can lead to unnecessary serialization of the rearrangements in the subsequent routing stage. Despite this, all existing compilers treat placement and routing independently thus far - focusing solely on minimizing travel distances. This work introduces the first routing-aware placement method to address this shortcoming. It groups compatible movements into parallel rearrangement steps to minimize both rearrangement steps and travel distances. The implementation utilizing the A* algorithm reduces the rearrangement time by 17% on average and by 49% in the best case compared to the state-of-the-art. The complete code is publicly available in open-source as part of the Munich Quantum Toolkit (MQT) at https://github.com/munich-quantum-toolkit/qmap.

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

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