A Risk-Aware Framework for Covert Quantum Communication under Stochastic Channel Uncertainty

• URL: http://arxiv.org/abs/2605.18928v1
• Date: Mon, 18 May 2026 13:38:36 GMT
• Title: A Risk-Aware Framework for Covert Quantum Communication under Stochastic Channel Uncertainty
• Abstract summary: Covert quantum communication (CQC) seeks to hide not only message content but also the existence of communication.<n>We propose a risk-aware optimization framework for CQC uncertain physical-layer conditions.<n>These results move CQC closer to realistic secure quantum networking for free-space, satellite, and low-probability-of-detection applications.
• Score: 39.146761527401424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Covert quantum communication (CQC) seeks to hide not only message content but also the existence of communication. Existing CQC models usually assume deterministic or worst-case channel conditions, which are difficult to justify in realistic free-space optical and quantum links affected by turbulence, fluctuating background radiance, and stochastic detector noise. We propose a stochastic risk-aware optimization framework for CQC under uncertain physical-layer conditions. By modeling transmissivity and background noise as random variables, we express covertness and reliability guarantees through chance constraints with explicit outage budgets $ε_{\text{cov}}$ and $ε_{\text{rel}}$. This recasts CQC design as a risk-calibrated resource-allocation problem balancing throughput, covertness, reliability, and communication privacy. We derive quantile-based reformulations of the outage constraints, characterize feasible operating regions under stochastic uncertainty, and introduce a complementary risk-adjusted utility formulation to expose throughput-risk trade-offs. The analysis reveals that modest relaxations in acceptable covertness-outage risk can yield large throughput gains, while aggressive optimization may break covertness outside sparse-transmission regimes. Monte Carlo results under log-normal fading and stochastic thermal noise show that the framework expands feasible operating regions, improves covert throughput by more than an order of magnitude, and identifies degradation boundaries beyond which covert operation becomes unreliable. These results move CQC closer to realistic secure quantum networking for free-space, satellite, and low-probability-of-detection applications.

Related papers

• Robust Covert Quantum Communication under Bounded Channel Uncertainty [37.58598417573807]
  We study covert quantum communication over compound quantum optical channels with bounded uncertainty in both transmissivity and thermal noise.<n>We develop a robust framework for certifying both covertness and reliability under uncertainty.
  arXiv  Detail & Related papers  (2026-04-13T08:40:14Z)
• Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions [89.52532304099522]
  Federated Learning (FL) enables clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy.<n> gradients and model updates can still leak sensitive information, while malicious servers may mount adversarial attacks such as Byzantine manipulation.<n>These vulnerabilities highlight the need to address differential privacy (DP) and Byzantine robustness within a unified framework.<n>We propose Byz-Clip21-SGD2M, a new algorithm that integrates robust aggregation with double momentum and carefully designed clipping.
  arXiv  Detail & Related papers  (2026-03-24T17:39:09Z)
• Stabilized Maximum-Likelihood Iterative Quantum Amplitude Estimation for Structural CVaR under Correlated Random Fields [0.0]
  Conditional Value-at-Risk (CVaR) is a central tail-risk measure in structural mechanics.<n>We develop a quantum-enhanced inference framework that casts CVaR evaluation as a confidence-constrained maximum-likelihood amplitude estimation problem.
  arXiv  Detail & Related papers  (2026-02-10T14:53:26Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Noise-Resilient Quantum Aggregation on NISQ for Federated ADAS Learning [0.0]
  This paper introduces Noise-Resilient Quantum Federated Learning (NR-QFL)<n>It enables secure, low-latency aggregation through variational quantum circuits (VQCs) operating under Noisy Intermediate-Scale Quantum (NISQ) conditions.<n>The framework establishes a scalable foundation for quantum-enhanced federated learning, enabling secure, efficient, and dynamically stable ADAS intelligence at the vehicular edge.
  arXiv  Detail & Related papers  (2025-12-15T11:10:40Z)
• Realistic Threat Models for Fiber and Free-Space Continuous-Variable Quantum Key Distribution [0.0]
  Continuous variable quantum key distribution (QKD) provides a powerful setting for secure quantum communications.<n>The achievable performance of CV-QKD protocols is limited by the fact that they appear to be fragile to both loss and noise.
  arXiv  Detail & Related papers  (2025-10-08T12:57:15Z)
• Tail-Safe Hedging: Explainable Risk-Sensitive Reinforcement Learning with a White-Box CBF--QP Safety Layer in Arbitrage-Free Markets [4.235667373386689]
  Tail-Safe is a deployability-oriented framework for derivatives hedging.<n>The learning component combines an IQN-based distributional critic with a CVaR objective.<n>The safety component enforces discrete-time CBF inequalities together with domain-specific constraints.
  arXiv  Detail & Related papers  (2025-10-06T07:39:45Z)
• Distributionally Robust Safety Verification of Neural Networks via Worst-Case CVaR [3.0458514384586404]
  This paper builds on Fazlyab's quadratic-constraint (QC) and semidefinite-programming (SDP) framework for neural network verification.<n>The integration broadens input-uncertainty geometry-covering ellipsoids, polytopes, and hyperplanes-and extends applicability to safety-critical domains.
  arXiv  Detail & Related papers  (2025-09-22T07:04:53Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Pointwise Feasibility of Gaussian Process-based Safety-Critical Control under Model Uncertainty [77.18483084440182]
  Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs) are popular tools for enforcing safety and stability of a controlled system, respectively. We present a Gaussian Process (GP)-based approach to tackle the problem of model uncertainty in safety-critical controllers that use CBFs and CLFs.
  arXiv  Detail & Related papers  (2021-06-13T23:08:49Z)

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.