论文标题
有效制备2D无缺陷原子阵列，并具有接近最佳的排序原子移动
Efficient preparation of 2D defect-free atom arrays with near-fewest sorting-atom moves
论文作者
论文摘要
通过辅助移动镊子在光学镊子阵列中随机分类原子是一种有效的方法，可以在任意几何形状中准备中间尺度的无缺陷原子阵列。但是，通过不完美的原子传输的冗余分类移动阻碍了原子汇编器的高填充部分，尤其是将系统尺寸缩放到较大的原子数。在这里，我们提出了一种新的排序算法（HCA启发式群集算法，HCA），该算法在我们量身定制的原子组装程序方案中提供接近最佳的动作，并在实验上证明了一个$ 5 \ times6 $的无缺陷原子阵列，其中有98.4（7）$ \％$ $ \％$ $ \％$填充一个重新安排。 HCA的功能表明，移动$ n_ {m} \大约n $（$ n $是要填充的缺陷站点的数量）使填充分数均匀，因为原子汇编器的大小放大。我们的方法对于缩放数百个组装原子以进行自下而上的量子计算，量子模拟和精度测量至关重要。
Sorting atoms stochastically loaded in optical tweezer arrays via an auxiliary mobile tweezer is an efficient approach to preparing intermediate-scale defect-free atom arrays in arbitrary geometries. However, high filling fraction of atom-by-atom assemblers is impeded by redundant sorting moves with imperfect atom transport, especially for scaling the system size to larger atom numbers. Here, we propose a new sorting algorithm (heuristic cluster algorithm, HCA) which provides near-fewest moves in our tailored atom assembler scheme and experimentally demonstrate a $5\times6$ defect-free atom array with 98.4(7)$\%$ filling fraction for one rearrangement cycle. The feature of HCA that the number of moves $N_{m}\approx N$ ($N$ is the number of defect sites to be filled) makes the filling fraction uniform as the size of atom assembler enlarged. Our method is essential to scale hundreds of assembled atoms for bottom-up quantum computation, quantum simulation and precision measurement.
