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:2108.00428 · PRX Quantum

Quantum Key Distribution with Nonideal Heterodyne Detection: Composable Security of Discrete-Modulation Continuous-Variable Protocols

Cosmo Lupo, Yingkai Ouyang

Published Mar 14, 2022• 40 citations
arXivHTMLPDF

Abstract

Security proofs that incorporate physical constraints of realistic heterodyne detectors are presented, establishing a rigorous analysis of collective attacks in a continuous-variable quantum cryptography scheme.
DOI
10.1103/prxquantum.3.010341

Related papers

Quantum key distribution with non-ideal heterodyne detection

Cosmo Lupo, Yingkai Ouyang

Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field, i.e., homodyne or heterodyne detection. The most advanced security analyses developed so far relied on idealised mathematical models for such measurements, which assume that the measurement outcomes are continuous and unbounded variables. As any physical measurement device has finite range and precision, these mathematical models only serve as an approximation. It is expected that, under suitable conditions, the predictions obtained using these simplified models are in good agreement with the actual experimental implementations. However, a quantitative analysis of the error introduced by this approximation, and of its impact on composable security, have been lacking so far. Here we present a theory to rigorously account for the experimental limitations of realistic heterodyne detection. We focus on asymptotic security against collective attacks, and indicate a route to include finite-size effects.

•Aug 1, 2021•0 citations

Security of discrete-modulated continuous-variable quantum key distribution

Stefan Bäuml, Carlos Pascual-García, Victoria J Wright +2 more

Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of 0.1 − 10 − 4 bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of 10 Gbits of secret key after n ∼ 10 11 rounds and distances of few tens of kilometres.

arXiv:2303.09255•Quantum•Jul 18, 2024•31 citations

Composable security of two-way continuous-variable quantum key distribution without active symmetrization

Shouvik Ghorai, Eleni Diamanti, Anthony Leverrier

We present a general framework for CV-QKD protocols involving only a Gaussian modulation of coherent states and heterodyne detection. We exploit their symmetry in phase-space to obtain a composable security proof against general attacks.

Quantum Information and Measurement (QIM)•Jan 1, 2019•4 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

Composable security of two-way continuous-variable quantum key distribution

Shouvik Ghorai, Eleni Diamanti, Anthony Leverrier

We present a general framework encompassing a number of continuous-variable quantum key distribution protocols, including standard one-way protocols, measurement-device-independent protocols as well as some two-way protocols, or any other continuous-variable protocol involving only a Gaussian modulation of coherent states and heterodyne detection. The main interest of this framework is that the corresponding protocols are all covariant with respect to the action of the unitary group $U(n)$, implying that their security can be established thanks to a Gaussian de Finetti reduction. In particular, we give a composable security proof of two-way continuous-variable quantum key distribution against general attacks. We also prove that no active symmetrization procedure is required for these protocols, which would otherwise make them prohibitively costly to implement.

•Jun 29, 2018•1 citation

Practical continuous-variable quantum key distribution with composable security

Nitin Jain, Hou-Man Chin, Hossein Mani +10 more

Abstract A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number N of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large N for successful key generation. Here we report a Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with N ≈ 2 × 10 8 coherent states. With this advance, possible due to improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.

arXiv:2110.09262•Nature Communications•Aug 12, 2022•154 citations
Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field, i.e., homodyne or heterodyne detection. The most advanced security analyses developed so far relied on idealised mathematical models for such measurements, which assume that the measurement outcomes are continuous and unbounded variables. As any physical measurement device has finite range and precision, these mathematical models only serve as an approximation. It is expected that, under suitable conditions, the predictions obtained using these simplified models are in good agreement with the actual experimental implementations. However, a quantitative analysis of the error introduced by this approximation, and of its impact on composable security, have been lacking so far. Here we present a theory to rigorously account for the experimental limitations of realistic heterodyne detection. We focus on asymptotic security against collective attacks, and indicate a route to include finite-size effects.
Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of 0.1 − 10 − 4 bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of 10 Gbits of secret key after n ∼ 10 11 rounds and distances of few tens of kilometres.
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 general framework encompassing a number of continuous-variable quantum key distribution protocols, including standard one-way protocols, measurement-device-independent protocols as well as some two-way protocols, or any other continuous-variable protocol involving only a Gaussian modulation of coherent states and heterodyne detection. The main interest of this framework is that the corresponding protocols are all covariant with respect to the action of the unitary group U(n)U(n)U(n), implying that their security can be established thanks to a Gaussian de Finetti reduction. In particular, we give a composable security proof of two-way continuous-variable quantum key distribution against general attacks. We also prove that no active symmetrization procedure is required for these protocols, which would otherwise make them prohibitively costly to implement.
Abstract A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number N of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large N for successful key generation. Here we report a Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with N ≈ 2 × 10 8 coherent states. With this advance, possible due to improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.