AI 中文总结
该研究提出基于单个AOD对的原子阵列几何重排基元，通过分解实现对数缩放的AOD行程数，提升量子纠错基元的运动效率。
AI 中文摘要
中性原子量子计算机借助原子输运实现任意连通性，部分逻辑操作可简化或完全归为原子的几何重排，因此最小化这类运动的时长对实现高逻辑吞吐量至关重要。我们提出新的基元，利用单个动态交叉声光偏转器（AOD）对的扫描，在静态晶格中实现二维原子阵列的剪切、旋转和反射。通过（负）二进制与几何分解，我们实现了AOD行程数随阵列线性尺寸呈对数缩放。在一个实例中，我们采用Paeth分解，为距离为d的旋转表面码中的横向Hadamard门实现90°旋转，仅需3⌊log₂(d-1)⌋ + 4次AOD行程，时间复杂度为O(d^(1/3))的恒定加加速度，而逐原子重排则需要O(d²)次行程和O(d^(7/3))的时间。
英文摘要
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.
Commentsauthor contributions and LLM use disclosure, corresponding authors
