Efficient two-dimensional defect-free dual-species atom arrays rearrangement algorithm with near-fewest atom moves

TL;DR

This paper introduces a heuristic connectivity optimization algorithm (HCOA) for efficiently rearranging dual-species atom arrays in optical tweezers, achieving near-minimal atom moves with high success rates for large arrays.

Contribution

The paper presents a novel heuristic algorithm that optimizes atom rearrangement paths using graph articulation points, improving efficiency and scalability for dual-species atom arrays.

Findings

Success rate over 97% in array rearrangement

Low ratio of extra atom moves

High scalability and flexibility

Abstract

Dual-species single-atom array in optical tweezers has several advantages over the single-species atom array as a platform for quantum computing and quantum simulation. Thus, creating the defect-free dual-species single-atom array with atom numbers over hundreds is essential. As recent experiments demonstrated, one of the main difficulties lies in designing an efficient algorithm to rearrange the stochastically loaded dual-species atoms arrays into arbitrary demanded configurations. We propose a heuristic connectivity optimization algorithm (HCOA) to provide the near-fewest number of atom moves. Our algorithm introduces the concept of using articulation points in an undirected graph to optimize connectivity as a critical consideration for arranging the atom moving paths. Tested in array size of hundreds atoms and various configurations, our algorithm shows a high success rate (> 97%), low extra atom moves ratio, good scalability, and flexibility. Furthermore, we proposed a complementary step to solve the problem of atom loss during the rearrangement.