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:2301.10270 · Physical Review Research

Improved composable key rates for CV-QKD

Stefano Pirandola, Panagiotis Papanastasiou

Published Jun 24, 2024• 31 citations
arXivHTMLPDF

Abstract

Modern security proofs of quantum key distribution (QKD) must take finite-size effects and composable aspects into consideration. This is also the case for continuous-variable (CV) protocols, which are based on the transmission and detection of bosonic coherent states. In this paper, we refine and advance the previous theory in this area providing a more rigorous formulation for the composable key rate of a generic CV-QKD protocol. Thanks to these theoretical refinements, our general formulas allow us to prove more optimistic key rates with respect to previous literature. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.023321

Related papers

Composable security for continuous variable quantum key distribution: Trust levels and practical key rates in wired and wireless networks

Stefano Pirandola

Continuous variable (CV) quantum key distribution (QKD) provides a powerful setting for secure quantum communications, thanks to the use of room-temperature off-the-shelf optical devices and the potential to reach much higher rates than the standard discrete-variable counterpart. In this paper, we provide a general framework for studying the composable finite-size security of CV-QKD with Gaussian-modulated coherent-state protocols under various levels of trust for the loss and noise experienced by the parties. Our paper considers both wired (i.e., fiber-based) and wireless (i.e., free-space) quantum communications. In the latter case, we show that high key rates are achievable for short-range optical wireless (LiFi) in secure quantum networks with both fixed and mobile devices. Finally, we extend our investigation to microwave wireless (WiFi) discussing security and feasibility of CV-QKD for very short-range applications.

arXiv:2203.00706•Physical Review Research•Oct 7, 2021•94 citations

Composable continuous-variable multi-user QKD with discrete modulation: theory and implementation

Florian Kanitschar, Adnan A. E. Hajomer, Michael Hentschel +2 more

Establishing scalable, secure quantum networks requires advancing beyond conventional point-to-point quantum key distribution (QKD) protocols toward point-to-multipoint QKD protocols. Here, we generalize a well-established discrete-modulated continuous-variable (CV) QKD protocol from the point-to-point to the point-to-multipoint setting. We present a comprehensive security analysis across different scenarios and derive secret key rates for loss-only and noisy channels, both in the asymptotic and the composable finite-size regime. Experimentally, we validate the protocol in a passive optical network with 10 km access links, achieving a composable secure key rate of 2.185×10 −3 bits per symbol (0.273 Mbit/s) against independent and identically distributed collective attacks. Our results demonstrate that discrete-modulated CV-QKD can support access networks with multiple users while relying solely on cost-efficient, off-the-shelf telecommunication components, paving the way toward practical, scalable, and secure quantum networks.

arXiv:2406.14610•Optica•Jun 29, 2026•0 citations

Finite-Size Security for Discrete-Modulated Continuous-Variable Quantum Key Distribution Protocols

Florian Kanitschar, Ian George, Jie Lin +2 more

Discrete-modulated (DM) continuous-variable quantum key distribution (CV-QKD) protocols are promising candidates for commercial implementations of quantum communication networks due to their experimental simplicity.While tight security analyses in the asymptotic limit exist, proofs in the finitesize regime are still subject to active research.We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol.We introduce a new energy testing theorem to bound the effective dimension of Bob's system and rigorously prove security within Renner's -security framework and address the issue of acceptance sets in protocols and their security proof.We want to highlight that our method also allows for nonunique acceptance statistics, which is necessary in practise.Finally, we extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate.To demonstrate our method, we apply it to a quadrature phase-shift keying protocol for both untrusted, ideal and trusted, nonideal detectors.The results show that our security proof method yields secure finite-size key rates under experimentally viable conditions up to at least 72 km transmission distance.

arXiv:2301.08686•PRX Quantum•Oct 10, 2023•59 citations

Continuous-variable measurement-device-independent quantum key distribution: Composable security against coherent attacks

Cosmo Lupo, Carlo Ottaviani, Panagiotis Papanastasiou +1 more

