ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss
Otto Savola, Alexandru Paler

TL;DR
ATLAS is a novel algorithm that efficiently rearranges atoms in optical lattices to create defect-free quantum arrays, accounting for physical constraints and atom loss, thereby enabling scalable neutral-atom quantum computing.
Contribution
The paper introduces ATLAS, an open-source, loss-aware atom transport algorithm that improves scalability and robustness in creating defect-free neutral-atom arrays.
Findings
Achieves over 99% fill rate within six iterations
Maintains over 90% atom retention at low loss rates
Outperforms prior methods in scalability and robustness
Abstract
Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices. Achieving defect-free atom configurations is essential for high-fidelity quantum gates and scalable error correction, yet stochastic loading and atom loss during rearrangement hinder reliable large-scale assembly. This work presents ATLAS, an open-source atom transport algorithm that efficiently converts a randomly loaded lattice into a defect-free subarray while accounting for realistic physical constraints, including finite acceleration, transfer time, and per-move loss probability. In the planning phase, optimal batches of parallel moves are computed on a lossless virtual array; during execution, these moves are replayed under probabilistic atom loss to maximize the expected number of retained atoms. Monte Carlo simulations across lattice sizes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Cold Atom Physics and Bose-Einstein Condensates
