atommovr: An open-source simulation framework for rearrangement in atomic arrays

TL;DR

This paper introduces an open-source simulation framework for atom rearrangement in quantum processors, enabling benchmarking, development, and comparison of algorithms under realistic noise conditions.

Contribution

It provides the first open-source tool for simulating and benchmarking atom rearrangement algorithms, including lower bounds and a naive dual-species algorithm.

Findings

Numerically derived lower bounds for time-optimal rearrangement algorithms.

Development of a naive dual-species algorithm with high success rate.

Framework facilitates community collaboration and progress in quantum atom rearrangement.

Abstract

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.