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:2011.10390 · Physical Review Research

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

Cheng Sheng, Jiayi Hou, Xiaodong He, Peng Xu, Kunpeng Wang, Jun Zhuang, Xiao Li, Min Liu, Jin Wang, Mingsheng Zhan

Published Apr 2, 2021• 28 citations
arXivHTMLPDF

Abstract

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.
DOI
10.1103/physrevresearch.3.023008

Related papers

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

Zhi-Jin Tao, Li-Geng Yu, Peng Xu +3 more

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.

arXiv:2203.11890•Chinese Physics Letters•Jun 29, 2022•13 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 arbitrary tweezer arrays

Kai-Niklas Schymik, Vincent Lienhard, Daniel Barredo +4 more

The authors describe the capability of an atom-by-atom assembler to create large arrays of neutral atoms and provide an overview of advances that can be realized through several new sorting algorithms, including one that enables the assembly of arbitrary, nonregular target arrays. The performance of the enhanced assembler is then demonstrated experimentally.

arXiv:2011.06827•Physical Review A•Dec 10, 2020•94 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

Towards assembling defect-free arrays of ultracold strontium atoms for quantum simulation

Zeren Lin, Ivaylo S. Madjarov, Alexandre Cooper +7 more

Bulletin of the American Physical Society•Mar 6, 2018•0 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
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.
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 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.
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.