Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2103.13945 · Quantum

Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation

Aurélie Denys, Peter J. Brown, Anthony Leverrier

Published Sep 13, 2021• 134 citations
arXivHTMLPDF

Abstract

We establish an analytical lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation of coherent states. Previously, such bounds were only available for protocols with a Gaussian modulation, and numerical bounds existed in the case of simple phase-shift-keying modulations. The latter bounds were obtained as a solution of convex optimization problems and our new analytical bound matches the results of Ghorai et al. (2019), up to numerical precision. The more relevant case of quadrature amplitude modulation (QAM) could not be analyzed with the previous techniques, due to their large number of coherent states. Our bound shows that relatively small constellation sizes, with say 64 states, are essentially sufficient to obtain a performance close to a true Gaussian modulation and are therefore an attractive solution for large-scale deployment of continuous-variable quantum key distribution. We also derive similar bounds when the modulation consists of arbitrary states, not necessarily pure.

DOI
10.22331/q-2021-09-13-540

Related papers

Asymptotic security of the four-state continuous-variable quantum key distribution protocol

Shouvik Ghorai, Philippe Grangier, Eleni Diamanti +1 more

We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature phase-shift keying (QPSK) modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature amplitude modulations (QAM) schemes. This work is a major step towards establishing the full security of continuous-variable protocols with a discrete modulation in the finite-size regime and opens the way to large-scale deployment of these protocols for quantum key distribution.

•Feb 4, 2019•0 citations

Asymptotic security of discrete-modulation protocols for continuous-variable quantum key distribution

Eneet Kaur, Saikat Guha, Mark M. Wilde

We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.

arXiv:1901.10099•Physical Review A•Jan 15, 2021•52 citations

Discrete-modulation continuous-variable quantum key distribution with a high key rate

Pu Wang, Yu Zhang, Zhenguo Lu +2 more

Abstract Discrete-modulation continuous-variable (CV) quantum key distribution has the potential for large-scale deployment in secure quantum communication networks owing to its low implementation complexity and compatibility with the current coherent optical telecommunication. However, current discrete-modulation protocols require relatively large constellation sizes to achieve a key rate comparable to that of the Gaussian modulation. Here, we show that a high key rate comparable to the Gaussian modulation can be achieved using only ten or so coherent states by implementing suitable key map and numerical convex optimization techniques. Specifically, the key rate of the two-ring constellation with 12 coherent states (four states in the inner ring and eight states in the outer ring) can reach 2.4 times of that of original quadrature phase shift keying and 70% of the Gaussian modulation protocol at 50 km. Such an approach can easily be applied to existing systems, making the discrete-modulation protocol an attractive alternative for high-rate and low-cost applications in secure quantum communication networks.

arXiv:2112.00214•New Journal of Physics•Feb 1, 2023•34 citations

Discrete-modulated continuous-variable quantum key distribution with uncertainty principle

Jiale Mi, Yiming Bian, Song Yu +3 more

Continuous-variable quantum key distribution is a compelling framework for scalable quantum networks due to its seamless integration with existing optical communication infrastructure. However, a fundamental gap persists between theoretical protocols requiring ideal Gaussian modulation and the constrained, discrete-modulated signals dictated by practical high-speed hardware. Current security proofs for discrete modulation rely on semidefinite programming, which suffers from prohibitive computational overhead for high-order constellations and lacks direct physical insight into non-Gaussian modulation.In this Letter, we overcome this limitation by developing a security framework that obviates semidefinite programming in favor of an approach grounded fundamentally in the Heisenberg uncertainty principle. By introducing a multi-mode entanglement-source model to characterize non-Gaussian state preparation, we establish an explicit mapping between constellation geometry and the secret key rate. This framework effectively quantifies the security implications of hardware-limited, finite state preparation, enabling both numerical and analytical security analysis under high-order constellations. We experimentally validate our method on both discrete-component and integrated photonic platforms, demonstrating that a quadrature amplitude modulation format with 256 constellation points can asymptotically approach the Gaussian capacity limit. Beyond quantum key distribution, the principle of tightening uncertainty-constrained bounds via source-mode expansion offers a paradigm for exploring the information-theoretic properties of complex non-Gaussian systems.

quant-pharXiv:2607.20840•Jul 24, 2026•0 citations

Composable Continuous-Variable Quantum Key Distribution using Discrete-Modulated Coherent States with High-Order Constellation

