CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 08, 2026

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

arXiv Quantum Archived Apr 08, 2026 ✓ Full text saved

arXiv:2604.05317v1 Announce Type: new 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 tas

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 7 Apr 2026] Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers Koki Aoyama, Takafumi Tomita, Fumihiko Ino 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\times632 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 this https URL. Comments: 30 pages, 12 figures Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.05317 [quant-ph]   (or arXiv:2604.05317v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.05317 Focus to learn more Submission history From: Koki Aoyama [view email] [v1] Tue, 7 Apr 2026 01:37:27 UTC (1,777 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 08, 2026
    Archived
    Apr 08, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