Optimal Routing Protocols for Reconfigurable Atom Arrays

Constantinides, Nathan, Fahimniya, Ali, Devulapalli, Dhruv, Bluvstein, Dolev, et al. · 2024

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

摘要

摘要保留原文（英文）

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

2024 · 预印本；未核实后续正式发表 Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multiple atoms in parallel, we prove that current designs require $\Omega (\sqrt{N}\log N)$ steps to perform certain permutations on 2D arrays with $N$ atoms and provide a protocol that achieves routing in $\mathcal{O}(\sqrt{N}\log N)$ steps for any permutation. We also propose a simple experimental upgrade and show that it would reduce the routing cost to $\Theta (\log N)$ steps.

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

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