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

Chinese Physics Letters

Secret Key Distillation for Continuous Variable Quantum Key Distribution against Gaussian Classical Eve

Yibo Zhao, Zheng‐Fu Han, Jin-jian Chen, Gu You-Zhen, Guo Guang-Can

Published Sep 1, 2008• 0 citations
Publisher

Abstract

The continuous variable quantum key distribution is expected to provide high secret key rate without single photon source and detector, while the lack of the effective key distillation method makes it unpractical under the high loss condition. Here we present a single-bit-reverse-reconciliation protocol against Gaussian classical Eve, which can distill the secret key through practical imperfect error correction with high efficiency. The simulation results show that this protocol can distill secret keys even when the transmission fibre is longer than 150 km, which may make the continuous variable scheme to outvie the single photon one.

DOI
10.1088/0256-307x/25/9/013

Related papers

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

Secret Key Distillation for Continuous Variable Quantum Key Distribution against Gaussian Classical Eve

赵义博, Han Fu, 陈进建 +2 more

没有单个光子来源和察觉者，连续的可变的量钥匙分发被期望提供高秘密的关键率，当有效关键蒸馏方法的缺乏在高损失条件下面使它不切实际时。这里我们在场对 Gaussian 古典伊夫的一个 single-bit-reverse-reconciliation 协议，它能与高效率通过实际有瑕疵的错误修正提取秘密钥匙。甚至当传播纤维比 150 km 长时，模拟结果证明这个协议能提取秘密钥匙，它可以做连续可变计划胜过单个光子一个。[从作者抽象]

Chinese Physics Letters•Jan 1, 2008•0 citations

Continuous-Variable Quantum Key Distribution with key rates far above the PLOB bound

Arpan Akash Ray, Boris Škorić

Continuous-Variable Quantum Key Distribution (CVQKD) at large distances has such high noise levels that the error-correcting code must have very low rate. In this regime it becomes feasible to implement random-codebook error correction, which is known to perform close to capacity. We propose a reverse reconciliation scheme for CVQKD in which the first step is advantage distillation based on random-codebook error correction operated above the Shannon limit. Our scheme has a novel way of achieving statistical decoupling between the public reconciliation data and the secret key. We provide an analysis of the secret key rate for the case of Gaussian collective attacks, and we present numerical results. The best performance is obtained when the message size exceeds the mutual information $I(X;Y)$ between Alice's quadratures $X$ and Bob's measurements $Y$, i.e. the Shannon limit. This somewhat counter-intuitive result is understood from a tradeoff between code rate and frame rejection rate, combined with the fact that error correction for QKD needs to reconcile only random data. We obtain secret key rates that lie far above the Devetak-Winter value $I(X;Y) - I(E;Y)$, which is the upper bound in the case of one-way error correction. Furthermore, our key rates lie above the PLOB bound for Continuous-Variable detection, but below the PLOB bound for Discrete-Variable detection.

arXiv:2402.04770•Feb 7, 2024•0 citations

Long-distance continuous-variable quantum key distribution with a Gaussian modulation

Paul Jouguet, Sébastien Kunz-Jacques, Anthony Leverrier

We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about ${10}^{\ensuremath{-}3}$ bit per pulse at a distance of 120 km for reasonable physical parameters.

arXiv:1110.0100•Physical Review A•Dec 21, 2011•273 citations

Practical, high-speed Gaussian coherent state continuous variable quantum key distribution with real-time parameter monitoring, optimised slicing, and post-processed key distillation

Amanda Weerasinghe, Muataz Alhussein, Adam Alderton +2 more

Gaussian coherent state continuous variable quantum key distribution has gained interest owing to its security and compatibility with classical coherent optical fibre networks. For successful system deployment it is necessary to implement practical high speed systems which distil keys efficiently. Here, we demonstrate a Gaussian coherent state continuous variable quantum key distribution system at a 50 MHz symbol rate. Unlike most demonstrations to date which measure excess noise and infer key rates from this, we record signals in real time and distil keys. We also demonstrate, for the first time, slice reconciliation with optimised guard bands to maximise achievable secret key rates. Using this optimisation with multilevel slicing, a record 5 Mb/s secret key rate after a transmission distance of 25 km is achieved. This is a significant improvement on the 3 Mb/s secret key rate which is achieved with single level optimised slice reconciliation.

Scientific Reports•Dec 6, 2023•9 citations

Low-Dimensional Reconciliation for Continuous-Variable Quantum Key Distribution

László Gyöngyösi, Sándor Imre

We propose an efficient logical layer-based reconciliation method for continuous-variable quantum key distribution (CVQKD) to extract binary information from correlated Gaussian variables. We demonstrate that by operating on the raw-data level, the noise of the quantum channel can be corrected in the low-dimensional (scalar) space, and the reconciliation can be extended to arbitrary dimensions. The CVQKD systems allow an unconditionally secret communication over standard telecommunication networks. To exploit the real potential of CVQKD a robust reconciliation technique is needed. It is currently unavailable, which makes it impossible to reach the real performance of the CVQKD protocols. The reconciliation is a post-processing step separated from the transmission of quantum states, which is aimed to derive the secret key from the raw data. The reconciliation process of correlated Gaussian variables is a complex problem that requires either tomography in the physical layer that is intractable in a practical scenario, or high-cost calculations in the multidimensional spherical space with strict dimensional limitations. To avoid these issues, we define the low-dimensional reconciliation. We prove that the error probability of one-dimensional reconciliation is zero in any practical CVQKD scenario, and provides unconditional security. The results allow for significantly improving the currently available key rates and transmission distances of CVQKD.

arXiv:1308.1391•Applied Sciences•Jan 9, 2018•0 citations
The continuous variable quantum key distribution is expected to provide high secret key rate without single photon source and detector, while the lack of the effective key distillation method makes it unpractical under the high loss condition. Here we present a single-bit-reverse-reconciliation protocol against Gaussian classical Eve, which can distill the secret key through practical imperfect error correction with high efficiency. The simulation results show that this protocol can distill secret keys even when the transmission fibre is longer than 150 km, which may make the continuous variable scheme to outvie the single photon one.
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.
没有单个光子来源和察觉者，连续的可变的量钥匙分发被期望提供高秘密的关键率，当有效关键蒸馏方法的缺乏在高损失条件下面使它不切实际时。这里我们在场对 Gaussian 古典伊夫的一个 single-bit-reverse-reconciliation 协议，它能与高效率通过实际有瑕疵的错误修正提取秘密钥匙。甚至当传播纤维比 150 km 长时，模拟结果证明这个协议能提取秘密钥匙，它可以做连续可变计划胜过单个光子一个。[从作者抽象]
Continuous-Variable Quantum Key Distribution (CVQKD) at large distances has such high noise levels that the error-correcting code must have very low rate. In this regime it becomes feasible to implement random-codebook error correction, which is known to perform close to capacity. We propose a reverse reconciliation scheme for CVQKD in which the first step is advantage distillation based on random-codebook error correction operated above the Shannon limit. Our scheme has a novel way of achieving statistical decoupling between the public reconciliation data and the secret key. We provide an analysis of the secret key rate for the case of Gaussian collective attacks, and we present numerical results. The best performance is obtained when the message size exceeds the mutual information I(X;Y)I(X;Y)I(X;Y) between Alice's quadratures XXX and Bob's measurements YYY, i.e. the Shannon limit. This somewhat counter-intuitive result is understood from a tradeoff between code rate and frame rejection rate, combined with the fact that error correction for QKD needs to reconcile only random data. We obtain secret key rates that lie far above the Devetak-Winter value I(X;Y)−I(E;Y)I(X;Y) - I(E;Y)I(X;Y)−I(E;Y), which is the upper bound in the case of one-way error correction. Furthermore, our key rates lie above the PLOB bound for Continuous-Variable detection, but below the PLOB bound for Discrete-Variable detection.
We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about ${10}^{\ensuremath{-}3}$ bit per pulse at a distance of 120 km for reasonable physical parameters.
Gaussian coherent state continuous variable quantum key distribution has gained interest owing to its security and compatibility with classical coherent optical fibre networks. For successful system deployment it is necessary to implement practical high speed systems which distil keys efficiently. Here, we demonstrate a Gaussian coherent state continuous variable quantum key distribution system at a 50 MHz symbol rate. Unlike most demonstrations to date which measure excess noise and infer key rates from this, we record signals in real time and distil keys. We also demonstrate, for the first time, slice reconciliation with optimised guard bands to maximise achievable secret key rates. Using this optimisation with multilevel slicing, a record 5 Mb/s secret key rate after a transmission distance of 25 km is achieved. This is a significant improvement on the 3 Mb/s secret key rate which is achieved with single level optimised slice reconciliation.
We propose an efficient logical layer-based reconciliation method for continuous-variable quantum key distribution (CVQKD) to extract binary information from correlated Gaussian variables. We demonstrate that by operating on the raw-data level, the noise of the quantum channel can be corrected in the low-dimensional (scalar) space, and the reconciliation can be extended to arbitrary dimensions. The CVQKD systems allow an unconditionally secret communication over standard telecommunication networks. To exploit the real potential of CVQKD a robust reconciliation technique is needed. It is currently unavailable, which makes it impossible to reach the real performance of the CVQKD protocols. The reconciliation is a post-processing step separated from the transmission of quantum states, which is aimed to derive the secret key from the raw data. The reconciliation process of correlated Gaussian variables is a complex problem that requires either tomography in the physical layer that is intractable in a practical scenario, or high-cost calculations in the multidimensional spherical space with strict dimensional limitations. To avoid these issues, we define the low-dimensional reconciliation. We prove that the error probability of one-dimensional reconciliation is zero in any practical CVQKD scenario, and provides unconditional security. The results allow for significantly improving the currently available key rates and transmission distances of CVQKD.