An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays

• URL: http://arxiv.org/abs/2604.08669v1
• Date: Thu, 09 Apr 2026 18:00:17 GMT
• Title: An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays
• Abstract summary: Atom arrays formed by optical tweezers are among the most promising platforms for achieving this goal.<n>We present a unified framework comprising two innovative components to fully address these algorithmic challenges.<n>Our algorithm enables the assembly of an atom array with 104 qubits on a timescale much shorter than the typical vacuum lifetime of the trapped atoms.
• Score: 6.472028233531588
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is widely believed that tens of thousands of physical qubits are needed to build a practically useful quantum computer. Atom arrays formed by optical tweezers are among the most promising platforms for achieving this goal, owing to the excellent scalability and mobility of atomic qubits. However, assembling a defect-free atom array with ~ 10^4 qubits remains algorithmically challenging, alongside other hardware limitations. This is due to the computationally hard path-planning problems and the time-consuming generation of suffciently smooth trajectories for optical tweezer potentials by spatial light modulators (SLM). Here, we present a unified framework comprising two innovative components to fully address these algorithmic challenges: (1) a path-planning module that employs a supervised learning approach using a graph neural network combined with a modified auction decoder, and (2) a potential-generation module called the phase and profile-aware Weighted Gerchberg-Saxton algorithm. The inference time for the first module is nearly a size-independent constant overhead of ~ 5 ms, and the second module generates a potential frame with about 0.5 ms, a timescale shorter than the current commercial SLM refresh time. Altogether, our algorithm enables the assembly of an atom array with 10^4 qubits on a timescale much shorter than the typical vacuum lifetime of the trapped atoms.

Related papers

• Ultrafast and high resolution spatial light modulation for cold atoms [70.8440518934986]
  We develop and numerically validate a scheme for fully programmable Hubbard models, with time-dependent control over local chemical potentials, tunneling amplitudes, on-site interactions, and patterns of artificial magnetic flux.<n>The same architecture performs fast, arbitrary permutations of tweezers in 2D, decoupling optical constraints from the design of high-rate error-correcting codes.
  arXiv  Detail & Related papers  (2026-08-18T17:56:25Z)
• Fast Nondestructive Readout for High-Clock-Rate Atom Array Quantum Processor [16.271131349428597]
  Neutral-atom arrays have rapidly advanced to support thousands of qubits and execute high-fidelity logical operations.<n>Nondestructive qubit measurement requires milliseconds and limits the system's clock rate.<n>Here, we overcome these limitations with a fast, nondestructive readout architecture based on real-time, site-resolved adaptive protection.
  arXiv  Detail & Related papers  (2026-08-17T22:58:16Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• A cryogenic neutral-atom platform with full optical access and 2-hour trap lifetime [2.795782132371116]
  We report on the operation of a novel, cryogenically enhanced, neutral-atom apparatus.<n>We demonstrate vacuum-limited trapping lifetimes of up to two hours of single $88mathrmSr$ atoms in an optical tweezer array.<n>Our measurements show that exceptionally long single-atom lifetimes can be achieved with a relatively simple cryostat design.
  arXiv  Detail & Related papers  (2026-07-14T17:35:30Z)
• AtomFlow: An End-to-End FPGA-Based Control Architecture for Neutral Atom Quantum Computers [1.8339320861642727]
  AtomFlow consolidates fluorescence-image analysis and a newly developed atom-rearrangement algorithm onto a single Zynq UltraScale+ device.<n>AtomFlow achieves an end-to-end latency of 25.3 ms with a first-move latency of 4 ms and an average move generation of 1 ms.
  arXiv  Detail & Related papers  (2026-07-13T12:46:46Z)
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays [38.6948808036416]
  We present a low-overhead architecture that supports the layout and resource estimation of large-scale fault-tolerant quantum algorithms.<n>We find that a 2048-bit RSA factoring can be executed with 19 million qubits in 5.6 days, for 1 ms QEC cycle times.
  arXiv  Detail & Related papers  (2025-05-21T18:00:18Z)
• AI-Enabled Rapid Assembly of Thousands of Defect-Free Neutral Atom Arrays with Constant-time-overhead [35.63698604955473]
  We propose an AI-enabled, rapid, constant-time-overhead rearrangement protocol.<n>We experimentally assemble defect-free 2D and 3D atom arrays with up to 2024 atoms with a constant time cost of 60 ms.
  arXiv  Detail & Related papers  (2024-12-19T08:56:28Z)
• Arctic: A Field Programmable Quantum Array Scheduling Technique [0.0]
  I present the first compiler pass designed to optimize reconfigurable coupling in zoned neutral atom architectures. I approach qubit mapping and movement scheduling as a max-cut and layered cross-minimization problem. I compare the method across various algorithms sourced from Supermarq and Qasmbench.
  arXiv  Detail & Related papers  (2024-05-10T01:56:01Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm [35.300779480388705]
  atom reconfiguration problems require solving an atom problem quickly and efficiently.<n>A typical approach to solve atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps.<n>This approach does not optimize for the number of displaced atoms or the number of times each atom is displaced.<n>We propose the assignment-rerouting-ordering (aro) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems.
  arXiv  Detail & Related papers  (2022-12-11T19:48:25Z)
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm [35.300779480388705]
  Red-rec exploits simples and exact subroutines to solve atom reconfiguration problems on grids.<n>Red-rec enables assembling large configurations of atoms with high mean success probability.
  arXiv  Detail & Related papers  (2022-12-07T19:00:01Z)
• Parallel compression algorithm for fast preparation of defect-free atom arrays [2.9592586928462308]
  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.
  arXiv  Detail & Related papers  (2022-12-06T15:20:40Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.