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.
Reconfigurable arrays of neutral atoms are a leading platform for quantum computing, quantum simulation, and quantum metrology. The most common method for atom reconfiguration using optical tweezers relies on frequency chirping of acousto-optic deflectors (AODs). However, chirp-induced acoustic lensing limits the speed of atom transport by deformation of the tweezer profile and warping of the tweezer trajectory. We use a three-dimensional acousto-optic deflector lens (3D-AODL) to mitigate both effects, a design predicted to halve current state-of-the-art long-range transport times. Additionally, we introduce fading-Shepard waveforms that bypass the finite AOD bandwidth and thus enable sustained axial displacement. We demonstrate unrestricted 3D motion within a cuboid volume of at least 200 μm × 200 μm × 136 μm, with tweezer velocities exceeding 4.2 m/s. The ability to move optical tweezers along arbitrary trajectories in 3D should enable rapid in-plane and out-of-plane rearrangement of atoms in 2D or 3D tweezer arrays and optical lattices, as well as omnidirectional trajectories and dynamical engineering of optical potentials. This technology has the potential to advance quantum control and atom manipulation in current atom-array quantum computers, boosting clock rates and enabling rapid sorting in geometries scalable to millions of qubits.
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.
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.
We propose hardware-efficient schemes for implementing logical H and S gates transversally on rotated surface codes with reconfigurable neutral atom arrays. For logical H gates, we develop a simple strategy to rotate code patches efficiently with two sets of 2D-acousto-optic deflectors (2D-AODs). Our protocol for logical S gates utilizes the time-dynamics of the data and ancilla qubits during syndrome extraction (SE). In particular, we break away from traditional schemes where transversal logical gates take place between two SE rounds and instead embed our fold-transversal logical operation inside a single SE round, leveraging the fact that data and ancilla qubits can be morphed to an unrotated surface code state at half-cycle. Under circuit noise, we observe the performance of our S gate protocol is on par with the quantum memory. Together with transversal logical CNOT gates, our protocols complete a transversal logical Clifford gate set on rotated surface codes and admit efficient implementation on neutral atom array platforms.
We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the
[[127,1,15]] self-dual doubly-even code that has transversal Clifford gates (CNOT, H, S) and the triply-even
[[127,1,7]] code that has transversal T and CNOT gates. We show that code switching between these codes can be accomplished using Steane error correction. For fault-tolerant ancilla preparation we utilize the low-depth hypercube encoding circuit along with different code automorphism permutations in different ancilla blocks, while decoding is handled by the high-performance classical successive cancellation list decoder. In this way, every logical operation in this universal gate set is amenable to extended rectangle analysis. The CNOT exRec has a failure rate approaching
10−9 at
10−3 circuit-level depolarizing noise. Furthermore, we map the PQRM codes to a 2D layout suitable for implementation in arrays of trapped atoms and try to reduce the circuit depth of parallel atom movements in state preparation. The resulting protocol is strictly fault-tolerant for the
[[127,1,7]] code and practically fault-tolerant for the
[[127,1,15]] code. Moreover, each patch requires a permutation consisting of
7 sub-hypercube swaps only. These are swaps of rectangular grids in our 2D hypercube layout and can be naturally created with acousto-optic deflectors (AODs). Lastly, we show for the family of
[[22r,(r2r),2r]] QRM codes that the entire logical Clifford group can be achieved using only permutations, transversal gates, and fold-transversal gates.