Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm

TL;DR

The paper introduces the red-rec algorithm for efficient, real-time atom reconfiguration in optical trap arrays, enabling large-scale atom arrangements with high success rates and analyzing scaling challenges.

Contribution

It presents a novel algorithm combining heuristics and exact methods for fast atom reconfiguration, suitable for large-scale quantum experiments.

Findings

Red-rec achieves high success probability in atom assembly.

Parallel control operations significantly reduce preparation time.

Scaling analysis reveals trap requirements grow as the 3/2 power of atom number.

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.