Non-Orthogonal Multiple-Access for Coherent-State Optical Quantum Communications Under Lossy Photon Channels

• URL: http://arxiv.org/abs/2512.06739v1
• Date: Sun, 07 Dec 2025 09:04:36 GMT
• Title: Non-Orthogonal Multiple-Access for Coherent-State Optical Quantum Communications Under Lossy Photon Channels
• Authors: Zhichao Dong, Xiaolin Zhou, Yongkang Chen, Wei Ni, Ekram Hossain, Xin Wang,
• Abstract summary: Coherent states have been increasingly considered in optical quantum communications (OQCs)<n>Non-orthogonal multiple-access (NOMA) naturally lends itself to the implementation of multi-user OQC.<n>This paper proposes a novel successive interference cancellation (SIC)-based Kennedy receiver for uplink NOMA-OQC systems.
• Score: 25.84912154480585
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Coherent states have been increasingly considered in optical quantum communications (OQCs). With the inherent non-orthogonality of coherent states, non-orthogonal multiple-access (NOMA) naturally lends itself to the implementation of multi-user OQC. However, this remains unexplored in the literature. This paper proposes a novel successive interference cancellation (SIC)-based Kennedy receiver for uplink NOMA-OQC systems, along with a new approach for power allocation of the coherent states emitted by users. The key idea is to rigorously derive the asymptotic sum-rate of the considered systems, taking into account the impact of atmospheric turbulence, background noise, and lossy photon channel. With the asymptotic sum-rate, we optimize the average number of photons (or powers) of the coherent states emitted by the users. Variable substitution and successive convex approximation (SCA) are employed to convexify and maximize the asymptotic sum-rate iteratively. A new coherent-state power allocation algorithm is developed for a small-to-medium number of users. We further develop its low-complexity variant using adaptive importance sampling, which is suitable for scenarios with a medium-to-large number of users. Simulations demonstrate that our algorithms significantly enhance the sum-rate of uplink NOMA-OQC systems using coherent states by over 20\%, compared to their alternatives.

Related papers

• Communication-Efficient Quantum Federated Learning over Large-Scale Wireless Networks [21.963665862623245]
  Quantum learning (QFL) combines the robust data processing of computing with the privacy-preserving federated learning (FL)<n>In large-scale wireless networks, optimizing sum-centric, for unlocking the true potential of QFL, is crucial.<n>This paper is specifically designed for non-orthoortho access (NOMA) networks.
  arXiv  Detail & Related papers  (2026-03-01T18:41:15Z)
• 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)
• Non-Orthogonal Multiple Access-Based Continuous-Variable Quantum Key Distribution: Secret Key Rate Analysis and Power Allocation [24.547861308732212]
  We address the multi-user quantum key distribution problem under malicious quantum attacks, which is critical for realizing a large-scale quantum Internet.<n>This paper maximizes the sum secret key rate (SKR) of a novel uplink non-orthogonal multiple access based continuous-variable QKD (NOMA-CVQKD) under collective attacks.<n>We derive closed-form bounds for the legitimate users' achievable key rates via the entropy power inequality and maximum entropy principle, as well as for the eavesdropper's intercepted information based on Holevo information.
  arXiv  Detail & Related papers  (2025-12-07T09:20:44Z)
• Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem [0.0]
  We propose a novel quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs)<n>In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes.<n>We show that the CTQW-based algorithm consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology.
  arXiv  Detail & Related papers  (2025-12-02T17:04:57Z)
• Kernelized Decoded Quantum Interferometry [0.0]
  We introduce textbf Kernelized Decoded Quantum Interferometry (k-DQI), a unified framework that integrates spectral engineering directly into the quantum circuit architecture.<n>We prove a textbfMonotonic Improvement Theorem, which establishes that maximizing $_K$ guarantees higher decoding success rates under local depolarizing noise.
  arXiv  Detail & Related papers  (2025-11-25T07:35:03Z)
• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach [36.05085942729295]
  This paper introduces a Quantum Natural Policy Gradient (QNPG) algorithm, which replaces the random sampling used in classicalNPG estimators with a deterministic gradient estimation approach.<n>The proposed QNPG algorithm achieves a sample complexity of $tildemathcalO(epsilon-1.5)$ for queries to the quantum oracle, significantly improving the classical lower bound of $tildemathcalO(epsilon-2)$ for queries to the Markov Decision Process (MDP)
  arXiv  Detail & Related papers  (2025-01-27T17:38:30Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Quantum Approximate Optimization Algorithm in Non-Markovian Quantum Systems [5.249219039097684]
  This paper presents a framework for running QAOA on non-Markovian quantum systems. We mathematically formulate QAOA as piecewise Hamiltonian control of the augmented system. We show that non-Markovianity can be utilized as a quantum resource to achieve a relatively good performance of QAOA.
  arXiv  Detail & Related papers  (2022-08-03T13:34:50Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.