Efficient algorithms to solve atom reconfiguration problems. I. Redistribution-reconfiguration algorithm
- 4 August 2023
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (2) , 023107
Abstract
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using programmable arrays of 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, in both 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.Keywords
All Related Versions
Funding Information
- Canada First Research Excellence Fund
- Alexander von Humboldt-Stiftung
- Natural Sciences and Engineering Research Council of Canada
This publication has 43 references indexed in Scilit:
- Pebble exchange on graphsDiscrete Applied Mathematics, 2015
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- Near-deterministic preparation of a single atom in an optical microtrapNature Physics, 2010
- Ultracold molecules: vehicles to scalable quantum information processingNew Journal of Physics, 2009
- Reconfigurations in Graphs and GridsSIAM Journal on Discrete Mathematics, 2008
- Quantum information processing with atoms and photonsNature, 2002
- Universal Quantum SimulatorsScience, 1996
- Two special cases of the assignment problemDiscrete Mathematics, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955