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

Chinese Optics Letters

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

Yaoting Zhou, Shaoxiong Wang, Jiayi Chen, Yifei Hu, Zhongxiao Xu, Heng Shen

Published Jan 1, 2023• 2 citations
Publisher

Abstract

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.

DOI
10.3788/col202321.110010

Related papers

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 Fast Rearrangement Method for Defect-Free Atom Arrays

Yuqing Zhang, Zeyan Zhang, Guoqing Zhang +7 more

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.

Photonics•Jan 28, 2025•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

ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss

Otto Savola, Alexandru Paler

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 $W \times W$ lattice into a defect-free $L \times L$ 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 $W=10$--$100$, loading probabilities $p_{\mathrm{occ}}=0.5$--$0.9$, and loss rates $p_{\mathrm{loss}}=0$--$0.05$ demonstrate fill rates above $99\%$ within six iterations and over $90\%$ atom retention at low loss. The algorithm achieves sublinear move scaling ($\propto M^{0.55}$) and linear growth of required initial size with target dimension, outperforming prior methods in robustness and scalability -- offering a practical path toward larger neutral-atom quantum arrays.

quant-pharXiv:2511.16303•Nov 21, 2025•0 citations

An FPGA-Accelerated Atom Sorting Unit for Neutral Atom Quantum Computers

Xiaorang Guo, Jonas Winklmann, Dirk Stober +2 more

Neutral atoms have been proven to be a promising physical platform for quantum computing because of their longer coherence time and good scalability. To operate neutral-atom quantum computers, an essential step before computation is to assemble the atoms as a defect-free array. This process is called atom rearrangement or atom sorting, which typically requires a long analysis time on classical computers. To optimize the sorting process, we propose a hardware-friendly sorting algorithm (oriented for FPGA acceleration) to be able to analyze the atom array with four independent quadrants and process each quadrant in parallel. Tested on a Xilinx ZCU216 FPGA, our design can finish the sorting analysis procedure with a 50$\times 50$loaded atoms array with around 1.0$\mu s$. Compared to the CPU implementation, we achieved an acceleration of around$50\times$speedup in algorithm analysis time. In addition, the design exhibits good scalability in execution time, making it suitable for large-scale quantum systems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

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
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.
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.
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 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.
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 W×WW \times WW×W lattice into a defect-free L×LL \times LL×L 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 W=10W=10W=10--100100100, loading probabilities pocc=0.5p_{\mathrm{occ}}=0.5pocc​=0.5--0.90.90.9, and loss rates ploss=0p_{\mathrm{loss}}=0ploss​=0--0.050.050.05 demonstrate fill rates above 99%99\%99% within six iterations and over 90%90\%90% atom retention at low loss. The algorithm achieves sublinear move scaling (∝M0.55\propto M^{0.55}∝M0.55) and linear growth of required initial size with target dimension, outperforming prior methods in robustness and scalability -- offering a practical path toward larger neutral-atom quantum arrays.
Neutral atoms have been proven to be a promising physical platform for quantum computing because of their longer coherence time and good scalability. To operate neutral-atom quantum computers, an essential step before computation is to assemble the atoms as a defect-free array. This process is called atom rearrangement or atom sorting, which typically requires a long analysis time on classical computers. To optimize the sorting process, we propose a hardware-friendly sorting algorithm (oriented for FPGA acceleration) to be able to analyze the atom array with four independent quadrants and process each quadrant in parallel. Tested on a Xilinx ZCU216 FPGA, our design can finish the sorting analysis procedure with a 50×50\times 50×50loaded atoms array with around 1.0μs\mu sμs. Compared to the CPU implementation, we achieved an acceleration of around50×50\times50×speedup in algorithm analysis time. In addition, the design exhibits good scalability in execution time, making it suitable for large-scale quantum systems.
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.