Coverage Analysis of Rydberg Atom Quantum Receiver Arrays: A Stochastic Geometry Approach

• URL: http://arxiv.org/abs/2605.23214v1
• Date: Fri, 22 May 2026 04:05:13 GMT
• Title: Coverage Analysis of Rydberg Atom Quantum Receiver Arrays: A Stochastic Geometry Approach
• Abstract summary: Rydberg atomic quantum receivers (RAQRs) offer quantum-limited sensitivity and broadband tunability.<n>In dense deployments, aggregate interference can push atomic transducer out of its small-signal regime.<n>This paper addresses the question by embedding the RAQR front end into a geometry coverage analysis.
• Score: 55.47164192369501
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rydberg atomic quantum receivers (RAQRs) offer quantum-limited sensitivity and broadband tunability. It is not obvious whether this device-level advantage also improves network reliability, since in dense deployments, aggregate interference can push the atomic transducer out of its small-signal regime. This paper addresses the question by embedding the RAQR front end into a stochastic geometry (SG) coverage analysis. Starting with the atomic master equation and balanced coherent optical detection, we derive a third-order complex baseband model that retains both the linear gain and the leading cubic nonlinearity. A Bussgang decomposition converts the per-element nonlinear response into an equivalent linear gain plus a distance-dependent distortion noise. Using this equivalent model, we derive the post maximal-ratio combining (MRC) SINR and obtain tractable expressions for the conditional and spatially averaged coverage probabilities. The analytical results show that RAQRs outperform conventional receivers in sparse deployments. However, when the base station (BS) density becomes large, nonlinear distortion reduces this advantage and may make RAQRs perform worse. Simulation results validate the analytical expressions and confirm that the central design tradeoff is between linear gain and cubic nonlinearity.

Related papers

• Multi-Source Complex Network Reconstruction via Wasserstein Distributionally Robust Optimization and Algorithm Unrolling [9.526111877241602]
  We propose MS-WDRO, a graph learning framework that fuses heterogeneous sources via their weighted Wasserstein barycenter.<n>Minimizing worst-case risk yields a tractable regularized Laplacian estimator solved efficiently via a provably convergent ADMM scheme.<n>MS-WDRO consistently outperforms seven baselines in graph recovery, sample efficiency, and downstream diagnostic utility.
  arXiv  Detail & Related papers  (2026-08-20T11:30:59Z)
• Invariant Stochastic Filtering on SE(3) for Inertial-Encoder State Estimation of Serial Rigid Manipulators [0.0]
  An invariant extended Kalman filter (IEKF) is developed for state estimation of serial rigid manipulators.<n>The Riccati equation governs the true error covariance rather than a local approximation.<n>A physically separated noise model treats gyroscope and accelerometer channels independently.
  arXiv  Detail & Related papers  (2026-06-21T08:11:39Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• Leveraging Kernel Symmetry for Joint Compression and Error Mitigation in Edge Model Transfer [3.231396702901076]
  This paper investigates communication-efficient neural network transmission by exploiting structured symmetry constraints in convolutional kernels.<n>Instead of transmitting all model parameters, we propose a degrees-of-freedom (DoF) based that sends only the unique coefficients implied by a chosen symmetry group.
  arXiv  Detail & Related papers  (2026-04-19T10:55:04Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Beyond Additivity: Sparse Isotonic Shapley Regression toward Nonlinear Explainability [0.0]
  We introduce Sparse Isotonic Shapley Regression (SISR), a unified nonlinear explanation framework.<n>SISR learns a monotonic transformation to restore additivity--obviating the need for a closed-form specification--and enforces an L0 sparsity constraint on the Shapley vector.<n>SISR stabilizes attributions across payoff schemes, correctly filters irrelevant features while standard Shapley values suffer severe rank and sign distortions.
  arXiv  Detail & Related papers  (2025-12-02T08:34:43Z)
• Structural Properties, Cycloid Trajectories and Non-Asymptotic Guarantees of EM Algorithm for Mixed Linear Regression [11.223656960922478]
  This work investigates the structural properties, cycloid trajectories, and non-asymptotic convergence guarantees of the Expectation-Maximization algorithm for two-component Mixed Linear Regression (2MLR)<n>Recent studies have established global convergence for 2MLR with known balanced weights and super-linear convergence in noiseless and high signal-to-noise ratio (SNR) regimes.
  arXiv  Detail & Related papers  (2025-11-07T02:34:14Z)
• Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent [25.846262685970164]
  This paper proposes and analyzes a gradient-type algorithm based on Burer-Monteiro factorization.<n>It reconstructs the point set configuration from partial Euclidean distance measurements.
  arXiv  Detail & Related papers  (2025-04-28T07:13:23Z)
• Rydberg Atomic Quantum Receivers for Multi-Target DOA Estimation [77.32323151235285]
  Rydberg atomic quantum receivers (RAQRs) have emerged as a promising solution to classical wireless communication and sensing.<n>We first conceive a Rydberg atomic quantum uniform linear array (RAQ-ULA) aided wireless receiver for multi-target DOA detection and propose the corresponding signal model of this sensing system.<n>To solve this sensor gain mismatch problem, we propose the Rydberg atomic quantum ESPRIT (RAQ-ESPRIT) relying on our model.
  arXiv  Detail & Related papers  (2025-01-06T07:42:23Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.