We present a novel acousto-optic lens (AOL) design for neutral atom quantum computing. This approach enhances atom rearrangement in optical tweezer arrays and addresses the speed limitations imposed by the cylindrical lensing effect of acousto-optic deflectors (AODs). By combining a double-pass AOD configuration for dynamic focal tuning with a standard pair of crossed AODs for transverse beam steering, our design enables the generation of arbitrary focal point trajectories. This configuration enables shuttling of atoms in 3D space, thereby helping to realise fully connected two-qubit gates and mid-circuit measurements. We detail the optical implementation, characterize its performance, and discuss its applications in scalable quantum computing architectures.
Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices. Achieving defect-free atom configurations is essential for high-fidelity quantum gates and scalable error correction, yet stochastic loading and atom loss during rearrangement hinder reliable large-scale assembly. This work presents ATLAS, an open-source atom transport algorithm that efficiently converts a randomly loaded
W×W lattice into a defect-free
L×L subarray while accounting for realistic physical constraints, including finite acceleration, transfer time, and per-move loss probability. In the planning phase, optimal batches of parallel moves are computed on a lossless virtual array; during execution, these moves are replayed under probabilistic atom loss to maximize the expected number of retained atoms. Monte Carlo simulations across lattice sizes
W=10--
100, loading probabilities
pocc=0.5--
0.9, and loss rates
ploss=0--
0.05 demonstrate fill rates above
99% within six iterations and over
90% atom retention at low loss. The algorithm achieves sublinear move scaling (
∝M0.55) and linear growth of required initial size with target dimension, outperforming prior methods in robustness and scalability -- offering a practical path toward larger neutral-atom quantum arrays.
Reconfigurable neutral-atom arrays are a promising platform for quantum computing, quantum simulation, and quantum metrology, but atom transport using frequency-chirped acousto-optic deflectors (AODs) is limited by chirp-induced acoustic lensing and trajectory distortion. We address these limitations using a three-dimensional acousto-optic deflector lens (3D-AODL), a design predicted to reduce long-range transport times by more than a factor of two. We further introduce fading-Shepard waveforms that circumvent finite AOD bandwidth, enabling sustained axial displacement. We demonstrate unrestricted three-dimensional optical-tweezer motion over a 200 μm × 200 μm × 136 μm volume with velocities exceeding 4.2 m/s. Arbitrary three-dimensional control of optical-tweezer trajectories enables rapid atom rearrangement and dynamical engineering of optical potentials in tweezer arrays and optical lattices. This capability advances quantum control and atom manipulation in neutral-atom quantum processors by enabling faster rearrangement, higher clock rates, and scalable sorting in complex geometries.
Achieving useful fault-tolerant applications requires co-designing the quantum error-correcting code for footprint, logical instruction set, and hardware compatibility simultaneously. Recent breakthroughs in ultra-high-rate codes have the potential to reduce footprint of large scale quantum applications but their practical utility is limited without an addressable logical instruction set and efficient implementation on near term hardware. Reconfigurable neutral atom arrays, for example, support only hundreds of qubits with constrained reconfigurability from a few crossed acousto-optic deflectors (AOD). We introduce the GALA codes, or Group-Action Lifts with Active orthogonality, that allows such co-design by construction. GALA lifts over a product group
G=Hk×Cm (or
Hk⋉Cmk); the small non-abelian factor
Hk supplies active orthogonality that improves qubit overhead, reaching 1/2 encoding rate with above-weight distance, while the large abelian factor
Cm supplies symmetries that give code automorphisms and explicit, simple AOD move schedules. Logical addressibility and hardware compatibility follow directly from construction, rather than verified post-hoc. The GALA family contains several known rate-1/2 Kasai codes of Ref.[arXiv:2601.08824, arXiv:2604.16209] while exposing simpler parameter bounds, logical operations, and ZX-dual variants with AOD-compatible fold-transversal Clifford gates. In particular, we find a compact self-dual
[[132,30,12]] with
1.0−0.6+0.9×10−9 per-round per-qubit logical error rate at
10−3 physical error rate, equipped with 3.1 ms syndrome-extraction cycles and an addressable logical instruction set; a ZX-dual, girth-6, rate-1/2
[[672,336,12]] with a 6.76 ms cycles; and barrier-breaking
[[1752,880,14]] and
[[2232,1120,16]] smaller than previously known hardware-compatible rate-1/2 codes.
Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead through high-rate encodings, yet finite-size instances with practical logical error rates often achieve encoding rates only around or below
1/10. Here, building on a recent ultra-high-rate construction by Kasai, we identify new structural conditions on the underlying affine permutation matrices that make encoding rates exceeding
1/2 compatible with efficient implementation on reconfigurable neutral atom arrays. These conditions define a co-designed family of ultra-high-rate quantum codes that supports efficient syndrome extraction and atom rearrangement under realistic parallel control constraints. Using a hierarchical decoder with high accuracy and good throughput, we study the performance under a circuit-level noise model with
p=0.1%, achieving per-logical-per-round error rates of
1.3−0.9+3.0×10−13 with a
[[2304,1156,≤14]] code and
2.9−1.5+3.1×10−11 with a
[[1152,580,≤12]] code. We compare these codes against a heuristic Pareto frontier for finite-blocklength codes relating block length, encoding rate, and logical error rates, and find that our codes lie near the frontier. These results approach the teraquop regime, highlighting the promise of this code family for practical ultra-high-rate quantum error correction.
Efficient quantum error correction and fault-tolerant quantum computing require scalable, high-fidelity long-range connectivity. In neutral-atom quantum computers, this is commonly achieved through atom transport, but shuttling introduces latency and motional heating that worsen with system size. Here, we introduce a neutral-atom architecture based on static atomic buses, in which auxiliary mediator atoms enable long-range entangling operations without qubit transport. The architecture naturally supports long-range stabilizer measurements in high-rate LDPC codes and transversal logical gates between neighboring surface-code patches, enabling a modular framework for efficient logical memories, Clifford computation, and magic-state distillation. To realize these capabilities, we co-design optimal-control protocols for bus-mediated controlled-Z gates that incorporate both microscopic neutral-atom dynamics and architectural constraints. We obtain smooth bus-mediated gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds by combining time-optimal control with interaction-flatness and robustness constraints. Large-scale simulations of quantum error correction and logical entangling operations between neighboring surface-code patches predict more than an order-of-magnitude improvement in logical error rates compared with atom-shuttling architectures under realistic noise. The architecture achieves logical gate times of approximately 100 us and quantum-error-correction cycle times of about 1 ms for code distances d<12. These results establish static atomic buses as a practical alternative to atom shuttling for scalable fault-tolerant neutral-atom quantum computing.