Abstract
Defect-free atom arrays are a precursor for quantum information processing and quantum simulation with neutral atoms. Yet, large-scale defect-free atom arrays can be challenging to realize, due to the losses encountered when rearranging stochastically loaded atoms to achieve a desired target array. Here, we demonstrate a parallel rearrangement algorithm that uses multiple mobile tweezers to independently sort and compress atom arrays in a way that naturally avoids atom collisions. With a high degree of parallelism, our algorithm offers a reduced move complexity compared to both single-tweezer algorithms and existing multitweezer algorithms. We further determine the optimal degree of parallelism to be a balance between an algorithmic speedup and multitweezer inhomogeneity effects. The defect-free probability for a 225-atom array is demonstrated to be as high as 33(1)% in a room-temperature setup after multiple cycles of rearrangement. The algorithm presented here can be implemented for any target array geometry with an underlying periodic structure.
- Received 13 September 2022
- Revised 15 December 2022
- Accepted 19 January 2023
DOI:https://doi.org/10.1103/PhysRevApplied.19.034048
Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
Published by the American Physical Society
Physics Subject Headings (PhySH)
synopsis
A Better Production Line for Atom Arrays
Published 15 March 2023
A new algorithm can organize hundreds of atoms into pristine patterns—including a honeycomb lattice, a fractal called a Sierpiński triangle, and a lion’s head.
See more in Physics