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:1709.01758 · Physical Review A

Security proof of continuous-variable quantum key distribution using three coherent states

Kamil Brádler, Christian Weedbrook

Published Feb 6, 2018• 66 citations
arXivHTMLPDF

Abstract

We introduce a ternary quantum key distribution (QKD) protocol and asymptotic security proof based on three coherent states and homodyne detection. Previous work had considered the binary case of two coherent states and here we nontrivially extend this to three. Our motivation is to leverage the practical benefits of both discrete and continuous (Gaussian) encoding schemes creating a best-of-both-worlds approach; namely, the postprocessing of discrete encodings and the hardware benefits of continuous ones. We present a thorough and detailed security proof in the limit of infinite signal states which allows us to lower bound the secret key rate. We calculate this is in the context of collective eavesdropping attacks and reverse reconciliation postprocessing. Finally, we compare the ternary coherent state protocol to other well-known QKD schemes (and fundamental repeaterless limits) in terms of secret key rates and loss.

DOI
10.1103/physreva.97.022310

Related papers

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

Security analysis of Quantum Key Distribution

Fernández Raventós, Núria

Quantum Key Distribution (QKD) provides a method for securely sharing a secret key between two distant parties, Alice and Bob, by leveraging the principles of quantum mechanics. This thesis focuses on Continuous-Variable (CV) QKD, a variant of QKD where information is encoded in the quadrature components of coherent light states, allowing for efficient and cost-effective detection using homodyne or heterodyne receivers. The thesis is divided into three main parts: an introduction to quantum cryptography concepts, the presentation of a CV-QKD protocol, and a detailed security proof of the protocol against different types of attacks. The security proof considers both finite and infinite symbol transmission and tackles various eavesdropping attacks, including individual, collective, and coherent attacks. The use of Gaussian states and operations provides a promising approach to enhance QKD security, particularly in the context of practical quantum cryptography. The final sections provide a mathematical framework for the optimization of secure key rates and strategies for addressing the photon-number cutoff assumption in practical implementations.

•Oct 24, 2024•0 citations

Security against Collective Attacks for a Continuous-Variable Quantum Key Distribution Protocol Using Homodyne Detection and Postselection

Ryo Namiki

We analyze the security against collective attacks for a homodyne-based continuous-variable quantum key distribution protocol using binary coherent states and postselection. We derive a lower bound of the secret key rate in an asymptotic scenario, and numerically optimize it for the case of a symmetric Gaussian channel.

arXiv:2205.11820•Journal of the Physical Society of Japan•Dec 2, 2022•2 citations

Security Analysis of Quantum Key Distribution: Methods and Applications

Jie Lin

Quantum key distribution (QKD) can be proved to be secure by laws of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools that extend the applicability of these numerical methods. We then present the asymptotic security proof against collective attacks for a variant of the twin-field QKD protocol, which can overcome the repeaterless secret-key capacity bound. Our variant reduces the sifting cost and uses non-phase-randomized coherent states as both signals and test states. We confirm the loss scaling of this protocol. Another important family of protocols that we investigate here are discrete-modulated continuous-variable QKD protocols. They are interesting due to their experimental simplicity and their great potential for massive deployment in the quantum-secured networks. Our security proof method can provide tight asymptotic key rates. We demonstrate that the postselection of data in combination with reverse reconciliation can improve the key rates. We analyze both untrusted and trusted detector noise scenarios. Our results in the trusted detector noise scenario show that we can thus cut out most of the effect of detector noise and obtain asymptotic key rates similar to those had we access to ideal detectors. Finally, we present several simple examples to illustrate our newly developed method for the numerical finite-key analysis against the most general attacks via the entropy accumulation theorem.

•Sep 27, 2021•2 citations

Continuous-Variable Quantum Key Distribution

Frédéric Grosshans, A. Acín, Nicolas J. Cerf

Quantum key distribution is a technique in which secret key bits are encoded into quantum states which are transmitted over a quantum channel, e.g. an optical link, so that the security is guaranteed by the laws of quantum physics. Most experimental realizations to date have relied on discrete protocols, involving ideally single-photons states (or, in practice, strongly attenuated light pulses) as well as single-photon detectors. In this chapter, we present an overview of the recent continuous-variable quantum cryptosystems, which instead rely on continuously-modulated Gaussian states (e.g. coherent states) and homodyne detection. The series of security proofs of these protocols against increasingly powerful attacks will be reviewed. A particular emphasis will be put on the op-timality of Gaussian attacks in this context, which holds provided that the second-order moments of the relevant variables are monitored.

IMPERIAL COLLEGE PRESS eBooks•Feb 1, 2007•7 citations

Security bound of continuous-variable quantum key distribution with discrete modulation

Yong Shen, Zou Hong-Xin, 国防科学技术大学理学院物理系 长沙 410073

Security of continuous-variable quantum key distribution with four-state protocol based on discrete modulation of noisy coherent states is analyzed. Combing discrete modulation and reverse reconciliation, this protocol can be used for long distance cryptography. There is a small difference between the state Alice sends in the discrete modulation protocol and the Gaussian modulation protocol, and it can be treated as excess noise and loss in the channel. As Alice cannot do a precise modulation, she will induce noise to the coherent state. We look this noise as the source noise and derive a lower bound to the secure key rate assuming the eavesdropper cannot benefit from the noise in the source. For avoiding the fast and random phase locking between the signal and local oscillator in experiment, we also analyze the security of four-state protocol using no-switching scheme.

Acta Physica Sinica•Jan 1, 2010•7 citations
We introduce a ternary quantum key distribution (QKD) protocol and asymptotic security proof based on three coherent states and homodyne detection. Previous work had considered the binary case of two coherent states and here we nontrivially extend this to three. Our motivation is to leverage the practical benefits of both discrete and continuous (Gaussian) encoding schemes creating a best-of-both-worlds approach; namely, the postprocessing of discrete encodings and the hardware benefits of continuous ones. We present a thorough and detailed security proof in the limit of infinite signal states which allows us to lower bound the secret key rate. We calculate this is in the context of collective eavesdropping attacks and reverse reconciliation postprocessing. Finally, we compare the ternary coherent state protocol to other well-known QKD schemes (and fundamental repeaterless limits) in terms of secret key rates and loss.
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.
Quantum Key Distribution (QKD) provides a method for securely sharing a secret key between two distant parties, Alice and Bob, by leveraging the principles of quantum mechanics. This thesis focuses on Continuous-Variable (CV) QKD, a variant of QKD where information is encoded in the quadrature components of coherent light states, allowing for efficient and cost-effective detection using homodyne or heterodyne receivers. The thesis is divided into three main parts: an introduction to quantum cryptography concepts, the presentation of a CV-QKD protocol, and a detailed security proof of the protocol against different types of attacks. The security proof considers both finite and infinite symbol transmission and tackles various eavesdropping attacks, including individual, collective, and coherent attacks. The use of Gaussian states and operations provides a promising approach to enhance QKD security, particularly in the context of practical quantum cryptography. The final sections provide a mathematical framework for the optimization of secure key rates and strategies for addressing the photon-number cutoff assumption in practical implementations.
Quantum key distribution (QKD) can be proved to be secure by laws of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools that extend the applicability of these numerical methods. We then present the asymptotic security proof against collective attacks for a variant of the twin-field QKD protocol, which can overcome the repeaterless secret-key capacity bound. Our variant reduces the sifting cost and uses non-phase-randomized coherent states as both signals and test states. We confirm the loss scaling of this protocol. Another important family of protocols that we investigate here are discrete-modulated continuous-variable QKD protocols. They are interesting due to their experimental simplicity and their great potential for massive deployment in the quantum-secured networks. Our security proof method can provide tight asymptotic key rates. We demonstrate that the postselection of data in combination with reverse reconciliation can improve the key rates. We analyze both untrusted and trusted detector noise scenarios. Our results in the trusted detector noise scenario show that we can thus cut out most of the effect of detector noise and obtain asymptotic key rates similar to those had we access to ideal detectors. Finally, we present several simple examples to illustrate our newly developed method for the numerical finite-key analysis against the most general attacks via the entropy accumulation theorem.
Quantum key distribution is a technique in which secret key bits are encoded into quantum states which are transmitted over a quantum channel, e.g. an optical link, so that the security is guaranteed by the laws of quantum physics. Most experimental realizations to date have relied on discrete protocols, involving ideally single-photons states (or, in practice, strongly attenuated light pulses) as well as single-photon detectors. In this chapter, we present an overview of the recent continuous-variable quantum cryptosystems, which instead rely on continuously-modulated Gaussian states (e.g. coherent states) and homodyne detection. The series of security proofs of these protocols against increasingly powerful attacks will be reviewed. A particular emphasis will be put on the op-timality of Gaussian attacks in this context, which holds provided that the second-order moments of the relevant variables are monitored.
Security of continuous-variable quantum key distribution with four-state protocol based on discrete modulation of noisy coherent states is analyzed. Combing discrete modulation and reverse reconciliation, this protocol can be used for long distance cryptography. There is a small difference between the state Alice sends in the discrete modulation protocol and the Gaussian modulation protocol, and it can be treated as excess noise and loss in the channel. As Alice cannot do a precise modulation, she will induce noise to the coherent state. We look this noise as the source noise and derive a lower bound to the secure key rate assuming the eavesdropper cannot benefit from the noise in the source. For avoiding the fast and random phase locking between the signal and local oscillator in experiment, we also analyze the security of four-state protocol using no-switching scheme.