Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm
arXiv:2212.05586 · doi:10.1103/PhysRevA.108.023108
Abstract
Programmable arrays of optical traps enable the assembly of configurations of single atoms to perform controlled experiments on quantum many-body systems. Finding the sequence of control operations to transform an arbitrary configuration of atoms into a predetermined one requires solving an atom reconfiguration problem quickly and efficiently. A typical approach to solve atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps. This approach results in control protocols that exactly minimize the number of displacement operations; however, this approach does not optimize for the number of displaced atoms or the number of times each atom is displaced, resulting in unnecessary control operations that increase the execution time and failure rate of the control protocol. In this work, we propose the assignment-rerouting-ordering (aro) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems. The aro algorithm uses an assignment subroutine to minimize the total distance traveled by all atoms, a rerouting subroutine to reduce the number of displaced atoms, and an ordering subroutine to guarantee that each atom is displaced at most once. The ordering subroutine relies on the existence of a partial ordering of moves that can be obtained using a polynomial-time algorithm that we introduce within the formal framework of graph theory. We numerically quantify the performance of the aro algorithm in the presence and in the absence of loss, and show that it outperforms the exact, approximation, and heuristic algorithms that we use as benchmarks. Our results are useful for assembling large configurations of atoms with high success probability and fast preparation time, as well as for designing and benchmarking novel atom reconfiguration algorithms.
27 pages, 10 figures, 3 algorithms
References in corpus (15)
- Quantum information with Rydberg atoms
- Many-Body Physics with Individually-Controlled Rydberg Atoms
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
- Synthetic three-dimensional atomic structures assembled atom by atom
- Quantum simulation and computing with Rydberg-interacting qubits
- An Optical Tweezer Array of Ultracold Molecules
- In situ single-atom array synthesis by dynamic holographic optical tweezers
- Enhanced atom-by-atom assembly of arbitrary tweezers arrays
- Defect-free arbitrary-geometry assembly of mixed-species atom arrays
- Defect-free atomic array formation using Hungarian matching algorithm
- Parallel assembly of arbitrary defect-free atom arrays with a multi-tweezer algorithm
- Efficient preparation of 2D defect-free atom arrays with near-fewest sorting-atom moves
- Efficient two-dimensional defect-free dual-species atom arrays rearrangement algorithm with near-fewest atom moves
- Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm