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

International Conference on Communication, Image and Signal Processing (CCISP)

High Efficiency Continuous-Variable Quantum Key Distribution Based on Quasi-Cyclic LDPC Codes

Kun Zhang, Xueqin Jiang, Yan Feng, Runhe Qiu, Enjian Bai

Published Nov 1, 2020• 4 citations
Publisher

Abstract

Information reconciliation in the continuousvariable quantum key distribution (CVQKD) plays a vital role on affecting secret key rate as well as maximum transmission distance. It is necessary to search good error-correcting codes in order to improve the performance of reconciliation efficiency. In this work, we construct Quasi-Cyclic (QC) low-density paritycheck (LDPC) codes based on LDPC codes in the digital video broadcasting second generation terrestrial (DVB-T2) standard, and then combine these codes with information reconciliation in the CVQKD system, which can extremely ameliorate the performance of secret key rate and maximum transmission distance. The simulation results show that our proposed QC-LDPC codes can achieve higher reconciliation efficiency of 93.05% compare to DVB-T2 LDPC codes, which means our proposed QC-LDPC codes can obtain better performance of secret key rate and longer maximum transmission distance.

DOI
10.1109/ccisp51026.2020.9273490

Related papers

High Efficiency Continuous-Variable Quantum Key Distribution Based on ATSC 3.0 LDPC Codes

Kun Zhang, Xueqin Jiang, Yan Feng +2 more

Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has the property of physical absolute security and can effectively overcome the dependence of the current encryption system on the computational complexity. In this paper, we construct the spatially coupled (SC)-low-density parity-check (LDPC) codes and quasi-cyclic (QC)-LDPC codes by adopting the parity-check matrices of LDPC codes in the Advanced Television Systems Committee (ATSC) 3.0 standard as base matrices and introduce these codes for information reconciliation in the CVQKD system in order to improve the performance of reconciliation efficiency, and then make further improvements to final secret key rate and transmission distance. Simulation results show that the proposed LDPC codes can achieve reconciliation efficiency of higher than 0.96. Moreover, we can obtain a high final secret key rate and a long transmission distance through using our proposed LDPC codes for information reconciliation.

Entropy•Sep 27, 2020•18 citations

High efficiency continuous-variable quantum key distribution based on QC-LDPC codes

Ying Guo, Kangshuai Wang, Duan Huang +1 more

Seeking good error correcting codes to improve the efficiency of continuous-variable quantum key distribution (CVQKD) reconciliation is a concerning issue. Due to the introduction of multidimensional reconciliation, the error correcting techniques in the classical binary-input additive white Gaussian noise channel are applicable to CVQKD. In this Letter, we apply the quasi-cyclic low-density parity-check (QC-LDPC) codes, which are specified in 5G protocol, to the reconciliation process. Simulation results show that the reconciliation efficiency can reach 92.6% when the code rate is 22/68 and the signal-to-noise ratio is 0.623. Such a new error correcting code points out a new direction for the development of CVQKD.

Chinese Optics Letters•Jan 1, 2019•8 citations

Quasi-cyclic multi-edge LDPC codes for long-distance quantum cryptography

Mario Milicevic, Chen Feng, Lei M. Zhang +1 more

Abstract The speed at which two remote parties can exchange secret keys in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of key reconciliation. Multi-dimensional reconciliation using multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths has been shown to improve error-correction performance and extend the maximum reconciliation distance. We introduce a quasi-cyclic code construction for multi-edge codes that is highly suitable for hardware-accelerated decoding on a graphics processing unit (GPU). When combined with an 8-dimensional reconciliation scheme, our LDPC decoder achieves an information throughput of 7.16 Kbit/s on a single NVIDIA GeForce GTX 1080 GPU, at a maximum distance of 142 km with a secret key rate of 6.64 × 10−8 bits/pulse for a rate 0.02 code with block length of 106 bits. The LDPC codes presented in this work can be used to extend the previous maximum CV-QKD distance of 100 km to 142 km, while delivering up to 3.50× higher information throughput over the tight upper bound on secret key rate for a lossy channel.

arXiv:1702.07740•npj Quantum Information•Apr 24, 2018•145 citations

High-efficiency reconciliation for continuous variable quantum key distribution

Zengliang Bai, Shenshen Yang, Yongmin Li

Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.

Japanese Journal of Applied Physics•Mar 13, 2017•32 citations

High-Speed Reconciliation for CVQKD Based on Spatially Coupled LDPC Codes

Xueqin Jiang, Siyuan Yang, Peng Huang +1 more

The speed of continuous variable quantum key distribution is limited by the reconciliation efficiency and the reconciliation frame error rate (FER) in the reconciliation phase. In this paper, we propose an approach that may increase the reconciliation efficiency and decrease the FER. In detail, to increase the reconciliation efficiency, rather than using the block low-density parity-check (LDPC) codes, such as quasi-cyclic LDPC codes, multiedge-type LDPC codes, and punctured LDPC codes, this paper introduces spatially coupled (SC) LDPC codes to the reconciliation phase. To decrease the FER, we propose a new reconciliation scheme based on the special structure of SC-LDPC codes. To demonstrate the performance of the proposed approach, we construct the SC-LDPC codes based on quasi-cyclic repeat-accumulate codes. It is shown that the proposed scheme leads to higher reconciliation speed than that of the previous reconciliation schemes.

IEEE photonics journal•Jul 11, 2018•19 citations

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Xiaodong Fan, Quanhao Niu, Tao Zhao +1 more