We present a rigorous security analysis of continuous-variable measurement-device-independent quantum key distribution (CV MDI QKD) in a finite-size scenario. The security proof is obtained in two steps: by first assessing the security against collective Gaussian attacks, and then extending to the most general class of coherent attacks via the Gaussian de Finetti reduction. Our result combines recent state-of-the-art security proofs for CV QKD with findings about min-entropy calculus and parameter estimation. In doing so, we improve the finite-size estimate of the secret key rate. Our conclusions confirm that CV MDI protocols allow for high rates on the metropolitan scale, and may achieve a nonzero secret key rate against the most general class of coherent attacks after ${10}^{7}$--${10}^{9}$ quantum signal transmissions, depending on loss and noise, and on the required level of security.

arXiv:1704.07924•Physical Review A•May 29, 2018•103 citations

Composably secure data processing for Gaussian-modulated continuous-variable quantum key distribution

Alexander G. Mountogiannakis, Panagiotis Papanastasiou, Boris Braverman +1 more

Continuous-variable (CV) quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties, and this is usually achieved via a Gaussian modulation of coherent states. The resulting secret key rate depends not only on the loss and noise in the communication channel, but also on a series of data processing steps that are needed for transforming shared correlations into a final string of secret bits. Here we consider a Gaussian-modulated coherent-state protocol with homodyne detection in the general setting of composable finite-size security. After simulating the process of quantum communication, the output classical data are postprocessed via procedures of parameter estimation, error correction, and privacy amplification. In particular, we analyze the high signal-to-noise regime, which requires the use of high-rate (nonbinary) low-density parity check codes. We implement all these steps in a python-based library that allows one to investigate and optimize the protocol parameters to be used in practical experimental implementations of short-range CV-QKD.

arXiv:2103.16589•Physical Review Research•Feb 9, 2022•30 citations

Unconditional Security of Discrete-Modulated CV-QKD from Infinite-Dimensional MEAT

Lars Kamin, Ian George, John Burniston +1 more

Discrete-Modulated (DM) Continuous-Variable (CV) Quantum Key Distribution (QKD) is an experimentally attractive approach to quantum cryptography, offering high key rates over metropolitan-scale distances while relying on state-of-the-art telecom infrastructure. However, a fundamental gap has remained between this experimental promise and rigorous security: for more than two decades, DM CV-QKD has lacked a complete composable finite-size security proof against coherent attacks. Existing works either restrict the adversary to collective attacks, impose additional finite-dimensional assumptions, apply only to specific modulation formats, or fail to recover the known asymptotic rates. Here, we resolve this longstanding problem by establishing the first complete composable finite-size security proof for DM CV-QKD protocols against coherent attacks, incorporating imperfect detectors and both fixed- and variable-length protocol variants. Our proof introduces two central results of broader interest: an infinite-dimensional marginal-constrained entropy accumulation theorem (iMEAT) and a rigorous dimension-reduction technique that makes the infinite-dimensional security bounds numerically tractable. The resulting key rates recover the known asymptotic rates and outperform established finite-size bounds based on collective attacks, while yielding positive key rates beyond $70$km for experimentally relevant block sizes and parameters. Thus, our work closes a longstanding gap and places an experimentally attractive class of CV-QKD protocols on a rigorous composable security footing and provides a pathway towards their practical deployment.

