Parallel assembly of arbitrary defect-free atom arrays with a multi-tweezer algorithm

Understand

Defect-free atom arrays are an important precursor for quantum information processing and quantum simulation.

• 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 novel 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 multi-tweezer algorithms.