Neutral-atom quantum computers store quantum information in atoms confined by optical traps. Unlike superconducting architectures, neutral-atom platforms can shuttle atoms across the processor using acousto-optic deflector (AOD) movable traps to shuttle atoms before gate execution. When compiling quantum circuits for neutral-atom devices, minimizing the number of AOD traps activations is crucial, since each activation increases the physical overhead of the computation. We introduce a matrix-based optimization problem that models the AOD traps activation scheme and prove that finding an optimal solution is an NP-hard problem. As a consequence, determining the minimum number of AOD activations required to shuttle a given set of atoms is also NP-hard. To solve practical instances of the problem, we encode it as an Answer Set Programming problem and evaluate the proposed approach experimentally on a set of benchmark instances. We further establish a correspondence between our formulation and Boolean Matrix Factorization (BMF), which opens the way to reusing existing BMF techniques for computing AOD activation schemes.
Neutral-atom quantum computers store quantum information in atoms confined by optical traps. Unlike superconducting architectures, neutral-atom platforms can shuttle atoms across the processor using acousto-optic deflector (AOD) movable traps to shuttle atoms before gate execution. When compiling quantum circuits for neutral-atom devices, minimizing the number of AOD traps activations is crucial, since each activation increases the physical overhead of the computation. We introduce a matrix-based optimization problem that models the AOD traps activation scheme and prove that finding an optimal solution is an NP-hard problem. As a consequence, determining the minimum number of AOD activations required to shuttle a given set of atoms is also NP-hard. To solve practical instances of the problem, we encode it as an Answer Set Programming problem and evaluate the proposed approach experimentally on a set of benchmark instances. We further establish a correspondence between our formulation and Boolean Matrix Factorization (BMF), which opens the way to reusing existing BMF techniques for computing AOD activation schemes.
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 (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.
Neutral atom quantum computers (NAQCs) are emerging as a highly promising platform for scalable quantum computing, thanks to their long qubit coherence times, flexible qubit layouts, and ability to implement multi-qubit gates [1]. Despite these advantages,executing circuits often requires moving qubits physically, which makes compilation a crucial and challenging optimization task. To address this, we developed a circuit-independent compiler framework based on graph theory that determines the minimum number of qubit transfers needed, including those involved in multi-qubit gates. This model captures the spatial restrictions inherent to NAQC platforms with zone-limited gate operations. Using this framework, we formulated the qubit mapping problem as a nonlinear integer program and solved it with a genetic algorithm, enabling control over trade-offs between the total distance qubits travel and the number of parallel transfer operations (PTOs). When benchmarked against the leading ZAC compiler [2], our approach consistently reduces the number of qubit transfers. Depending on the optimization goal, it can either shorten the overall travel distance or minimize PTOs. The work presented in this poster thus provides a tool for efficient, architecture-aware quantum circuit compilation. [1] Ludwig Schmid et al, “Computational capabilities and compiler development for neutral atom quantum processors—connecting tool developers and hardware experts”, Quantum Sci. Technol. 9 033001, doi: 10.1088/2058-9565/ad33ac (2024) [2] W. Lin, D. B. Tan and J. Cong, “Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms”, IEEE International Symposium on High Performance Computer Architecture (HPCA), Las Vegas, NV, USA, 2025, pp. 127-142, doi: 10.1109/HPCA61900.2025.00021 (2025
Compiling arbitrary-connectivity NISQ circuits onto monolithic single-zone neutral-atom devices is constrained by a finite interaction range and a minimum separation between simultaneously addressable sites. Under the minimum-separation constraint, the SWAP-only configuration of our pipeline does not return a schedule within a practical time budget on a range of circuits, including circuits as small as nine qubits. We address this with hub traps, a small number of dynamically placed empty traps that serve as transit waypoints, together with a per-gate rule that chooses between SWAP-based routing and hub-mediated shuttling. We evaluate the compiler on seventeen benchmarks using analytic estimates of execution time and a per-layer fidelity proxy, comparing against a placement-matched baseline and against ablations of our own pipeline. Hub traps make these otherwise-unsolved circuits compile in seconds to minutes and remove SWAP gates entirely on every completed circuit, so their role is to enable routing rather than only to optimize fidelity. The benefit is concentrated on routing-dominated circuits and is absent on routing-free ones, which we separate by the structure of the interaction graph. On the most routing-dominated circuit the fidelity proxy improves by up to three orders of magnitude over the placement-matched baseline. The gain comes primarily from eliminating SWAP overhead, as the absolute fidelities there remain low.
We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems in computer science. Our approach is based on coherent manipulation of atom arrays via the excitation into Rydberg atomic states. Specifically, we show that solutions of MIS problems can be efficiently encoded in the ground state of interacting atoms in 2D arrays by utilizing the Rydberg blockade mechanism. By studying the performance of leading classical algorithms, we identify parameter regimes, where computationally hard instances can be tested using near-term experimental systems. Practical implementations of both quantum annealing and variational quantum optimization algorithms beyond the adiabatic principle are discussed.
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∘ rotation for a transversal Hadamard gate in a rotated surface code of distance d in 3⌊log2(d−1)⌋+4 AOD strokes and O(d1/3) constant-jerk time, against O(d2) strokes and O(d7/3) time for atom-by-atom rearrangement.