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:0812.4246 · Physical Review Letters

Unconditional Security Proof of Long-Distance Continuous-Variable Quantum Key Distribution with Discrete Modulation

Anthony Leverrier, Philippe Grangier

Published May 6, 2009• 409 citations
arXivHTMLPDF

Abstract

We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.
DOI
10.1103/physrevlett.102.180504

Related papers

Long distance quantum key distribution with continuous variables

Anthony Leverrier, Philippe Grangier

We present a continuous-variable quantum key distribution protocol combining a continuous but slightly non-Gaussian modulation together with a efficient reverse reconciliation scheme. We establish the security of this protocol against collective attacks which correspond to a linear quantum channel. In particular, all Gaussian attacks are considered in our framework. We show that this protocol outperforms all known practical protocols, even taking into account finite size effects.

arXiv:1005.0328•May 3, 2010•2 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

Long-distance continuous-variable measurement-device-independent quantum key distribution with discrete modulation

Hongxin Ma, Peng Huang, Dongyun Bai +4 more

We propose a long-distance continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol with discrete modulation. This kind of discrete-modulated scheme has good compatibility with efficient error correction code, which leads to higher reconciliation efficiency even at low signal-to-noise ratio. Security analysis shows that the proposed protocol is secure against arbitrary collective attacks in the asymptotic limit with the proper use of decoy states. With the use of discrete modulation, the proposed CV-MDI-QKD protocol has simpler implementation and outperforms previous protocols in terms of achievable maximal transmission distance, which precisely solved the bottleneck of the original Gaussian-modulated CV-MDI-QKD protocol.

arXiv:1812.05254•Physical Review A•Feb 20, 2019•65 citations

Information reconciliation for discretely-modulated continuous-variable quantum key distribution

Anthony Leverrier

The goal of this note is to explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. Such modulation formats are attractive since they significantly simplify experimental implementations compared to protocols with a Gaussian modulation. Previous security proofs that relied crucially on the Gaussian distribution of the input states are rendered inapplicable, and new proofs based on the entropy accumulation theorem have emerged. Unfortunately, these proofs are not compatible with existing reconciliation procedures, and necessitate a reevaluation of the reconciliation problem. We argue that this problem is nontrivial and deserves further attention. In particular, assuming it can be solved with optimal efficiency leads to overly optimistic predictions for the performance of the key distribution protocol, in particular for long distances.

arXiv:2310.17548•Oct 26, 2023•3 citations

Security of a discretely signaled continuous variable quantum key distribution protocol for high rate systems

Zheshen Zhang, Paul L. Voss

We propose a continuous variable based quantum key distribution protocol that makes use of discretely signaled coherent light and reverse error reconciliation. We present a rigorous security proof against collective attacks with realistic lossy, noisy quantum channels, imperfect detector efficiency, and detector electronic noise. This protocol is promising for convenient, high-speed operation at link distances up to 50 km with the use of post-selection.

Optics Express•Jul 2, 2009•12 citations

High Efficient Secret Key Distillation for Long Distance Continuous Variable Quantum Key Distribution

Yibo Zhao, Zheng‐Fu Han, Chen, Jin-jian +2 more

The continuous variable quantum key distribution is expected to provide high secret key rate without single photon source and detector, but the lack of the secure and effective key distillation method makes it unpractical. Here, we present a secure single-bit-reverse-reconciliation protocol combined with secret information concentration and post-selection, which can distill the secret key with high efficiency and low computational complexity. The simulation results show that this protocol can provide high secret key rate even when the transmission fiber is longer than 150km, which may make the continuous variable scheme to outvie the single photon one.

arXiv:quant-ph/0603068•Mar 8, 2006•0 citations
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.
We propose a long-distance continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol with discrete modulation. This kind of discrete-modulated scheme has good compatibility with efficient error correction code, which leads to higher reconciliation efficiency even at low signal-to-noise ratio. Security analysis shows that the proposed protocol is secure against arbitrary collective attacks in the asymptotic limit with the proper use of decoy states. With the use of discrete modulation, the proposed CV-MDI-QKD protocol has simpler implementation and outperforms previous protocols in terms of achievable maximal transmission distance, which precisely solved the bottleneck of the original Gaussian-modulated CV-MDI-QKD protocol.
The goal of this note is to explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. Such modulation formats are attractive since they significantly simplify experimental implementations compared to protocols with a Gaussian modulation. Previous security proofs that relied crucially on the Gaussian distribution of the input states are rendered inapplicable, and new proofs based on the entropy accumulation theorem have emerged. Unfortunately, these proofs are not compatible with existing reconciliation procedures, and necessitate a reevaluation of the reconciliation problem. We argue that this problem is nontrivial and deserves further attention. In particular, assuming it can be solved with optimal efficiency leads to overly optimistic predictions for the performance of the key distribution protocol, in particular for long distances.
The continuous variable quantum key distribution is expected to provide high secret key rate without single photon source and detector, but the lack of the secure and effective key distillation method makes it unpractical. Here, we present a secure single-bit-reverse-reconciliation protocol combined with secret information concentration and post-selection, which can distill the secret key with high efficiency and low computational complexity. The simulation results show that this protocol can provide high secret key rate even when the transmission fiber is longer than 150km, which may make the continuous variable scheme to outvie the single photon one.