atommovr: An open-source simulation framework for rearrangement in atomic arrays
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916880105603072 |
|---|---|
| author | Harle, Nikhil K Chen, Bo-Yu Bao, Bob Bernien, Hannes |
| author_facet | Harle, Nikhil K Chen, Bo-Yu Bao, Bob Bernien, Hannes |
| contents | The task of atom rearrangement has emerged in the last decade as a fundamental building block for the development of neutral atom-based quantum processors. However, despite many recent efforts to develop algorithms with favorable asymptotic scaling, no time-optimal algorithm has been developed for any rearrangement task. Moreover, no open-source code exists to reproduce or benchmark existing algorithms, and to assist the development of new rearrangement protocols. To address this deficiency, we develop an open-source simulation framework for developing, comparing, and benchmarking algorithms under realistic and customizable noise models. Using this framework, we \textbf{a)} numerically extract lower bounds for the scaling of a time-optimal rearrangement algorithm and compare it to existing heuristic algorithms \textbf{b)} develop a naive dual-species algorithm able to prepare arbitrary targets with near-unity success rate. With this framework, we hope to develop a common tool for the community to study rearrangement, lower the barrier to entry for new experimental groups, and stimulate progress in developing algorithms which approach time-optimal scaling. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02670 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | atommovr: An open-source simulation framework for rearrangement in atomic arrays Harle, Nikhil K Chen, Bo-Yu Bao, Bob Bernien, Hannes Quantum Physics Atomic Physics The task of atom rearrangement has emerged in the last decade as a fundamental building block for the development of neutral atom-based quantum processors. However, despite many recent efforts to develop algorithms with favorable asymptotic scaling, no time-optimal algorithm has been developed for any rearrangement task. Moreover, no open-source code exists to reproduce or benchmark existing algorithms, and to assist the development of new rearrangement protocols. To address this deficiency, we develop an open-source simulation framework for developing, comparing, and benchmarking algorithms under realistic and customizable noise models. Using this framework, we \textbf{a)} numerically extract lower bounds for the scaling of a time-optimal rearrangement algorithm and compare it to existing heuristic algorithms \textbf{b)} develop a naive dual-species algorithm able to prepare arbitrary targets with near-unity success rate. With this framework, we hope to develop a common tool for the community to study rearrangement, lower the barrier to entry for new experimental groups, and stimulate progress in developing algorithms which approach time-optimal scaling. |
| title | atommovr: An open-source simulation framework for rearrangement in atomic arrays |
| topic | Quantum Physics Atomic Physics |
| url | https://arxiv.org/abs/2508.02670 |