Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
arXiv:2212.03885 · doi:10.1103/PhysRevA.108.023107
Abstract
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration problems on grids. It admits a fast and efficient implementation suitable for real-time operation. We numerically quantify its performance using realistic physical parameters and operational constraints, both in the absence and presence of loss. Red-rec enables assembling large configurations of atoms with high mean success probability. Fast preparation times are achieved by harnessing parallel control operations that actuate multiple traps simultaneously. Faster preparation times are achieved by rejecting configurations of atoms containing fewer atoms than a given threshold. However, the number of traps required to prepare a compact-centered configuration of atoms on a grid with a probability of 0.5 scales as the 3/2 power of the number of desired atoms. This finding highlights some of the challenges associated with scaling up configurations of atoms beyond tens of thousands of atoms.
16 pages, 12 figures, 1 algorithm
References in corpus (15)
- Many-Body Physics with Individually-Controlled Rydberg Atoms
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- Tools for quantum simulation with ultracold atoms in optical lattices
- Controlling many-body dynamics with driven quantum scars in Rydberg atom arrays
- Quantum simulation and computing with Rydberg-interacting qubits
- Ytterbium nuclear-spin qubits in an optical tweezer array
- Enhanced atom-by-atom assembly of arbitrary tweezers arrays
- Single Atoms with 6000-Second Trapping Lifetimes in Optical-Tweezer Arrays at Cryogenic Temperatures
- In-situ equalization of single-atom loading in large-scale optical tweezers arrays
- Parallel assembly of arbitrary defect-free atom arrays with a multi-tweezer algorithm
- Ultracold molecules: vehicles to scalable quantum information processing
- Efficient preparation of 2D defect-free atom arrays with near-fewest sorting-atom moves
- D1 magic wavelength tweezers for scaling atom arrays
- Efficient two-dimensional defect-free dual-species atom arrays rearrangement algorithm with near-fewest atom moves
- Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm