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

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.     

High-efficiency Gaussian key reconciliation in continuous variable quantum key distribution

Efficient reconciliation is a crucial step in continuous variable quantum key distribution. The progressive-edge-growth(PEG) algorithm is an efficient method to construct relatively short block length low-density parity-check(LDPC) codes. The qua-sicyclic construction method can extend short block length codes and further eliminate the shortest cycle. In this paper, by combining the PEG algorithm and quasi-cyclic construction method, we design long block length irregular LDPC codes with high error-correcting capacity. Based on these LDPC codes, we achieve high-efficiency Gaussian key reconciliation with slice recon-ciliation based on multilevel coding/multistage decoding with an efficiency of 93.7%.     

用于多维数据协调的双边类型LDPC码

在连续变量量子密钥分发(CV-QKD)多维数据协调中,协调效率和密钥传输距离取决于低密度奇偶校验(LDPC)码的纠错性能。在本研究中构造了一种拥有重复累积(RA)码中累积结构的高码率双边类型LDPC码(TET-LDPC),这种双边类型LDPC码在多维数据协调中相比于普通LDPC码可以得到更好的协调性能。经仿真结果可知,在信噪比为1.68 dB时,本文构造的码长为2×10~5的TET-LDPC的协调效率仍然可以达到98.48%,并得到了17.35 kb/s的安全密钥率。     

Rate compatible reconciliation for continuous-variable quantum key distribution using Raptor-like LDPC codes

In the practical continuous-variable quantum key distribution(CV-QKD) system, the postprocessing process, particularly the error correction part, significantly impacts the system performance. Multi-edge type low-density parity-check(MET-LDPC) codes are suitable for CV-QKD systems because of their Shannon-limit-approaching performance at a low signal-to-noise ratio(SNR).However, the process of designing a low-rate MET-LDPC code with good performance is extremely complicated. Thus, we introduce Raptor-like LDPC(RL-LDPC) codes into the CV-QKD system, exhibiting both the rate compatible property of the Raptor code and capacity-approaching performance of MET-LDPC codes. Moreover, this technique can significantly reduce the cost of constructing a new matrix. We design the RL-LDPC matrix with a code rate of 0.02 and easily and effectively adjust this rate from 0.016 to 0.034. Simulation results show that we can achieve more than 98% reconciliation efficiency in a range of code rate variation using only one RL-LDPC code that can support high-speed decoding with an SNR less than-16.45 d B. This code allows the system to maintain a high key extraction rate under various SNRs, paving the way for practical applications of CV-QKD systems with different transmission distances.     

Reverse reconciliation for continuous variable quantum key distribution

An efficient and practical post-processing technique based on reverse reconciliation for continuous variable quantum key distribution is proposed and simulated with low-density parity check (LDPC) codes. MultiLevel Coding/ MultiStage Decoding, which fully utilizes optimization technique such as vector quantization and iterative decoding and the optimal channel coding most close to the Shannon limit, was used to realize efficient reverse reconciliation algorithm. Simulation results showed that the proposed m...     

连续变量量子密钥分发的数据逆向协调

基于多级编码/多级译码(MLC/MSD)系统实现了连续变量量子密钥分发的逆向数据协调。讨论了高斯连续变量量化过程中使互信息量最大时最佳量化区间的选取,并且通过理论计算给出了信噪比为4dB的情况下各级等价信道的最佳码率。协调方案中选择低密度奇偶校验码(LDPC)作为信道编码,结合边信息译码原理最终通过LDPC迭代译码算法实现了数据的逆向协调。     

Error Estimation at the Information Reconciliation Stage of Quantum Key Distribution

Quantum key distribution (QKD) offers a practical solution for secure communication between two distinct parties via a quantum channel and an authentic public channel. In this work, we consider different approaches to the quantum bit error rate (QBER) estimation at the information reconciliation stage of the post-processing procedure. For reconciliation schemes employing low-density parity-check (LDPC) codes, we develop a novel syndrome-based QBER estimation algorithm. The algorithm suggested is suitable for irregular LDPC codes and takes into account punctured and shortened bits. Testing our approach in a real QKD setup, we show that an approach combining the proposed algorithm with conventional QBER estimation techniques allows one to improve the accuracy of the QBER estimation.     

Balancing four-state continuous-variable quantum key distribution with linear optics cloning machine

We show that the secret key generation rate can be balanced with the maximum secure distance of four-state continuous-variable quantum key distribution(CV-QKD) by using the linear optics cloning machine(LOCM). Benefiting from the LOCM operation, the LOCM-tuned noise can be employed by the reference partner of reconciliation to achieve higher secret key generation rates over a long distance. Simulation results show that the LOCM operation can flexibly regulate the secret key generation rate and the maximum secure distance and improve the performance of four-state CV-QKD protocol by dynamically tuning parameters in an appropriate range.     

Bound on Noise of Coherent Source for Secure Continuous-Variable Quantum Key Distribution

