"Optimizing Neutral Atom Rearrangement Times using the HiPARS Sorting Library"

Read full text
Authors: Jonas Winklmann, Schulz, Martin
Cited by: 0

Abstract

In order to efficiently scale neutral atom quantum computers towards and above 1000 qubits, sophisticated parallel rearrangement schemes are required. We introduce our library HiPARS: Highly-Parallel Atom Rearrangement Sequencer that generates a move sequence to quickly sort randomly distributed atoms into a predetermined configuration given initial occupancy and parameters about the system. Comparisons with known alternatives show that our approach, while computationally demanding, can offer significant time savings during initialization.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Cold Atom Physics and Bose-Einstein Condensates Parallel Computing and Optimization Techniques

Publication details

Journal / source
Gesellschaft für Informatik (GI)
Publication date
1 January 2026
Language
EN