Efficient atom rearrangements for quantum error correction primitives with a single AOD
Tom Hartweg, Asier Piñeiro Orioli, Hugo Perrin, Samuel Crew
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 rotation for a transversal Hadamard gate in a rotated surface code of distance d in 32(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.
Create a lesson
Related papers
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
Optimal spectrum estimation
Ainesh Bakshi, Apoorv Vikram Singh, Xinyu Tan
Non-Abelian sheaf quantum LDPC codes: good and magical
Zimu Li, Fuchuan Wei, Zhengyi Han et al.
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Sharp universal death of entanglement threshold for Pauli Hamiltonians
Bobak T. Kiani
Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
Constantin Cedillo Vayson de Pradenne, Jordan Cotler