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:quant-ph/0512013 · Physical Review A

Efficiency of coherent-state quantum cryptography in the presence of loss: Influence of realistic error correction

Matthias Heid, Norbert Lütkenhaus

Published May 24, 2006• 74 citations
arXivHTMLPDF

Abstract

We investigate the performance of a continuous-variable quantum key distribution scheme in a practical setting. More specifically, we take a nonideal error reconciliation procedure into account. The quantum channel connecting the two honest parties is assumed to be lossy but noiseless. Secret key rates are given for the case that the measurement outcomes are postselected or a reverse reconciliation scheme is applied. The reverse reconciliation scheme loses its initial advantage in the practical setting. If one combines postselection with reverse reconciliation, however, much of this advantage can be recovered.

DOI
10.1103/physreva.73.052316

Related papers

Security of coherent-state quantum cryptography in the presence of Gaussian noise

Matthias Heid, Norbert Lütkenhaus

We investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be lossy and imposes Gaussian noise on the observed quadrature distributions. Secret key rates are given for direct and reverse reconciliation schemes including post-selection in the collective attack scenario. The effect of a nonideal error correction and two-way communication in the classical post-processing step is also taken into account.

arXiv:quant-ph/0608015•Physical Review A•Aug 14, 2007•71 citations

Continuous Variable Quantum Cryptography -- Discussion of Various Realisations with Qudits

Ulrich Seyfarth

We expand the recently discussed continuous-variable quantum key distribution scheme of Heid and Luetkenhaus (2006) to qudits with a lossy but noiseless quantum channel. Postselection methods are used. Secret key rates are calculated in the presence of loss for the direct and the reverse reconciliation method. In the case of reverse reconciliation the secret key rate increases with higher dimensions, in the case of direct reconciliation the result is reverse. Several ways of optimising the amplitude are discussed. In a next step the used states are generalised to squeezed states. Again secret key rates are calculated. The last part deals with the dual-homodyne detection which replaces the single-homodyne measurement. Most results are analytical and allow further treatments if the preparation symmetry stays unchanged.

arXiv:0903.1955•Mar 11, 2009•0 citations

Continuous-variable quantum key distribution in uniform fast-fading channels

Panagiotis Papanastasiou, Christian Weedbrook, Stefano Pirandola

We investigate the performance of several continuous-variable quantum key distribution protocols in the presence of uniform fading channels. These are lossy channels whose transmissivity changes according to a uniform probability distribution. We assume the worst-case scenario where an eavesdropper induces a fast-fading process, where she chooses the instantaneous transmissivity while the remote parties may only detect the mean statistical effect. We analyze coherent-state protocols in various configurations, including the one-way switching protocol in reverse reconciliation, the measurement-device-independent protocol in the symmetric configuration, and its extension to a three-party network. We show that, regardless of the advantage given to the eavesdropper (control of the fading), these protocols can still achieve high rates under realistic attacks, within reasonable values for the variance of the probability distribution associated with the fading process.

arXiv:1710.03525•Physical Review A•Mar 12, 2018•59 citations

Continuous-variable quantum key distribution in a multi-way setting

Panagiotis Papanastasiou, Stefano Pirandola

We extend the asymptotic security of continuous variable quantum key distribution using one-way and two-way quantum communication to a multi-way setting: Quantum signals travel many times between the parties before the final detection. We assume that the encoded signals are Gaussian-modulated coherent states that travel each time through the same Gaussian channel characterized by loss and thermal noise. We then quantify the reverse-reconciliation performance of the protocol presenting results for even or odd numbers of signal exchange.

Photonics for Quantum (PfQ)•Jul 19, 2022•0 citations

Numerical simulation of the optimal two-mode attacks for two-way continuous-variable quantum cryptography in reverse reconciliation

Yichen Zhang, Zhengyu Li, Yijia Zhao +2 more

Abstract We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.

arXiv:1703.02727•Journal of Physics B Atomic Molecular and Optical Physics•Jan 13, 2017•16 citations

Practical Methods for Distance-Adaptive Continuous-Variable Quantum Key Distribution

Jonas Berl, Utku Akin, Erdem Eray Cil +2 more

Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.

quant-pharXiv:2603.10480•Journal of Lightwave Technology•Mar 12, 2026•0 citations
We investigate the performance of a continuous-variable quantum key distribution scheme in a practical setting. More specifically, we take a nonideal error reconciliation procedure into account. The quantum channel connecting the two honest parties is assumed to be lossy but noiseless. Secret key rates are given for the case that the measurement outcomes are postselected or a reverse reconciliation scheme is applied. The reverse reconciliation scheme loses its initial advantage in the practical setting. If one combines postselection with reverse reconciliation, however, much of this advantage can be recovered.
We investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be lossy and imposes Gaussian noise on the observed quadrature distributions. Secret key rates are given for direct and reverse reconciliation schemes including post-selection in the collective attack scenario. The effect of a nonideal error correction and two-way communication in the classical post-processing step is also taken into account.
We expand the recently discussed continuous-variable quantum key distribution scheme of Heid and Luetkenhaus (2006) to qudits with a lossy but noiseless quantum channel. Postselection methods are used. Secret key rates are calculated in the presence of loss for the direct and the reverse reconciliation method. In the case of reverse reconciliation the secret key rate increases with higher dimensions, in the case of direct reconciliation the result is reverse. Several ways of optimising the amplitude are discussed. In a next step the used states are generalised to squeezed states. Again secret key rates are calculated. The last part deals with the dual-homodyne detection which replaces the single-homodyne measurement. Most results are analytical and allow further treatments if the preparation symmetry stays unchanged.
We investigate the performance of several continuous-variable quantum key distribution protocols in the presence of uniform fading channels. These are lossy channels whose transmissivity changes according to a uniform probability distribution. We assume the worst-case scenario where an eavesdropper induces a fast-fading process, where she chooses the instantaneous transmissivity while the remote parties may only detect the mean statistical effect. We analyze coherent-state protocols in various configurations, including the one-way switching protocol in reverse reconciliation, the measurement-device-independent protocol in the symmetric configuration, and its extension to a three-party network. We show that, regardless of the advantage given to the eavesdropper (control of the fading), these protocols can still achieve high rates under realistic attacks, within reasonable values for the variance of the probability distribution associated with the fading process.
We extend the asymptotic security of continuous variable quantum key distribution using one-way and two-way quantum communication to a multi-way setting: Quantum signals travel many times between the parties before the final detection. We assume that the encoded signals are Gaussian-modulated coherent states that travel each time through the same Gaussian channel characterized by loss and thermal noise. We then quantify the reverse-reconciliation performance of the protocol presenting results for even or odd numbers of signal exchange.
Abstract We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.
Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.