Structure-Aware Compilation for Scalable Neutral-Atom Quantum Computing

Dong, Dekuan, Zou, Fengyu, Chen, Hengzhun, Zhu, Guorui, et al. · 2026

| 编号 NA045 | 主题 编译、布局与调度 |

摘要

摘要保留原文（英文）

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

2026 · 预印本；未核实后续正式发表 We study the compilation of structured quantum gate families on two-dimensional neutral-atom arrays, aiming to reduce addressing and transport overhead under realistic hardware constraints. For single-qubit gates, we exploit the algebraic structures of gate families at the matrix level, enabling efficient rank-one decompositions over appropriate algebraic structures and thereby reducing the number of addressing layers. For controlled-Z (C-Z) gates, we formulate the transport scheduling problem using graph-theoretic models, leading to efficient compilation algorithms under realistic transport constraints. We provide provable performance guarantees for the proposed methods and validate them through extensive numerical experiments. Across representative single-qubit gate families, our methods reduce the number of addressing layers by up to a factor of two compared with na”ive row- or column-wise implementations. For C-Z gates, our scheduling strategy reduces the required number of atom transport operations by approximately 50%. When applied to QAOA circuits for MaxCut, the proposed framework reduces transport cost by more than 30% on average. These results show that the physical constraints of neutral-atom hardware can be converted into algebraic and graph-theoretic structure, turning a hardware-level scheduling bottleneck into tractable decomposition and coloring problems.

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

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