用于快速制备无缺陷原子阵列的并行压缩算法
Parallel compression algorithm for fast preparation of defect-free atom arrays
AI总结：
本文提出一种利用多个可移动光镊同时转移原子的并行压缩算法，将无缺陷原子阵列制备的时间成本降至与目标位点数成线性关系，并可直接应用于现有实验装置。
摘要：
无缺陷原子阵列已成为量子科学与技术中强大且多功能的平台，具有高可编程性和良好的可扩展性前景。该阵列可通过将原子从部分装载的初始阵列重新排列到指定目标位点来制备。然而，由于重排过程中的原子损失以及真空限制寿命与阵列尺寸成反比，实现大规模无缺陷阵列面临挑战。能够最小化时间成本和原子损失的高效重排算法对于成功的原子重排至关重要。在此，我们提出一种新颖的并行压缩算法，利用多个可移动光镊同时转移原子。总时间成本可降低到与目标位点数量成线性关系。该算法可方便地在当前实验装置中实现。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
