aiqbench analysis
This research presents a significant efficiency gain for neutral-atom quantum computers by reducing the time required to rearrange atoms during logical operations. By utilizing geometric decompositions with a single acousto-optic deflector, the team achieves logarithmic scaling in movement strokes compared to quadratic scaling in traditional methods. This advancement directly addresses critical bottlenecks in achieving high logical throughput for error-corrected quantum circuits.
Efficient atom rearrangements for quantum error correction primitives with a single AOD
arXiv:2607.28149v1 Announce Type: new Abstract: Neutral-atom quantum computers offer arbitrary connectivity enabled by atom transport. Some logical operations can then be simplified or reduced entirely to geometric rearrangements of the atoms. Minimizing the duration of these movements is therefore essential for high logical throughput. We introduce new primitives to shear, rotate and reflect 2D arrays of atoms in a static lattice using sweeps of a single dynamic crossed acousto-optic deflector (AOD) pair. Using (nega-)binary and geometric decompositions, we achieve an AOD stroke count scaling logarithmically in the linear size of the array. In one example, we use the Paeth decomposition to implement a $90^{\circ}$ rotation for a transversal Hadamard gate in a rotated surface code of distance $d$ in $3\lfloor\log_2(d-1)\rfloor + 4$ AOD strokes and $O(d^{1/3})$ constant-jerk time, against $O(d^2)$ strokes and $O(d^{7/3})$ time for atom-by-atom rearrangement.
Abstract:Neutral-atom quantum computers offer arbitrary connectivity enabled by atom transport. Some logical operations can then be simplified or reduced entirely to geometric rearrangements of the atoms. Minimizing the duration of these movements is therefore essential for high logical throughput. We introduce new primitives to shear, rotate and reflect 2D arrays of atoms in a static lattice using sweeps of a single dynamic crossed acousto-optic deflector (AOD) pair. Using (nega-)binary and geometric decompositions, we achieve an AOD stroke count scaling logarithmically in the linear size of the array. In one example, we use the Paeth decomposition to implement a $90^{\circ}$ rotation for a transversal Hadamard gate in a rotated surface code of distance $d$ in $3\lfloor\log_2(d-1)\rfloor + 4$ AOD strokes and $O(d^{1/3})$ constant-jerk time, against $O(d^2)$ strokes and $O(d^{7/3})$ time for atom-by-atom rearrangement.
arXiv:2607.28149 [quant-ph]
(or arXiv:2607.28149v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.28149 arXiv-issued DOI via DataCite (pending registration)
Full text under the publisher's open licence · 147 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

Photons for Reach, Atoms for Entanglement: A Compound Photon-Atom Blueprint for Fault-Tolerant Quantum Computing
The Quantum Insider · Aug 6, 2026

What is Quantum Error Correction? Complete 2026 Beginner’s Guide
Quantum Zeitgeist · May 29, 2026

News
Quantum Computing Report · Jul 25, 2026