Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Photonics

A Fast Rearrangement Method for Defect-Free Atom Arrays

Yuqing Zhang, Zeyan Zhang, Guoqing Zhang, Zhehua Zhang, Yanpu Chen, Yuqing Li, Wenliang Liu, Jizhou Wu, V. B. Sovkov, Jie Ma

Published Jan 28, 2025• 1 citation
Publisher

Abstract

Defect-free atom arrays provide new possibilities for exploring exotic quantum phenomena and realizing quantum computing. However, quickly and efficiently preparing defect-free atom arrays poses challenges. This paper proposes an innovative parallel rearrangement method, namely the parallel compression filling algorithm (PCFA), wherein multiple movable optical tweezers operate simultaneously. By limiting the shape of the initial loading, the method reduces movement complexity. The simulation comparisons show that this algorithm is more efficient in preparing defect-free atom arrays and can also be applied to the generation of other periodic structure arrays. The simulation results show that, in most cases, preparing a defect-free array of 400 atoms requires no more than 30 steps.

DOI
10.3390/photonics12020117

Related papers

Parallel compression algorithm for fast preparation of defect-free atom arrays

Shangguo Zhu, Long, Yun, Mingbo Pu +1 more

Defect-free atom arrays have emerged as a powerful and versatile platform for quantum sciences and technologies, offering high programmability and promising scalability. The arrays can be prepared by rearranging atoms from a partially loaded initial array to the designated target sites. However, achieving large defect-free arrays presents challenges due to atom loss during rearrangement and the vacuum-limited lifetime which is inversely proportional to the array size. Efficient rearrangement algorithms which minimize time cost and atom loss are crucial for successful atom rearrangement. Here we propose a novel parallel compression algorithm which leverages multiple mobile tweezers to transfer atoms simultaneously. The total time cost could be reduced to scale linearly with the number of target sites. This algorithm can be readily implemented in current experimental setups.

arXiv:2212.03047•Dec 6, 2022•1 citation

Parallel Assembly of Arbitrary Defect-Free Atom Arrays with a Multitweezer Algorithm

Weikun Tian, Wen Jun Wee, An Qu +4 more

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 225atom 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.

arXiv:2209.08038•Physical Review Applied•Mar 15, 2023•44 citations

Rapid parallel atomic array assembly method via reduced path-planning algorithm

Zhenhua Li, Shangshang Hui, Guotai Zuo +5 more

Precisely controllable, defect-free neutral atom arrays have emerged as an outstanding platform for exploring complex quantum many-body systems and advancing quantum simulation and quantum computing. A method that boosts the rapid and efficient rearrangement is of great significance for expanding the scale of atomic arrays. Here, we present a fast parallel atomic array assembly method based on a PPM algorithm, i.e., position matching, path planning, and move in parallel. By optimizing atom-to-target trajectories using reduced position matching and introducing trajectory correction and target exchange in path planning, the PPM method can effectively minimize movement steps and displacement. The simulation of assembling atoms in parallel into arbitrary geometries shows a reduction of 49% and 35% in steps and displacement compared with the previous parallel algorithm, respectively. Our PPM simulation demonstrates the achievement of a defect-free arrangement of 1,024 atoms in only 35 steps.

Optics Express•Nov 11, 2025•0 citations

A universal algorithm for defect-free atomic array with arbitrary periodic geometries [Invited]

Yaoting Zhou, Shaoxiong Wang, Jiayi Chen +3 more

The defect-free neutral atom array has emerged as an ideal platform to investigate complex many-body physics of interacting quantum particles, offering the opportunities for quantum simulation and quantum-enhanced metrology.To fast build a large-scale quantum system, we design a sorting-atom algorithm with maximum parallelisms.Compared with previous protocols, our method saves the rearrangement time by sorting row-by-row and is also universal to arbitrary periodic patterns with no need to change the hardware.We present the generation of a defect-free square and other periodic geometries and demonstrate the potential to scale up a defect-free array to 2500 atoms with only about 180 steps of rearrangement.

Chinese Optics Letters•Jan 1, 2023•2 citations

Enhanced atom-by-atom assembly of defect-free two-dimensional mixed-species atomic arrays

Ming-rui Wei, Kunpeng Wang, Jiayi Hou +8 more

Defect-free single atom array in optical tweezers is a promising platform for scalable quantum computing, quantum simulation, and quantum metrology. Extending single-species array to mixed-species one promise to offer new possibilities. In our recent proof of principle realization of defect-free two-dimensional assembly of mixed-species $^{85}$Rb ($^{87}$Rb) atom arrays [C. Sheng et al.\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.128.083202}{{\color{blue} Phys. Rev. Lett. 128, 083202(2022)}}], the filling fractions were limited by the imperfect transfer of atoms and the occurrence of logjams during the atom rearrangement. In order to scale up the size of defect-free mixed-species atom array, we scale up the tweezer array and improve the atom transfer, and upgrade the heuristic heteronuclear algorithm so as to facilitate multiple rearrangement cycles. Consequently, we successfully create defect-free atom arrays with 120 mixed-species single atoms. The corresponding filling fraction and defect-free probability are improved to be 98.6(1)\% and 14(2)\%, respectively. It is anticipated that the enhanced algorithm can be extended to other combinations of atomic species, and this mixed-species atom array is readily for studies of many-body physics, quantum error correction, and quantum metrology.

arXiv:2501.02248•Physical Review Applied•Jan 22, 2026•1 citation

Fast, parallel, three-dimensional rearrangement of atom arrays using superpositions of elementary holograms

D. J. Hoare, P. Dunniece, J. Rodewald +2 more

Assembling defect-free arrays of neutral atoms requires real-time rearrangement of stochastically loaded optical tweezers. Conventional rearrangement methods shuttle atoms sequentially, whereas high-speed spatial light modulators (SLMs) can move all atoms in parallel, which scales more favorably as the array size grows. For fast parallel rearrangement, the sequence of holograms displayed on the SLM should be computed more rapidly than the SLM refresh rate, and there should be phase continuity between successive holograms to minimize transient intensity fluctuations. We calculate holograms analytically by adding together the complex fields needed to produce each individual trap, and we ramp the phase of each trap linearly as it moves to its target location. Trap positions enter as continuous variables, rather than tied to points on a grid, so the method provides high positioning accuracy. Using a single GPU, we compute each intermediate hologram in 0.284 ms, considerably faster than the SLM refresh time of 0.696 ms, so the rearrangement speed is hardware-limited. In each step, we use the free processing time to iteratively optimize the holograms for equal intensity across the traps, decreasing trap non-uniformity to 1.24% during rearrangement at no cost in total time. Starting from an array of 256 sites loaded stochastically with $^{87}$Rb atoms, we assemble a 100-atom array in under 20 ms with a rearrangement survival probability of 99.31(12)% per atom. This rearrangement increases the temperature of the atoms by 9(3) $μ$K, which is small compared to the trap depth of 480 $μ$K. Our method can also move individual atoms axially, enabling transport in different planes. We demonstrate this capability with a rearrangement protocol where one set of atoms leapfrogs over another.

