快速组装上万个无缺陷原子阵列的算法,提升量子计算硬件效率
An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays

- 用图神经网络加改进拍卖解码实现高效路径规划
- 新算法每帧势场生成仅需0.5毫秒,快于商用SLM刷新率
- 可实现在原子真空寿命内完成10^4个原子阵列组装
构建实用量子计算机需数万物理量子比特。由光镊形成的原子阵列是实现该目标最具前景的平台之一,因其原子量子比特具备优异可扩展性和移动性。然而,组装约10^4个无缺陷原子阵列在算法上仍具挑战性,且受硬件限制。这源于计算困难的路径规划问题,以及空间光调制器(SLM)生成足够平滑光镊势场所需的时间。本文提出一个统一框架,包含两项创新:(1) 基于图神经网络与改进拍卖解码的路径规划模块;(2) 称为相位和轮廓感知加权Gerchberg-Saxton的势场生成模块。第一模块推理时间几乎为常数级,约5毫秒;第二模块每帧势场生成耗时约0.5毫秒,短于当前商用SLM刷新周期。整体算法使10^4个原子阵列的组装时间远短于原子被捕获的典型真空寿命。
原文摘要 · Abstract (English)
It is widely believed that tens of thousands of physical qubits are needed to build a practically useful quantum computer. Atom arrays formed by optical tweezers are among the most promising platforms for achieving this goal, owing to the excellent scalability and mobility of atomic qubits. However, assembling a defect-free atom array with ~ 10^4 qubits remains algorithmically challenging, alongside other hardware limitations. This is due to the computationally hard path-planning problems and the time-consuming generation of suffciently smooth trajectories for optical tweezer potentials by spatial light modulators (SLM). Here, we present a unified framework comprising two innovative components to fully address these algorithmic challenges: (1) a path-planning module that employs a supervised learning approach using a graph neural network combined with a modified auction decoder, and (2) a potential-generation module called the phase and profile-aware Weighted Gerchberg-Saxton algorithm. The inference time for the first module is nearly a size-independent constant overhead of ~ 5 ms, and the second module generates a potential frame with about 0.5 ms, a timescale shorter than the current commercial SLM refresh time. Altogether, our algorithm enables the assembly of an atom array with 10^4 qubits on a timescale much shorter than the typical vacuum lifetime of the trapped atoms.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。