Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2502.08511

Help | Advanced Search

Quantum Physics

arXiv:2502.08511 (quant-ph)
[Submitted on 12 Feb 2025 (v1) , last revised 3 Sep 2025 (this version, v3)]

Title: Fast, accurate, and predictive method for atom detection in site-resolved images of microtrap arrays

Title: 快速、准确且具有预测性的微陷阱阵列位点分辨图像中的原子检测方法

Authors:Marc Cheneau, Romaric Journet, Matthieu Boffety, François Goudail, Caroline Kulcsár, Pauline Trouvé-Peloux
Abstract: We introduce a new method, rooted in estimation theory, to detect individual atoms in site-resolved images of microtrap arrays, such as optical lattices or optical tweezers arrays. Using labelled test images, we demonstrate drastic improvement of the detection accuracy compared to the popular method based on Wiener deconvolution when the inter-site distance is comparable to the radius of the point spread function. The runtime of our method scales approximately linearly with the number of sites, and remains well below 100 ms for an array of 100 x 100 sites on a desktop computer. It is therefore fully compatible with a real-time usage. Finally, we propose a rigorous definition for the signal-to-noise ratio of the problem, and show that it can be used as a predictor for the detection error rate. Our work opens the prospect for future experiments with increased array sizes, or reduced inter-site distances.
Abstract: 我们引入一种新的方法,基于估计理论,以在微陷阱阵列的位分辨图像中检测单个原子,例如光晶格或光镊阵列。 使用标记的测试图像,我们展示了与基于维纳去卷积的流行方法相比,当相邻位之间的距离与点扩散函数的半径相当时,检测精度有了显著提高。 我们方法的运行时间大约与位数成线性关系,并且在台式计算机上对100 x 100位的阵列,其运行时间始终低于100毫秒。 因此,该方法完全适用于实时使用。 最后,我们提出了一个问题的信噪比的严格定义,并表明它可以作为检测错误率的预测器。 我们的工作为未来更大阵列尺寸或更小相邻位距离的实验开辟了前景。
Subjects: Quantum Physics (quant-ph) ; Data Analysis, Statistics and Probability (physics.data-an)
Cite as: arXiv:2502.08511 [quant-ph]
  (or arXiv:2502.08511v3 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2502.08511
arXiv-issued DOI via DataCite

Submission history

From: Marc Cheneau [view email]
[v1] Wed, 12 Feb 2025 15:46:11 UTC (894 KB)
[v2] Tue, 25 Feb 2025 13:22:16 UTC (896 KB)
[v3] Wed, 3 Sep 2025 09:15:27 UTC (1,207 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2025-02
Change to browse by:
physics
physics.data-an

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号