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

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.

References in corpus (10)

• Many-Body Physics with Individually-Controlled Rydberg Atoms
• An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
• Quantum computing with neutral atoms
• A dual-element, two-dimensional atom array with continuous-mode operation
• Enhanced atom-by-atom assembly of arbitrary tweezers arrays
• High fidelity entanglement of neutral atoms via a Rydberg-mediated single-modulated-pulse controlled-PHASE gate
• Molecular assembly of ground state cooled single atoms
• Defect-free arbitrary-geometry assembly of mixed-species atom arrays
• A blueprint for fault-tolerant quantum computation with Rydberg atoms
• Efficient preparation of 2D defect-free atom arrays with near-fewest sorting-atom moves

Cited by in corpus (6)

• A hybrid atom tweezer array of nuclear spin and optical clock qubits
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
• Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm
• Analysis of heralded higher-fidelity two-qubit entangling gates with self-correction
• Scalable Heteronuclear Architecture of Neutral Atoms Based on EIT
• Distinct many-body scars and emergent quantum phases driven by competing interactions in two-species Rydberg arrays