基于匈牙利匹配算法的无缺陷原子阵列形成
Defect-free atomic array formation using Hungarian matching algorithm
摘要:
最近已经证明了将单个原子确定性地加载到任意二维晶格点上,其中通过动态控制光学偶极势,来自概率加载晶格的原子被重新定位到目标晶格点以形成零熵原子晶格。在这种原子重排中,如何将原子与目标位点配对是一个组合优化问题:蛮力方法搜索所有可能的组合,因此过程很慢,而启发式方法具有时间效率,但不能保证最佳解决方案。在这里,我们使用匈牙利匹配算法作为一个快速和严格的替代这个问题的无缺陷的原子晶格形成。我们的方法利用了一个优化的成本函数,限制无碰撞的指导路径,使原子损失由于碰撞在重排过程中最小化。实验是用全息控制的光偶极阱捕获和引导冷铷原子进行的。将原子从部分填充的7 × 7格点迁移到3 × 3目标格点的结果与理论分析非常一致:使用匈牙利算法最小化了碰撞和侵入路径,提高了性能,成功概率比启发式最短移动方法高50%以上.
英文摘要:
Deterministic loading of single atoms onto arbitrary two-dimensional lattice points has recently been demonstrated, where by dynamically controlling the optical-dipole potential, atoms from a probabilistically loaded lattice were relocated to target lattice points to form a zero-entropy atomic lattice. In this atom rearrangement, how to pair atoms with the target sites is a combinatorial optimization problem: brute-force methods search all possible combinations so the process is slow, while heuristic methods are time-efficient but optimal solutions are not guaranteed. Here, we use the Hungarian matching algorithm as a fast and rigorous alternative to this problem of defect-free atomic lattice formation. Our approach utilizes an optimization cost function that restricts collision-free guiding paths so that atom loss due to collision is minimized during rearrangement. Experiments were performed with cold rubidium atoms that were trapped and guided with holographically controlled optical-dipole traps. The result of atom relocation from a partially filled 7-by-7 lattice to a 3-by-3 target lattice strongly agrees with the theoretical analysis: using the Hungarian algorithm minimizes the collisional and trespassing paths and results in improved performance, with over 50\% higher success probability than the heuristic shortest-move method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。