Security bounds for unidimensional discrete-modulated CV-QKD: a Gaussian extremality approach

• URL: http://arxiv.org/abs/2603.05178v1
• Date: Thu, 05 Mar 2026 13:45:55 GMT
• Title: Security bounds for unidimensional discrete-modulated CV-QKD: a Gaussian extremality approach
• Authors: John A. Mora Rodríguez, Maron F. Anka, Leonardo J. Pereira, Micael A. Dias, Alexandre B. Tacla,
• Abstract summary: Security bounds for 1D discrete-modulated quantum key distribution protocols are determined.<n>We show that the Gaussian extremality assumption systematically overestimates Eve's information with increasing constellation size.<n>Our results highlight the necessity of alternative methods or optimized non-modulated constellation designs for this class of protocols.
• Score: 36.94429692322632
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unidimensional (1D) Gaussian-modulated continuous-variable quantum key distribution protocols have been proposed as a way to simplify implementation and reduce costs through single-quadrature modulation, requiring only one modulator while maintaining compatibility with standard optical infrastructure. Here, we determine security bounds for 1D discrete-modulated protocol under the Gaussian extremality assumption by extending the method of Ghorai et al. [Phys. Rev. X 9, 021059 (2019)]. We establish the appropriate symmetry arguments to extend the method to the 1D discrete-modulated case, define the physicality zone in which the protocol is allowed to operate, and prove security against collective attacks in the asymptotic regime via semidefinite programming. Our analysis for uniformly distributed coherent states reveals a fundamental limitation: the Gaussian extremality assumption systematically overestimates Eve's information with increasing constellation size, yielding bounds so conservative that secure key extraction becomes impossible for constellations larger than four states, even under ideal conditions. This overestimation worsens with excess noise and restricts viable modulation amplitudes to impractically small values. Unlike two-dimensional (2D) protocols, where Gaussian extremality improves with constellation size, 1D protocols lack the growing phase-space isotropy required for the approximation to remain tight as the constellation grows. Our results expose these limitations and highlight the necessity of alternative methods or optimized non-uniform constellation designs for this class of protocols.

Related papers

• Discrete-modulation continuous-variable quantum key distribution with probabilistic amplitude shaping over a linear quantum channel [2.7338779723187474]
  We deal with the infinite key size regime, consider a homodyne detection scheme, and analyze what happens for different cardinalities of the input alphabet at different distances.<n>We find that our protocol, beyond being easily reproducible in the laboratory, provides a way to closely approach the theoretical performance offered by GG02.
  arXiv  Detail & Related papers  (2026-03-03T11:22:33Z)
• 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)
• Improved Communication-Privacy Trade-offs in $L_2$ Mean Estimation under Streaming Differential Privacy [47.997934291881414]
  Existing mean estimation schemes are usually optimized for $L_infty$ geometry and rely on random rotation or Kashin's representation to adapt to $L$ geometry. We introduce a novel privacy accounting method for the sparsified Gaussian mechanism that incorporates the randomness inherent in sparsification into the DP. Unlike previous approaches, our accounting algorithm directly operates in $L$ geometry, yielding MSEs that fast converge to those of the Gaussian mechanism.
  arXiv  Detail & Related papers  (2024-05-02T03:48:47Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• Security of discrete-modulated continuous-variable quantum key distribution [4.637027109495763]
  Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security. We prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol.
  arXiv  Detail & Related papers  (2023-03-16T12:14:07Z)
• Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution [0.562479170374811]
  We extend the security proof based on complementarity, which is used in the discrete-variable QKD, to the previously developed binary-modulation CV-QKD protocols. Notably, the key rate in the limit scales linearly against the attenuation rate, which is known to be optimal scaling but is not achieved in previous finite-size analyses.
  arXiv  Detail & Related papers  (2023-01-09T05:11:23Z)
• Quantum key distribution with non-ideal heterodyne detection: composable security of discrete-modulation continuous-variable protocols [6.85316573653194]
  Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field. In doing this, we establish for the first time the composable security of discrete-modulation continuous-variable quantum key distribution in the finite-size regime.
  arXiv  Detail & Related papers  (2021-08-01T11:00:10Z)
• Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity [49.66890309455787]
  We introduce the expected co-coercivity condition, explain its benefits, and provide the first last-iterate convergence guarantees of SGDA and SCO. We prove linear convergence of both methods to a neighborhood of the solution when they use constant step-size. Our convergence guarantees hold under the arbitrary sampling paradigm, and we give insights into the complexity of minibatching.
  arXiv  Detail & Related papers  (2021-06-30T18:32:46Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation [0.3222802562733786]
  We establish an analytical lower bound on the secret key rate of continuous-variable quantum key distribution with an arbitrary modulation of coherent states. We show that relatively small constellation sizes, with say 64 states, are essentially sufficient to obtain a performance close to a true Gaussian modulation.
  arXiv  Detail & Related papers  (2021-03-25T16:05:22Z)

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.