General circuit mapping algorithm for neutral atom quantum computers
Abstract
Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform because of their long qubit coherence, flexible qubit arrangement, and multiqubit gate capabilities. However, circuit execution often requires physically moving qubits, making compilation a critical optimization challenge. We propose a circuit independent mathematical framework built on graph-theoretic combinatorial optimization that determines the minimal number of required qubit transfers. This model captures spatial constraints specific to NAQC platforms with zone-limited gate operations and multi-qubit gates. From this framework, we encode the qubit mapping problem as a nonlinear integer program and solve it using a genetic algorithm, enabling trade-offs between minimizing the total traveled distance and the number of parallel transfer operations. Compared to the state-of-the-art scalable compiler for zoned architectures, our approach consistently finds fewer transfers. Depending on the optimization focus, our method produces shorter traveled distances or fewer parallel transfer operations. This work provides both theoretical guaranties and a practical tool for efficient, architecture-aware quantum circuit compilation. As a result, practitioners can generate hardware-aware mappings that reduce movement-induced errors and better exploit atom transfer parallelism, directly improving execution efficiency on NAQC devices.
Related
- Defect-Aware Parallel Atom Reloading Protocol for Neutral-Atom Quantum Computers
- Quantum computational advantage in random-circuit sampling on IBM superconducting quantum computers
- BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers
- Real-Space Chemistry on Quantum Computers: A Fault-Tolerant Algorithm with Adaptive Grids and Transcorrelated Extension
- Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping
BibTeX
@misc{gentil2026general,
title = {{General circuit mapping algorithm for neutral atom quantum computers}},
author = {Neven Gentil and Rianne S. Lous and Aida Todri-Sanial},
howpublished = {arXiv},
year = {2026},
month = jun,
doi = {10.48550/arxiv.2606.20503},
eprint = {2606.20503},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.20503},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - General circuit mapping algorithm for neutral atom quantum computers
AU - Neven Gentil
AU - Rianne S. Lous
AU - Aida Todri-Sanial
PY - 2026
DA - 2026/06/18
PB - arXiv
DO - 10.48550/arxiv.2606.20503
UR - https://arxiv.org/abs/2606.20503
AB - Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform because of their long qubit coherence, flexible qubit arrangement, and multiqubit gate capabilities. However, circuit execution often requires physically moving qubits, making compilation a critical optimization challenge. We propose a circuit independent mathematical framework built on graph-theoretic combinatorial optimization that determines the minimal number of required qubit transfers. This model captures spatial constraints specific to NAQC platforms with zone-limited gate operations and multi-qubit gates. From this framework, we encode the qubit mapping problem as a nonlinear integer program and solve it using a genetic algorithm, enabling trade-offs between minimizing the total traveled distance and the number of parallel transfer operations. Compared to the state-of-the-art scalable compiler for zoned architectures, our approach consistently finds fewer transfers. Depending on the optimization focus, our method produces shorter traveled distances or fewer parallel transfer operations. This work provides both theoretical guaranties and a practical tool for efficient, architecture-aware quantum circuit compilation. As a result, practitioners can generate hardware-aware mappings that reduce movement-induced errors and better exploit atom transfer parallelism, directly improving execution efficiency on NAQC devices.
ER -