Search arXivSearch

arXiv · 2504.21234

Realizing Quantum Wireless Sensing Without Extra Reference Sources: Architecture, Algorithm, and Sensitivity Maximization

Abstract

Rydberg Atomic REceivers (RAREs) have demonstrated remarkable capabilities for radio-frequency signal measurement, enabling advanced quantum wireless sensing. Existing RARE-based sensing systems popularly adopt the heterodyne detection methodology, which requires an additional reference source to serve as an atomic mixer. However, this approach entails a bulky transceiver architecture and is limited in the supportable sensing bandwidth. To address these limitations, we propose a self-heterodyne sensing paradigm where the transmitter's self-interference naturally provides the reference signal. We demonstrate that a self-heterodyne RARE functions as an atomic autocorrelator, eliminating the need for external reference sources while supporting substantially wider bandwidth than conventional heterodyne methods. Next, a two-stage algorithm is devised to perform target ranging in self-heterodyne RARE systems. This algorithm is shown to closely approach the Cramer-Rao lower bound. Furthermore, we introduce the power-trajectory ($P$-trajectory) design for RAREs, which maximizes the sensing sensitivity through time-varying transmission power control. An internal noise (ITN)-limited $P$-trajectory is developed to capture the profile of the asymptotically optimal time-varying power in the presence of ITN only. This design is then extended to the practical $P$-trajectory by incorporating both the ITN and external noise. Numerical results validate that the proposed self-heterodyne sensing can achieve a $\sim$100 MHz-level bandwidth with high sensitivity, substantially surpassing existing heterodyne counterparts and paving the way for high-resolution quantum wireless sensing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mingyao Cui, Qunsong Zeng, Zhanwei Wang, Kaibin Huang. 2025-11-25. Realizing Quantum Wireless Sensing Without Extra Reference Sources: Architecture, Algorithm, and Sensitivity Maximization. https://arxiv.org/abs/2504.21234

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

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT