论文标题
平行压缩算法，用于快速制备无缺陷原子阵列
Parallel compression algorithm for fast preparation of defect-free atom arrays
论文作者
论文摘要
无缺陷原子阵列已成为量子科学和技术的功能强大且通用的平台，提供了高的可编程性和有希望的可伸缩性。可以通过从部分加载的初始阵列重新安排原子到指定目标位点来制备阵列。然而，由于重排期间的原子损失以及与阵列大小成反比的真空限制寿命，因此实现大型无缺陷阵列会带来挑战。最小化时间成本和原子损失的有效重排算法对于成功的原子重排至关重要。在这里，我们提出了一种新型的平行压缩算法，该算法利用多个移动镊子同时转移原子。总时间成本可以随着目标站点的数量而线性地缩小。该算法可以在当前的实验设置中很容易实现。
Defect-free atom arrays have emerged as a powerful and versatile platform for quantum sciences and technologies, offering high programmability and promising scalability. The arrays can be prepared by rearranging atoms from a partially loaded initial array to the designated target sites. However, achieving large defect-free arrays presents challenges due to atom loss during rearrangement and the vacuum-limited lifetime which is inversely proportional to the array size. Efficient rearrangement algorithms which minimize time cost and atom loss are crucial for successful atom rearrangement. Here we propose a novel parallel compression algorithm which leverages multiple mobile tweezers to transfer atoms simultaneously. The total time cost could be reduced to scale linearly with the number of target sites. This algorithm can be readily implemented in current experimental setups.