Jiale Mi, Yiming Bian, Song Yu +1 more

We report a discrete-modulated continuous-variable quantum key distribution protocol whose security analysis complexity is independent of constellation cardinality, thereby enabling a 64-QAM constellation to achieve a composable key rate approaching that of true Gaussian modulation.

•Jan 1, 2026•0 citations

Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks

Gabriele Staffieri, Giovanni Scala, Cosmo Lupo

Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. Here we consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-Rényi and sandwiched Rényi conditional entropies associated with these setups, assuming either a passive eavesdropper or one that injects thermal photons into the channel, who gathers the quantum information leaked through a lossy communication line of known or bounded transmittance. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ballpark figures. We obtain analytical or semianalytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and bounds that we determine. The latter are found to be tighter for very short block sizes.

arXiv:2509.14345•Physical Review A•Feb 2, 2026•1 citation
We establish an analytical lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation of coherent states. Previously, such bounds were only available for protocols with a Gaussian modulation, and numerical bounds existed in the case of simple phase-shift-keying modulations. The latter bounds were obtained as a solution of convex optimization problems and our new analytical bound matches the results of Ghorai et al. (2019), up to numerical precision. The more relevant case of quadrature amplitude modulation (QAM) could not be analyzed with the previous techniques, due to their large number of coherent states. Our bound shows that relatively small constellation sizes, with say 64 states, are essentially sufficient to obtain a performance close to a true Gaussian modulation and are therefore an attractive solution for large-scale deployment of continuous-variable quantum key distribution. We also derive similar bounds when the modulation consists of arbitrary states, not necessarily pure.
We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature phase-shift keying (QPSK) modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature amplitude modulations (QAM) schemes. This work is a major step towards establishing the full security of continuous-variable protocols with a discrete modulation in the finite-size regime and opens the way to large-scale deployment of these protocols for quantum key distribution.
We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.
Abstract Discrete-modulation continuous-variable (CV) quantum key distribution has the potential for large-scale deployment in secure quantum communication networks owing to its low implementation complexity and compatibility with the current coherent optical telecommunication. However, current discrete-modulation protocols require relatively large constellation sizes to achieve a key rate comparable to that of the Gaussian modulation. Here, we show that a high key rate comparable to the Gaussian modulation can be achieved using only ten or so coherent states by implementing suitable key map and numerical convex optimization techniques. Specifically, the key rate of the two-ring constellation with 12 coherent states (four states in the inner ring and eight states in the outer ring) can reach 2.4 times of that of original quadrature phase shift keying and 70% of the Gaussian modulation protocol at 50 km. Such an approach can easily be applied to existing systems, making the discrete-modulation protocol an attractive alternative for high-rate and low-cost applications in secure quantum communication networks.
Continuous-variable quantum key distribution is a compelling framework for scalable quantum networks due to its seamless integration with existing optical communication infrastructure. However, a fundamental gap persists between theoretical protocols requiring ideal Gaussian modulation and the constrained, discrete-modulated signals dictated by practical high-speed hardware. Current security proofs for discrete modulation rely on semidefinite programming, which suffers from prohibitive computational overhead for high-order constellations and lacks direct physical insight into non-Gaussian modulation.In this Letter, we overcome this limitation by developing a security framework that obviates semidefinite programming in favor of an approach grounded fundamentally in the Heisenberg uncertainty principle. By introducing a multi-mode entanglement-source model to characterize non-Gaussian state preparation, we establish an explicit mapping between constellation geometry and the secret key rate. This framework effectively quantifies the security implications of hardware-limited, finite state preparation, enabling both numerical and analytical security analysis under high-order constellations. We experimentally validate our method on both discrete-component and integrated photonic platforms, demonstrating that a quadrature amplitude modulation format with 256 constellation points can asymptotically approach the Gaussian capacity limit. Beyond quantum key distribution, the principle of tightening uncertainty-constrained bounds via source-mode expansion offers a paradigm for exploring the information-theoretic properties of complex non-Gaussian systems.
Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. Here we consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-Rényi and sandwiched Rényi conditional entropies associated with these setups, assuming either a passive eavesdropper or one that injects thermal photons into the channel, who gathers the quantum information leaked through a lossy communication line of known or bounded transmittance. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ballpark figures. We obtain analytical or semianalytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and bounds that we determine. The latter are found to be tighter for very short block sizes.