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

arXiv:2203.11890 · Chinese Physics Letters

Efficient Two-Dimensional Defect-Free Dual-Species Atom Arrays Rearrangement Algorithm with Near-Fewest Atom Moves

Zhi-Jin Tao, Li-Geng Yu, Peng Xu, Jiayi Hou, Xiaodong He, Mingsheng Zhan

Published Jun 29, 2022• 13 citations
arXivHTMLPDF

Abstract

Dual-species single-atom array in optical tweezers has several advantages over the single-species atom array as a platform for quantum computing and quantum simulation. Thus, creating the defect-free dual-species single-atom array with atom numbers over hundreds is essential. As recent experiments demonstrated, one of the main difficulties lies in designing an efficient algorithm to rearrange the stochastically loaded dual-species atoms arrays into arbitrary demanded configurations. We propose a heuristic connectivity optimization algorithm to provide the near-fewest number of atom moves. Our algorithm introduces the concept of using articulation points in an undirected graph to optimize connectivity as a critical consideration for arranging the atom moving paths. Tested in array size of hundreds atoms and various configurations, our algorithm shows a high success rate (>97%), low extra atom moves ratio, good scalability, and flexibility. Furthermore, we propose a complementary step to solve the problem of atom loss during the rearrangement.

DOI
10.1088/0256-307x/39/8/083701

Related papers

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

Defect-Free Arbitrary-Geometry Assembly of Mixed-Species Atom Arrays

Cheng Sheng, Jiayi Hou, Xiaodong He +8 more

Optically trapped mixed-species single atom arrays with arbitrary geometry are an attractive and promising platform for various applications, because tunable quantum systems with multiple components provide extra degrees of freedom for experimental control. Here, we report the first demonstration of two-dimensional 6×4 dual-species atom assembly of ^{85}Rb (^{87}Rb) atoms with a filling fraction of 0.88 (0.89). This mixed-species atomic synthesis is achieved via rearranging initially randomly distributed atoms by a sorting algorithm (heuristic heteronuclear algorithm) which is designed for bottom-up atom assembly with both user-defined geometries and two-species atom number ratios. Our fully tunable hybrid-atom systems with scalable advantages are a good starting point for high-fidelity quantum logic, many-body quantum simulation, and single molecule array formation.

arXiv:2106.06144•Physical Review Letters•Feb 24, 2022•75 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

Efficient preparation of two-dimensional defect-free atom arrays with near-fewest sorting-atom moves

Cheng Sheng, Jiayi Hou, Xiaodong He +7 more

The authors propose a rearranging-atom algorithm with near-fewest sorting-atom moves for large-scale atom assemblers and apply to the preparation of defect-free atom arrays in compact configurations experimentally.

arXiv:2011.10390•Physical Review Research•Apr 2, 2021•28 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

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
Dual-species single-atom array in optical tweezers has several advantages over the single-species atom array as a platform for quantum computing and quantum simulation. Thus, creating the defect-free dual-species single-atom array with atom numbers over hundreds is essential. As recent experiments demonstrated, one of the main difficulties lies in designing an efficient algorithm to rearrange the stochastically loaded dual-species atoms arrays into arbitrary demanded configurations. We propose a heuristic connectivity optimization algorithm to provide the near-fewest number of atom moves. Our algorithm introduces the concept of using articulation points in an undirected graph to optimize connectivity as a critical consideration for arranging the atom moving paths. Tested in array size of hundreds atoms and various configurations, our algorithm shows a high success rate (>97%), low extra atom moves ratio, good scalability, and flexibility. Furthermore, we propose a complementary step to solve the problem of atom loss during the 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.
Optically trapped mixed-species single atom arrays with arbitrary geometry are an attractive and promising platform for various applications, because tunable quantum systems with multiple components provide extra degrees of freedom for experimental control. Here, we report the first demonstration of two-dimensional 6×4 dual-species atom assembly of ^{85}Rb (^{87}Rb) atoms with a filling fraction of 0.88 (0.89). This mixed-species atomic synthesis is achieved via rearranging initially randomly distributed atoms by a sorting algorithm (heuristic heteronuclear algorithm) which is designed for bottom-up atom assembly with both user-defined geometries and two-species atom number ratios. Our fully tunable hybrid-atom systems with scalable advantages are a good starting point for high-fidelity quantum logic, many-body quantum simulation, and single molecule array formation.
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.
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.