Accelerating the Assembly of Defect-Free Atomic Arrays with Maximum Parallelisms

Defect-free atomic arrays have been demonstrated as a scalable and fully controllable platform for quantum simulations and quantum computations. To push the qubit size limit of this platform further, we design an integrated measurement and feedback system, based on field-programmable gate array (FPGA), to quickly assemble two-dimensional defect-free atomic array using maximum parallelisms. The total time cost of the rearrangement is first reduced by processing atom detection, atomic occupation analysis, rear-rangement strategy formulation, and acousto-optic deflectors driving signal generation in parallel in time. Then, by simultaneously moving multiple atoms in the same row (column), we save rearrangement time by parallelism in space. To best utilize these parallelisms, we propose an alternative algorithm named the Tetris algorithm to reassemble atoms to arbitrary target array geometry from two-dimensional stochasti-cally loaded atomic arrays. For an L x L target array geometry, the number of moves scales as L, and the total rearrangement time scales at most as L2. Although in this work we do not test on actual atoms, we simulate the performance of our FPGA system experimentally with all components integrated except for the atoms. We present the overall performance for different target geometries, and demonstrate a dramatic boost in rearrangement time cost and the potential to scale up defect-free atomic array to 1000 atoms in room-temperature platform and 10 000 atoms in cryogenic environment.

Automated summary

We design an integrated measurement and feedback system to quickly assemble defect-free atomic arrays using maximum parallelism. By processing atom detection, occupation analysis, strategy formulation, and signal generation in parallel, we reduce the rearrangement time cost. Additionally, we propose an alternative algorithm, the Tetris algorithm, to reassemble atoms to arbitrary target geometries.