Coherent source of continuous-variable quantum key distribution (CV QKD) system may become noisy in practical applications. The security of CV-QKD scheme with the noisy coherent source is investigated under realistic conditions of quantum channel and detector. In particular, two models are proposed to characterize the noisy coherent source through introducing a party (Fred) who induces the noise with an optical amplifier. When supposing the party Fred is untrusted, two lower security bounds to the noise of the coherent source are derived for reverse reconciliation and realistic homodyne and heterodyne detections. While supposing Fred is a neutral party, we derive two tight security bounds without knowing Fred’s exact state for ideal detections. Moreover, the simulation results show that the security of the reverse reconciliation CV-QKD protocols is very sensitive to the noise of coherent source for both the homodyne and heterodyne detections.     

An Improved Slice Reconciliation Protocol for Continuous-Variable Quantum Key Distribution

Reconciliation is an essential procedure for continuous-variable quantum key distribution (CV-QKD). As the most commonly used reconciliation protocol in short-distance CV-QKD, the slice error correction (SEC) allows a system to distill more than 1 bit from each pulse. However, the quantization efficiency is greatly affected by the noisy channel with a low signal-to-noise ratio (SNR), which usually limits the secure distance to about 30 km. In this paper, an improved SEC protocol, named Rotated-SEC (RSEC), is proposed through performing a random orthogonal rotation on the raw data before quantization, and deducing a new estimator for the quantized sequences. Moreover, the RSEC protocol is implemented with polar codes. The experimental results show that the proposed protocol can reach up to a quantization efficiency of about 99%, and maintain at around 96% even at the relatively low SNRs (0.5,1), which theoretically extends the secure distance to about 45 km. When implemented with the polar codes with a block length of 16 Mb, the RSEC achieved a reconciliation efficiency of above 95%, which outperforms all previous SEC schemes. In terms of finite-size effects, we achieved a secret key rate of 7.83×10−3 bits/pulse at a distance of 33.93 km (the corresponding SNR value is 1). These results indicate that the proposed protocol significantly improves the performance of SEC and is a competitive reconciliation scheme for the CV-QKD system.     

基于低密度奇偶校验码的MPPM比特符号映射及系统性能研究

建立了基于低密度奇偶校验(LDPC)码和多脉冲位置调制(MPPM)的无线光通信系统模型,给出了相应系统模型下的解码算法,研究了(m,2)MPPM的比特符号映射方式,提出了用改进的遗传算法(GA)搜索的优化映射方法,最后在大气湍流信道下进行了仿真。仿真结果表明基于LDPC码和MPPM的无线光通信系统性能明显优于未编码的MPPM系统,结合LDPC码和多光束发射技术可以提高系统抗强大气湍流影响的能力;通过GA优化的映射方法在不增加系统复杂性的情况下能进一步提高系统的纠错性能,可以获得更大的编码增益。     

单向量子密钥纠错协议的纠错性能仿真分析

高效误码纠错是量子密钥分配后续数据处理的关键技术之一.基于汉明码校验子级联单向一次通信纠错方案, 分别对三种校验子级联纠错能力进行了理论和仿真分析.根据分析结果提出了一种基于混合校验子级联纠错协议, 通过优化纠错流程相关参数提高密钥生成效率.随后对该协议的纠错能力及其密钥生成效率进行了仿真分析, 最后根据误码率后验分布参数, 对密钥最终误码率及其置信区间进行了估计.单一校验子级联纠错仿真结果显示:在相同的纠错能力的条件下, 初始误码率为3% < p ≤ 11% 时, (7, 4)汉明码纠错的密钥生成效率最高;初始误码率为1.5% < p ≤ 3.0% 时, (15, 11)汉明码纠错的密钥生成效率最高;初始误码率为p ≤ 1.5% 时, (31, 26) 汉明码纠错的密钥生成效率最高.混合校验子级联纠错方案的仿真结果显示:对于初始误码率为9.50%, 经过8轮次混合校验子级联纠错, 密钥生成效率为9.94%, 误码率期望值为5.21×10^-12, 置信度为90%的上限值为2.85×10^-11, 相比用单一(7, 4)校验子级联纠错的密钥生成效率提高了约3倍. 关键词： 量子密钥分配 保密纠错 效率分析     

Half-duplex relaying with serially concatenated low-density generator matrix (SCLDGM) codes

Recently, the integration of cooperation with coding has proven to be a very useful technique to enhance relay system performance. Relay systems based on low-density parity-check (LDPC) codes have the potential to approach the theoretical information limits very closely. However, LDPC codes have a disadvantage in that the encoding complexity is high. To solve this problem, serially concatenated low-density generator matrix (SCLDGM) codes are attracting attention owing to their low encoding complexity. However, the performance of SCLDGM coded relaying has not been investigated. In this paper, we apply SCLDGM codes to relay channel with the motivation of lowering the encoding complexity. Since SCLDGM codes are concatenated codes, we cannot use the same method as LDPC coded relaying. We propose a new relaying system and three cooperation protocols suited for SCLDGM codes. Computer simulation results show that the bit error rate (BER) performance of the proposed system is equal to that of conventional LDPC coded relaying system.     