Long block length rate-compatible low-density parity-compatible (LDPC) codes are designed to solve the problems of great variation of quantum channel noise and extremely low signal-to-noise ratio in continuous-variable quantum key distribution (CV-QKD). The existing rate-compatible methods for CV-QKD inevitably cost abundant hardware resources and waste secret key resources. In this paper, we propose a design rule of rate-compatible LDPC codes that can cover all potential SNRs with single check matrix. Based on this long block length LDPC code, we achieve high efficiency continuous-variable quantum key distribution information reconciliation with a reconciliation efficiency of 91.80% and we have higher hardware processing efficiency and lower frame error rate than other schemes. Our proposed LDPC code can obtain a high practical secret key rate and a long transmission distance in an extremely unstable channel.

Entropy•Oct 13, 2022•7 citations
Information reconciliation in the continuousvariable quantum key distribution (CVQKD) plays a vital role on affecting secret key rate as well as maximum transmission distance. It is necessary to search good error-correcting codes in order to improve the performance of reconciliation efficiency. In this work, we construct Quasi-Cyclic (QC) low-density paritycheck (LDPC) codes based on LDPC codes in the digital video broadcasting second generation terrestrial (DVB-T2) standard, and then combine these codes with information reconciliation in the CVQKD system, which can extremely ameliorate the performance of secret key rate and maximum transmission distance. The simulation results show that our proposed QC-LDPC codes can achieve higher reconciliation efficiency of 93.05% compare to DVB-T2 LDPC codes, which means our proposed QC-LDPC codes can obtain better performance of secret key rate and longer maximum transmission distance.
Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has the property of physical absolute security and can effectively overcome the dependence of the current encryption system on the computational complexity. In this paper, we construct the spatially coupled (SC)-low-density parity-check (LDPC) codes and quasi-cyclic (QC)-LDPC codes by adopting the parity-check matrices of LDPC codes in the Advanced Television Systems Committee (ATSC) 3.0 standard as base matrices and introduce these codes for information reconciliation in the CVQKD system in order to improve the performance of reconciliation efficiency, and then make further improvements to final secret key rate and transmission distance. Simulation results show that the proposed LDPC codes can achieve reconciliation efficiency of higher than 0.96. Moreover, we can obtain a high final secret key rate and a long transmission distance through using our proposed LDPC codes for information reconciliation.
Seeking good error correcting codes to improve the efficiency of continuous-variable quantum key distribution (CVQKD) reconciliation is a concerning issue. Due to the introduction of multidimensional reconciliation, the error correcting techniques in the classical binary-input additive white Gaussian noise channel are applicable to CVQKD. In this Letter, we apply the quasi-cyclic low-density parity-check (QC-LDPC) codes, which are specified in 5G protocol, to the reconciliation process. Simulation results show that the reconciliation efficiency can reach 92.6% when the code rate is 22/68 and the signal-to-noise ratio is 0.623. Such a new error correcting code points out a new direction for the development of CVQKD.
Abstract The speed at which two remote parties can exchange secret keys in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of key reconciliation. Multi-dimensional reconciliation using multi-edge low-density parity-check (LDPC) codes with low code rates and long block lengths has been shown to improve error-correction performance and extend the maximum reconciliation distance. We introduce a quasi-cyclic code construction for multi-edge codes that is highly suitable for hardware-accelerated decoding on a graphics processing unit (GPU). When combined with an 8-dimensional reconciliation scheme, our LDPC decoder achieves an information throughput of 7.16 Kbit/s on a single NVIDIA GeForce GTX 1080 GPU, at a maximum distance of 142 km with a secret key rate of 6.64 × 10−8 bits/pulse for a rate 0.02 code with block length of 106 bits. The LDPC codes presented in this work can be used to extend the previous maximum CV-QKD distance of 100 km to 142 km, while delivering up to 3.50× higher information throughput over the tight upper bound on secret key rate for a lossy channel.
Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.
The speed of continuous variable quantum key distribution is limited by the reconciliation efficiency and the reconciliation frame error rate (FER) in the reconciliation phase. In this paper, we propose an approach that may increase the reconciliation efficiency and decrease the FER. In detail, to increase the reconciliation efficiency, rather than using the block low-density parity-check (LDPC) codes, such as quasi-cyclic LDPC codes, multiedge-type LDPC codes, and punctured LDPC codes, this paper introduces spatially coupled (SC) LDPC codes to the reconciliation phase. To decrease the FER, we propose a new reconciliation scheme based on the special structure of SC-LDPC codes. To demonstrate the performance of the proposed approach, we construct the SC-LDPC codes based on quasi-cyclic repeat-accumulate codes. It is shown that the proposed scheme leads to higher reconciliation speed than that of the previous reconciliation schemes.
Long block length rate-compatible low-density parity-compatible (LDPC) codes are designed to solve the problems of great variation of quantum channel noise and extremely low signal-to-noise ratio in continuous-variable quantum key distribution (CV-QKD). The existing rate-compatible methods for CV-QKD inevitably cost abundant hardware resources and waste secret key resources. In this paper, we propose a design rule of rate-compatible LDPC codes that can cover all potential SNRs with single check matrix. Based on this long block length LDPC code, we achieve high efficiency continuous-variable quantum key distribution information reconciliation with a reconciliation efficiency of 91.80% and we have higher hardware processing efficiency and lower frame error rate than other schemes. Our proposed LDPC code can obtain a high practical secret key rate and a long transmission distance in an extremely unstable channel.