physics.atom-phCross-listedarXiv:2610.21609•Oct 16, 2026•0 citations
Defect-free atom arrays provide new possibilities for exploring exotic quantum phenomena and realizing quantum computing. However, quickly and efficiently preparing defect-free atom arrays poses challenges. This paper proposes an innovative parallel rearrangement method, namely the parallel compression filling algorithm (PCFA), wherein multiple movable optical tweezers operate simultaneously. By limiting the shape of the initial loading, the method reduces movement complexity. The simulation comparisons show that this algorithm is more efficient in preparing defect-free atom arrays and can also be applied to the generation of other periodic structure arrays. The simulation results show that, in most cases, preparing a defect-free array of 400 atoms requires no more than 30 steps.
Defect-free atom arrays have emerged as a powerful and versatile platform for quantum sciences and technologies, offering high programmability and promising scalability. The arrays can be prepared by rearranging atoms from a partially loaded initial array to the designated target sites. However, achieving large defect-free arrays presents challenges due to atom loss during rearrangement and the vacuum-limited lifetime which is inversely proportional to the array size. Efficient rearrangement algorithms which minimize time cost and atom loss are crucial for successful atom rearrangement. Here we propose a novel parallel compression algorithm which leverages multiple mobile tweezers to transfer atoms simultaneously. The total time cost could be reduced to scale linearly with the number of target sites. This algorithm can be readily implemented in current experimental setups.
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 225atom 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.
Precisely controllable, defect-free neutral atom arrays have emerged as an outstanding platform for exploring complex quantum many-body systems and advancing quantum simulation and quantum computing. A method that boosts the rapid and efficient rearrangement is of great significance for expanding the scale of atomic arrays. Here, we present a fast parallel atomic array assembly method based on a PPM algorithm, i.e., position matching, path planning, and move in parallel. By optimizing atom-to-target trajectories using reduced position matching and introducing trajectory correction and target exchange in path planning, the PPM method can effectively minimize movement steps and displacement. The simulation of assembling atoms in parallel into arbitrary geometries shows a reduction of 49% and 35% in steps and displacement compared with the previous parallel algorithm, respectively. Our PPM simulation demonstrates the achievement of a defect-free arrangement of 1,024 atoms in only 35 steps.
The defect-free neutral atom array has emerged as an ideal platform to investigate complex many-body physics of interacting quantum particles, offering the opportunities for quantum simulation and quantum-enhanced metrology.To fast build a large-scale quantum system, we design a sorting-atom algorithm with maximum parallelisms.Compared with previous protocols, our method saves the rearrangement time by sorting row-by-row and is also universal to arbitrary periodic patterns with no need to change the hardware.We present the generation of a defect-free square and other periodic geometries and demonstrate the potential to scale up a defect-free array to 2500 atoms with only about 180 steps of rearrangement.
Defect-free single atom array in optical tweezers is a promising platform for scalable quantum computing, quantum simulation, and quantum metrology. Extending single-species array to mixed-species one promise to offer new possibilities. In our recent proof of principle realization of defect-free two-dimensional assembly of mixed-species 85^{85}85Rb (87^{87}87Rb) atom arrays [C. Sheng et al.\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.128.083202}{{\color{blue} Phys. Rev. Lett. 128, 083202(2022)}}], the filling fractions were limited by the imperfect transfer of atoms and the occurrence of logjams during the atom rearrangement. In order to scale up the size of defect-free mixed-species atom array, we scale up the tweezer array and improve the atom transfer, and upgrade the heuristic heteronuclear algorithm so as to facilitate multiple rearrangement cycles. Consequently, we successfully create defect-free atom arrays with 120 mixed-species single atoms. The corresponding filling fraction and defect-free probability are improved to be 98.6(1)\% and 14(2)\%, respectively. It is anticipated that the enhanced algorithm can be extended to other combinations of atomic species, and this mixed-species atom array is readily for studies of many-body physics, quantum error correction, and quantum metrology.
Assembling defect-free arrays of neutral atoms requires real-time rearrangement of stochastically loaded optical tweezers. Conventional rearrangement methods shuttle atoms sequentially, whereas high-speed spatial light modulators (SLMs) can move all atoms in parallel, which scales more favorably as the array size grows. For fast parallel rearrangement, the sequence of holograms displayed on the SLM should be computed more rapidly than the SLM refresh rate, and there should be phase continuity between successive holograms to minimize transient intensity fluctuations. We calculate holograms analytically by adding together the complex fields needed to produce each individual trap, and we ramp the phase of each trap linearly as it moves to its target location. Trap positions enter as continuous variables, rather than tied to points on a grid, so the method provides high positioning accuracy. Using a single GPU, we compute each intermediate hologram in 0.284 ms, considerably faster than the SLM refresh time of 0.696 ms, so the rearrangement speed is hardware-limited. In each step, we use the free processing time to iteratively optimize the holograms for equal intensity across the traps, decreasing trap non-uniformity to 1.24% during rearrangement at no cost in total time. Starting from an array of 256 sites loaded stochastically with 87^{87}87Rb atoms, we assemble a 100-atom array in under 20 ms with a rearrangement survival probability of 99.31(12)% per atom. This rearrangement increases the temperature of the atoms by 9(3) μμμK, which is small compared to the trap depth of 480 μμμK. Our method can also move individual atoms axially, enabling transport in different planes. We demonstrate this capability with a rearrangement protocol where one set of atoms leapfrogs over another.