Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.02521

Detection of photon-level signals embedded in sunlight with an atomic photodetector

Laura Zarraoa·Tomas Lamich·Sondos Elsehimy·Morgan W. Mitchell·Romain Veyron
View original source ↗Read source document ↗Export metadata ↓

Abstract

The detection of few-photon signals in a broadband background is an extreme challenge for photon counting, requiring filtering that accepts a narrow range of optical frequencies while strongly rejecting all others. Recent work [Zarraoa et. al, Phys. Rev. Res. 6, 033338 (2024)] demonstrated that trapped single atoms can act as low dark-count narrow-band photodetectors. Here we show that this ``quantum jump photodetector'' (QJPD) approach can also detect photon-level signals embedded in strong sunlight. Using a single rubidium atom as a QJPD, we count arrivals of individual narrow-band laser photons embedded in sunlight powers of order $10^{10}$ photons/s. We derive a rate-equation model for the atom's internal-state dynamics in sunlight, and find quantitative agreement with experiment. Using this model, we calculate the channel capacity over a noisy communication channel when sending weak coherent states and detecting them in the presence of sunlight, achieving a representative rate of 0.5 bits per symbol when sending 150 probe photons per 10 ms time-bin, embedded in 1 nW of sunlight (of order $10^{10}$ photons/s in the visible and near-infrared bands). The demonstration may benefit background-limited applications such as daytime light detection and ranging (LIDAR), remote magnetometry, and free-space classical and quantum optical communications.

Explore related subjects

quant-phphysics.atom-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laura Zarraoa, Tomas Lamich, Sondos Elsehimy, Morgan W. Mitchell, Romain Veyron. 2026-03-03. Detection of photon-level signals embedded in sunlight with an atomic photodetector. https://doi.org/10.1116/5.0314886

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quantum Mechanics as a Reversible Diffusion Theory

This paper proposes an interpretation of quantum mechanics, relying on the time-symmetric stochastic dynamics of quantum particles and on non-classical probability theory. Our main purpose is to demonstrate that the wave function and its complex conjugate can be interpreted as complex probability distributions in two complex diffusion equations related to non-real forward and backward in time stochastic motions respectively. We say non-real because Schroedinger forward and backward diffusions describe both reversible (real trajectories) and irreversible trajectories (non-real trajectories). The reversible trajectories are the only real trajectories and are given by the intersection of those forward and backward processes. It turns out that if we translate this intersection using set-theoretic language, we are led to a reversible diffusion described by Born rule probabilities. This proposal is useful also for explaining more about the role of complex numbers in quantum mechanics that produces this so-called "wave-like" nature of quantum reality. Our perspective also challenges the notion of physical superposition and aims at a derivation of superposition principle not based on the linearity of Schroedinger's equation but relying on pure probability theory. Moreover, it is suggested that, embracing the idea of stochastic processes in quantum theory, explains the reasons for the appearance of classical behavior in large objects, in contrast to the quantum behavior of small ones. In other words, we claim that a combination of a probabilistic and no-ontic view (neither epistemic though) of the wave function with a stochastic hidden-variables approach, may provide some insight into the quantum physical reality and potentially establish the groundwork for a novel interpretation of quantum mechanics.

quant-ph↗
arXiv2026

Flexible Qubit Allocation of Network Resource States

The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a \textit{network core}-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment creates shortcuts and improves robustness and memory savings, while reducing the worst-case hop distance between remote network nodes, when compared to conventional approaches.

quant-ph↗
arXiv2026

Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for many computational methods such as the diagrammatic quantum Monte Carlo, a mathematically rigorous proof of polynomial runtime has been lacking. In this work we first extend the proof techniques developed in previous works for proving the convergence of the cumulant expansion in periodic systems to the non-periodic case. A key equation used to analyze the sum of connected Feynman diagrams, which we call the tree-determinant expansion, reveals an underlying tree structure in the summation. This enables us to design a new randomized algorithm to compute the log-partition function through importance sampling augmented by belief propagation. This approach differs from the traditional method based on Markov chain Monte Carlo, whose efficiency is hard to guarantee, and enables us to obtain a algorithm with provable polynomial runtime.

quant-ph↗