General circuit mapping algorithm for neutral atom quantum computers

arXiv:2606.20503 · quant-ph · Submitted 2026-06-18 · Read on arXiv

quant-ph

Submitted: 2026-06-18

Updated: 2026-06-18

Terminology

• Entanglement — 23× in this paper · explained in 3 episodes
• Quantum Circuits — 19× in this paper · explained in 2 episodes
• Benchmark — 13× in this paper · explained in 2 episodes
• Fidelity — 13× in this paper · explained in 2 episodes
• Neutral Atom Quantum Computer — 5× in this paper
• Combinatorial Optimization — 3× in this paper · explained in 2 episodes
• Adaptability — 1× in this paper · explained in 1 episode
• Benchmarking — 1× in this paper · explained in 3 episodes
• Directed Acyclic Graph — 1× in this paper
• Generalization — 1× in this paper · explained in 13 episodes
• Munich Quantum Toolkit — 1× in this paper

Sources

• ZAP: Zoned Architecture and Performant Compiler for Field Programmable Atom Array
• A Robust Strontium Tweezer Apparatus for Quantum Computing
• QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity