Efficient atom rearrangements for quantum error correction primitives with a single AOD

• URL: http://arxiv.org/abs/2607.28149v1
• Date: Thu, 30 Jul 2026 12:56:01 GMT
• Title: Efficient atom rearrangements for quantum error correction primitives with a single AOD
• Abstract summary: We introduce new primitives to shear, rotate and reflect 2D arrays of atoms in a static lattice.<n>Using (nega-) and geometric decompositions, we achieve an AOD stroke count scaling logarithmically in the linear size of the array.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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.

Related papers

• Lamb Shift of a Static Atom Facing a Rotating Surface [41.99844472131922]
  We study how the Lamb shift of a static atom is modified when a nearby planar body rotates rigidly about its normal.<n>We first illustrate the formalism using a graphene sheet and then apply it to finite-thickness Drude and plasma conductors and to doped semiconductors.
  arXiv  Detail & Related papers  (2026-07-01T21:49:04Z)
• Low-rank Updates in Slowly Time-varying Graphs for Spatial-Temporal Signal Interpolation [36.25340747048208]
  A crucial assumption in graph signal processing (GSP) is the existence of an underlying graph that captures the pairwise similarities between nodes.<n>For spatial-temporal data in which node-to-node similarities evolve over time, a static spatial graph is insufficient.<n>We model the graph changes in two consecutive adjacency matrices $P = W(2) - W(1)$ across time as a low-rank matrix.
  arXiv  Detail & Related papers  (2026-06-22T23:33:33Z)
• Permutation-symmetric quantum trajectories [42.05677589454327]
  We show how one may perform a unraveling which respects weak permutation symmetry for models of $N$ emitters coupled to a common system.<n>For problems involving 2-level emitters, such an unravelling reduces the computational cost from $mathcalO(N5)$ to $mathcalO(N2)$.
  arXiv  Detail & Related papers  (2026-05-11T18:08:08Z)
• Fault-tolerant simulation of the electronic structure using Projector Augmented-Waves and Bloch orbitals [43.936586633107396]
  We present the Bloch--UPAW framework that combines Bloch-orbital $k$-space structure with unitary projector-augmented-wave augmentation.<n>We derive a linear-combination-of-unitaries decomposition and a block-encoding circuit suitable for qubitization.<n>Asymptotically, the Toffoli cost scales as $mathcalO(N_k3)$ when refining the $k$-mesh and as $mathcalO(N_a3.5)$ when enlarging the supercell.
  arXiv  Detail & Related papers  (2026-04-13T23:46:58Z)
• Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers [0.0]
  This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral-atom systems.<n>Our approach is based on a divide-and-conquer strategy that decomposes an arbitrary reconfiguration problem into at most three one-dimensional shuttling tasks.<n> Numerical simulations on a 632$times$632 atom array demonstrate that the proposed algorithm achieves a grid configuration plan that reduces the total transportation cost to 1/7 of state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2026-04-07T01:37:27Z)
• ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
  Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
  arXiv  Detail & Related papers  (2025-11-20T12:32:35Z)
• Parallel assembly of neutral atom arrays with an SLM using linear phase interpolation [36.94429692322632]
  We present fast parallel rearrangement of single atoms in optical tweezers into arbitrary geometries by updating holograms displayed by an ultra fast spatial light modulator.<n>To show the versatility of our method, we sort the same atomic sample into multiple geometries with success of probabilities 0.996(2) per rearrangement cycle.<n>This makes the method a useful tool for rearranging large atom arrays for quantum computation and quantum simulation.
  arXiv  Detail & Related papers  (2025-01-02T18:06:31Z)
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit [3.629687485125086]
  We explore the important task of applying a phase $exp(i,f(x))$ to a computational basis state $left| x right>$.<n>The closely related task of rotating a target qubit by an angle depending on $f(x)$ is also studied.<n>We find that strategies prioritising execution speed can achieve circuit depth as low as $O(logn+logS)$ for a register of $n$ qubits and a piecewise approximation of $S$ sections.
  arXiv  Detail & Related papers  (2024-09-06T19:57:13Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Coherent Control of the Fine-Structure Qubit in a Single Alkaline-Earth Atom [0.7033719572603241]
  Raman coupling of qubit states promises rapid single-qubit rotations on par with the fast Rydberg-mediated two-body gates. We demonstrate preparation, read-out, and coherent control of the qubit. Our work opens the door for a so far unexplored qubit encoding concept for neutral atom based quantum computing.
  arXiv  Detail & Related papers  (2024-01-19T13:22:27Z)
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm [35.300779480388705]
  Red-rec exploits simples and exact subroutines to solve atom reconfiguration problems on grids.<n>Red-rec enables assembling large configurations of atoms with high mean success probability.
  arXiv  Detail & Related papers  (2022-12-07T19:00:01Z)
• Accelerating the assembly of defect-free atomic arrays with maximum parallelisms [16.079283601909435]
  Defect-free atomic arrays have been demonstrated as a scalable and fully-controllable platform for quantum simulations and quantum computations. We design an integrated measurement and feedback system, based on field programmable gate array (FPGA), to quickly assemble two-dimensional defect-free atomic array. We present the overall performance for different target geometries, and demonstrate a significant reduction in rearrangement time and the potential to scale up defect-free atomic array system to thousands of qubits.
  arXiv  Detail & Related papers  (2022-10-19T08:11:01Z)
• Universal gate operations on nuclear spin qubits in an optical tweezer array of $^{171}$Yb atoms [0.7307395485114934]
  We demonstrate a universal set of quantum gate operations on a new type of neutral atom qubit. We present techniques for cooling, trapping and imaging using a newly discovered magic trapping wavelength. Results are a significant step towards highly coherent quantum gates in AEA tweezer arrays.
  arXiv  Detail & Related papers  (2021-12-13T16:58:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.