quant-pharXiv:2609.16105•Sep 16, 2026•0 citations
Modern security proofs of quantum key distribution (QKD) must take finite-size effects and composable aspects into consideration. This is also the case for continuous-variable (CV) protocols, which are based on the transmission and detection of bosonic coherent states. In this paper, we refine and advance the previous theory in this area providing a more rigorous formulation for the composable key rate of a generic CV-QKD protocol. Thanks to these theoretical refinements, our general formulas allow us to prove more optimistic key rates with respect to previous literature. Published by the American Physical Society 2024
Continuous variable (CV) quantum key distribution (QKD) provides a powerful setting for secure quantum communications, thanks to the use of room-temperature off-the-shelf optical devices and the potential to reach much higher rates than the standard discrete-variable counterpart. In this paper, we provide a general framework for studying the composable finite-size security of CV-QKD with Gaussian-modulated coherent-state protocols under various levels of trust for the loss and noise experienced by the parties. Our paper considers both wired (i.e., fiber-based) and wireless (i.e., free-space) quantum communications. In the latter case, we show that high key rates are achievable for short-range optical wireless (LiFi) in secure quantum networks with both fixed and mobile devices. Finally, we extend our investigation to microwave wireless (WiFi) discussing security and feasibility of CV-QKD for very short-range applications.
Establishing scalable, secure quantum networks requires advancing beyond conventional point-to-point quantum key distribution (QKD) protocols toward point-to-multipoint QKD protocols. Here, we generalize a well-established discrete-modulated continuous-variable (CV) QKD protocol from the point-to-point to the point-to-multipoint setting. We present a comprehensive security analysis across different scenarios and derive secret key rates for loss-only and noisy channels, both in the asymptotic and the composable finite-size regime. Experimentally, we validate the protocol in a passive optical network with 10 km access links, achieving a composable secure key rate of 2.185×10 −3 bits per symbol (0.273 Mbit/s) against independent and identically distributed collective attacks. Our results demonstrate that discrete-modulated CV-QKD can support access networks with multiple users while relying solely on cost-efficient, off-the-shelf telecommunication components, paving the way toward practical, scalable, and secure quantum networks.
Discrete-modulated (DM) continuous-variable quantum key distribution (CV-QKD) protocols are promising candidates for commercial implementations of quantum communication networks due to their experimental simplicity.While tight security analyses in the asymptotic limit exist, proofs in the finitesize regime are still subject to active research.We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol.We introduce a new energy testing theorem to bound the effective dimension of Bob's system and rigorously prove security within Renner's -security framework and address the issue of acceptance sets in protocols and their security proof.We want to highlight that our method also allows for nonunique acceptance statistics, which is necessary in practise.Finally, we extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate.To demonstrate our method, we apply it to a quadrature phase-shift keying protocol for both untrusted, ideal and trusted, nonideal detectors.The results show that our security proof method yields secure finite-size key rates under experimentally viable conditions up to at least 72 km transmission distance.
We present a rigorous security analysis of continuous-variable measurement-device-independent quantum key distribution (CV MDI QKD) in a finite-size scenario. The security proof is obtained in two steps: by first assessing the security against collective Gaussian attacks, and then extending to the most general class of coherent attacks via the Gaussian de Finetti reduction. Our result combines recent state-of-the-art security proofs for CV QKD with findings about min-entropy calculus and parameter estimation. In doing so, we improve the finite-size estimate of the secret key rate. Our conclusions confirm that CV MDI protocols allow for high rates on the metropolitan scale, and may achieve a nonzero secret key rate against the most general class of coherent attacks after 107{10}^{7}107--109{10}^{9}109 quantum signal transmissions, depending on loss and noise, and on the required level of security.
Continuous-variable (CV) quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties, and this is usually achieved via a Gaussian modulation of coherent states. The resulting secret key rate depends not only on the loss and noise in the communication channel, but also on a series of data processing steps that are needed for transforming shared correlations into a final string of secret bits. Here we consider a Gaussian-modulated coherent-state protocol with homodyne detection in the general setting of composable finite-size security. After simulating the process of quantum communication, the output classical data are postprocessed via procedures of parameter estimation, error correction, and privacy amplification. In particular, we analyze the high signal-to-noise regime, which requires the use of high-rate (nonbinary) low-density parity check codes. We implement all these steps in a python-based library that allows one to investigate and optimize the protocol parameters to be used in practical experimental implementations of short-range CV-QKD.
Discrete-Modulated (DM) Continuous-Variable (CV) Quantum Key Distribution (QKD) is an experimentally attractive approach to quantum cryptography, offering high key rates over metropolitan-scale distances while relying on state-of-the-art telecom infrastructure. However, a fundamental gap has remained between this experimental promise and rigorous security: for more than two decades, DM CV-QKD has lacked a complete composable finite-size security proof against coherent attacks. Existing works either restrict the adversary to collective attacks, impose additional finite-dimensional assumptions, apply only to specific modulation formats, or fail to recover the known asymptotic rates. Here, we resolve this longstanding problem by establishing the first complete composable finite-size security proof for DM CV-QKD protocols against coherent attacks, incorporating imperfect detectors and both fixed- and variable-length protocol variants. Our proof introduces two central results of broader interest: an infinite-dimensional marginal-constrained entropy accumulation theorem (iMEAT) and a rigorous dimension-reduction technique that makes the infinite-dimensional security bounds numerically tractable. The resulting key rates recover the known asymptotic rates and outperform established finite-size bounds based on collective attacks, while yielding positive key rates beyond 707070km for experimentally relevant block sizes and parameters. Thus, our work closes a longstanding gap and places an experimentally attractive class of CV-QKD protocols on a rigorous composable security footing and provides a pathway towards their practical deployment.