Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers

• URL: http://arxiv.org/abs/2604.05317v1
• Date: Tue, 07 Apr 2026 01:37:27 GMT
• Title: Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers
• Abstract summary: This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral-atom systems.<n>Our approach is based on a divide-and-conquer strategy that decomposes an arbitrary reconfiguration problem into at most three one-dimensional shuttling tasks.<n> Numerical simulations on a 632$times$632 atom array demonstrate that the proposed algorithm achieves a grid configuration plan that reduces the total transportation cost to 1/7 of state-of-the-art algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral-atom systems. The algorithm generates a $\mathcal{O}(\sqrt N)$ time plan for $N$ atoms by parallelizing atom transport using a two-dimensional lattice pattern generated by acousto-optic deflectors. Our approach is based on a divide-and-conquer strategy that decomposes an arbitrary reconfiguration problem into at most three one-dimensional shuttling tasks, enabling each atom to be transported with a total transportation cost of $\mathcal{O}(\sqrt N)$. Using the Gale--Ryser theorem, the proposed algorithm provides a highly reliable solution for arbitrary target geometries. We further introduce a peephole optimization technique that improves reconfiguration efficiency for grid target geometries. Numerical simulations on a 632$\times$632 atom array demonstrate that the proposed algorithm achieves a grid configuration plan that reduces the total transportation cost to 1/7 of state-of-the-art algorithms, while resulting in 32%--35% more atom captures. We believe that our scalability improvement contributes to realizing large-scale quantum computers based on neutral atoms. Our experimental code is available from https://github.com/kotamanegi/sqrt-time-atom-reconfigure.

Related papers

• ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
  Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
  arXiv  Detail & Related papers  (2025-11-20T12:32:35Z)
• Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping [0.0]
  We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping.<n>We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles.
  arXiv  Detail & Related papers  (2025-09-08T23:27:25Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Irrational Complex Rotations Empower Low-bit Optimizers [102.56966165088963]
  We propose a novel state compression algorithm, namely $pi$-Quant, for memory-efficient training.<n>We show that it can reduce the bit-width of parameters to 3.32-bit, achieving a 75% reduction in parameter scale and a 40% decrease in GPU memory usage.
  arXiv  Detail & Related papers  (2025-01-22T14:17:57Z)
• Linearized Wasserstein dimensionality reduction with approximation guarantees [65.16758672591365]
  LOT Wassmap is a computationally feasible algorithm to uncover low-dimensional structures in the Wasserstein space. We show that LOT Wassmap attains correct embeddings and that the quality improves with increased sample size. We also show how LOT Wassmap significantly reduces the computational cost when compared to algorithms that depend on pairwise distance computations.
  arXiv  Detail & Related papers  (2023-02-14T22:12:16Z)
• 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)
• Accelerating the assembly of defect-free atomic arrays with maximum parallelisms [16.079283601909435]
  Defect-free atomic arrays have been demonstrated as a scalable and fully-controllable platform for quantum simulations and quantum computations. We design an integrated measurement and feedback system, based on field programmable gate array (FPGA), to quickly assemble two-dimensional defect-free atomic array. We present the overall performance for different target geometries, and demonstrate a significant reduction in rearrangement time and the potential to scale up defect-free atomic array system to thousands of qubits.
  arXiv  Detail & Related papers  (2022-10-19T08:11:01Z)
• Matching Pursuit Based Scheduling for Over-the-Air Federated Learning [67.59503935237676]
  This paper develops a class of low-complexity device scheduling algorithms for over-the-air learning via the method of federated learning. Compared to the state-of-the-art proposed scheme, the proposed scheme poses a drastically lower efficiency system. The efficiency of the proposed scheme is confirmed via experiments on the CIFAR dataset.
  arXiv  Detail & Related papers  (2022-06-14T08:14:14Z)
• Minimax Optimization with Smooth Algorithmic Adversaries [59.47122537182611]
  We propose a new algorithm for the min-player against smooth algorithms deployed by an adversary. Our algorithm is guaranteed to make monotonic progress having no limit cycles, and to find an appropriate number of gradient ascents.
  arXiv  Detail & Related papers  (2021-06-02T22:03:36Z)

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.