arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.16856quant-phcs.SE
收藏

中性原子量子计算的中性原子检测算法比较

Comparison of Atom Detection Algorithms for Neutral Atom Quantum Computing

Jonas Winklmann, Andrea Alberti, Martin Schulz

AI总结:

本研究比较了中性原子量子计算中多种原子检测算法在精度和运行时间上的表现,发现利用光学系统PSF的全局非线性最小二乘求解器精度最高但计算复杂,而追求速度时简单算法更优。

摘要:

在中性原子量子计算机中,原子量子比特的读出和制备通常基于荧光成像以及对所获图像的后续分析。对于每个原子位点,会估计其亮度或某些可比的指标,并用于预测原子的存在或缺失。在不同的实验装置中,我们可以看到大量不同的方法被用于分析这些图像。通常,检测算法的选择要么根本没有被提及,要么没有给出合理的理由。我们研究了几种不同的算法,并在精度和执行运行时间方面比较了它们的性能。为此,我们依赖一组在不同模拟曝光时间下具有已知占据状态的合成图像。由于使用模拟为我们提供了原子位点占据情况的真实值,我们可以轻松地给出精确的错误率和重建属性的方差。为了排除存在更好算法的可能性,我们计算了 Cramér-Rao 界限,以建立一个即使是完美的估计器也无法超越的上限。作为选择的指标,我们使用了可归因于特定原子位点的光电子数。由于该界限取决于相邻位点的占据情况,我们提供了最佳和最差情况,以及半满的情况。我们的比较表明,在我们测试的算法中,使用光学系统 PSF 返回每个位点光电子数的全局非线性最小二乘求解器表现最好,在较长的曝光时间下平均跨越了最差情况界限。它的主要缺点是计算复杂度巨大,因此需要较长的计算时间。我们设法在一定程度上缓解了这个问题,表明它的使用可能是可行的。然而,我们的研究也表明,在需要极高速度的情况下,简单的算法可能更可取。

英文摘要:

In neutral atom quantum computers, readout and preparation of the atomic qubits are usually based on fluorescence imaging and subsequent analysis of the acquired image. For each atom site, the brightness or some comparable metric is estimated and used to predict the presence or absence of an atom. Across different setups, we can see a vast number of different approaches used to analyze these images. Often, the choice of detection algorithm is either not mentioned at all or it is not justified. We investigate several different algorithms and compare their performance in terms of both precision and execution run time. To do so, we rely on a set of synthetic images across different simulated exposure times with known occupancy states. Since the use of simulation provides us with the ground truth of atom site occupancy, we can easily state precise error rates and variances of the reconstructed property. To also rule out the possibility of better algorithms existing, we calculated the Cramér-Rao bound in order to establish an upper limit that even a perfect estimator cannot outperform. As the metric of choice, we used the number of photonelectrons that can be contributed to a specific atom site. Since the bound depends on the occupancy of neighboring sites, we provide the best and worst cases, as well as a half filled one. Our comparison shows that of our tested algorithms, a global non-linear least-squares solver that uses the optical system's PSF to return a each sites' number of photoelectrons performed the best, on average crossing the worst-case bound for longer exposure times. Its main drawback is its huge computational complexity and, thus, required calculation time. We manage to somewhat reduce this problem, suggesting that its use may be viable. However, our study also shows that for cases where utmost speed is required, simple algorithms may be preferable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