Genetic optimization of 5G-NR LDPC codes for lowering the error floor of BICM systems

With the wide range of commercial uses of fifth generation (5G), new radio (NR) communication networks, the wireless transmission becomes more efficient, reliable and faster. At the same time, high-quality signal transmission for 5G networks and beyond has also encountered new opportunities and challenges. Channel coding is a key technology to ensure reliable information transmission and service quality. However, the 5G-NR LDPC coded bit-interleaved coded modulation (BICM) sometimes suffers from relatively high error floors, so it can not always guarantee the high-quality and low-delay wireless transmission. In this paper, we propose a further redesign of the 5G-NR LDPC coded BICM based on genetic algorithm (GenAlg). By adjusting the number of the non-zero elements, the corresponding positions and shifting values in base matrix, we optimize the 5G-NR LDPC codes with GenAlg according to the error performances of coded BICM schemes. Simulation results show that the optimized 5G-NR LDPC codes which still support length and rate compatible coding have lower error floors with a little performance loss int the waterfall region compared to the standard 5G-NR LDPC codes with different modulation orders.     

Practical security analysis of continuous-variable quantum key distribution with jitter in clock synchronization

How to narrow the gap of security between theory and practice has been a notoriously urgent problem in quantum cryptography. Here, we analyze and provide experimental evidence of the clock jitter effect on the practical continuous-variable quantum key distribution (CV-QKD) system. The clock jitter is a random noise which exists permanently in the clock synchronization in the practical CV-QKD system, it may compromise the system security because of its impact on data sampling and parameters estimation. In particular, the practical security of CV-QKD with different clock jitter against collective attack is analyzed theoretically based on different repetition frequencies, the numerical simulations indicate that the clock jitter has more impact on a high-speed scenario. Furthermore, a simplified experiment is designed to investigate the influence of the clock jitter.     

Analysis of Blind Reconstruction of BCH Codes

In this paper, the theoretical lower-bound on the success probability of blind reconstruction of Bose–Chaudhuri–Hocquenghem (BCH) codes is derived. In particular, the blind reconstruction method of BCH codes based on the consecutive roots of generator polynomials is mainly analyzed because this method shows the best blind reconstruction performance. In order to derive a performance lower-bound, the theoretical analysis of BCH codes on the aspects of blind reconstruction is performed. Furthermore, the analysis results can be applied not only to the binary BCH codes but also to the non-binary BCH codes including Reed–Solomon (RS) codes. By comparing the derived lower-bound with the simulation results, it is confirmed that the success probability of the blind reconstruction of BCH codes based on the consecutive roots of generator polynomials is well bounded by the proposed lower-bound.     

Improving Key Rate of Optical Fiber Quantum Key Distribution System Based on Channel Tomography

We investigate the key rate of polarization-coded optical fiber-based quantum key distribution system (QKD) with BB84 protocol by channel tomography. The quantum bit error rate (QBER) of the QKD system under depolarizing channel is obtained by analyzing output density operators, transmission rate of channel, transmission rate of the receiver and dark count of single photon detector. According to the estimated QBER an LDPC chosen adaptively is applied to information reconciliation and the practical final key rate is discussed. Analysis results show that compared with cascade scheme and no channel knowledge the key rate can be improved by the proposed reconciliation scheme with channel tomography.     

High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution

Quantum key distribution (QKD) is a promising technique to share unconditionally secure keys between remote parties. As an essential part of a practical QKD system, reconciliation is responsible for correcting the errors due to the quantum channel noise by exchanging information through a public classical channel. In the present work, we propose a novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted. Both theoretical analysis and simulation results show that our protocol can evidently reduce the information leakage as well as the number of communication rounds.     

A novel construction algorithm of the LDPC code for high-speed long-haul optical transmission systems

According to the transmission characteristics of high-speed long-haul optical transmission system, the main construction method of Low-Density Parity-Check (LDPC) code for optical transmission system is presented and a novel construction algorithm of LDPC code is proposed, the theoretical analysis shows that the parity check matrix of the LDPC code constructed by the proposed construction algorithm has no four-girth phenomenon, this is also theoretically proved out. Both the novel LDPC(3969,3720) code with 6.69% redundancy and the novel LDPC(8281,7920) code with 4.56% redundancy for optical transmission systems are constructed by using the presented construction method and proposed construction algorithm. The simulation results show that the net coding gain (NCG) of the two novel LDPC codes at the eighteenth iteration for the BER of 10^?12 are respectively 1.63 dB and 1.49 dB more than that of the RS(255,239) code in ITU-T G.975. Moreover, the decoding of the LDPC code in the hardware can parallel be implemented, so the decoding speed of the two novel LDPC codes are very rapid, the complexities of implementing the two novel LDPC codes, compared with the concatenated codes in ITU-T G.975.1, are relatively lower, furthermore, the hardware overhead and storage space can relatively be saved and the computation complexity can be reduced in implementing the hardware in the future. As a result, the two novel LDPC codes can better be suitable for high-speed long-haul optical transmission systems.     

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

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 5 G 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.