Reconciliation Efficiency Research Articles

Continuous-Variable Measurement-Device-Independent Quantum Key Distribution in the Terahertz Band

We have introduced, for the first time, a protocol for Continuous-Variable Measurement-Device-Independent Quantum Key Distribution (CV-MDI-QKD) in the terahertz (THz) frequency band. We have conducted a secret key rate analysis against collective attacks. The proposed THz CV-MDI-QKD is immune to all detector attacks, significantly enhancing the security assurance of practical THz CVQKD implementations. Furthermore, we investigated the impact of finite key length (the finite-size effect) and finite reconciliation efficiency on the performance of practical THz CV-MDI-QKD systems. Our findings reveal that by employing a large number of keys or signals and optimizing the modulation variance, the detrimental effects arising from the finite-size effect and suboptimal reconciliation efficiency can be notably mitigated. These insights play a crucial role in advancing the feasibility of THz CVQKD technology towards practical applications.

Novel intelligent blind information reconciliation for LDPC codes in quantum key distribution systems

Information reconciliation is an important step in quantum key distribution (QKD). As a good channel coding technology, LDPC (low-density parity-check) code perform well in information reconciliation. In this paper, we investigate a new approach, namely blind information reconciliation. In our approach, after the state distribution is carried out by Alice and the measurements are taken by Bob, Alice can select an appropriate LDPC encoder (parity-check matrix) from the predefined candidate pool according to the estimated QBER (quantum bit-error-rate). Bob can use the expectation–maximization (EM) estimator and the maximum average log-likelihood ratio (LLR) detector to blindly identify parity-check matrices associated with not only different code-rates but also different codeword-lengths Alice employed. Moreover, puncturing and shortening can also be invoked to adjust the code-rate slightly to improve the error-correction performance. Monte Carlo simulations have demonstrated that our proposed new blind information-reconciliation scheme can successfully identify the parity-check matrix even under high QBER conditions, reduce the interactive communication-rounds, and improve the reconciliation efficiency in comparison with the conventional rate-adaptive LDPC coding scheme without QBER estimation.

Entanglement and teleportation in quantum key distribution for secure wireless systems

AbstractEntanglement‐assisted quantum key distribution (QKD) has attracted significant attention for its ability to provide highly secure wireless systems. This work explores the employment of quantum teleportation and the quantum Fourier transform (QFT) in entanglement‐assisted QKD to enhance security. By integrating the concepts of entanglement, teleportation, and QFT, the key distribution strategy is significantly improved, leading to more secure communication. The system has been thoroughly tested for quantum bit error rate, secure key rate, and reconciliation efficiency. The results show that this technique outperforms the standard BB84 protocol. Based on their simulations, this protocol appears to be a promising technique for providing quantum‐level security to next‐generation wireless communication systems.

Low-complexity adaptive reconciliation protocol for continuous-variable quantum key distribution

In continuous-variable quantum key distribution systems, reconciliation is a crucial step that significantly affects the secret key rate (SKR). The rateless protocol based on Raptor codes can achieve high reconciliation efficiency at low signal-to-noise ratios (SNRs). However, the high complexity of low-density parity-check (LDPC) codes used for the precoding in Raptor codes limits the speed of reconciliation. In this paper, we propose an adaptive reconciliation protocol by modifying Raptor codes. The length of random binary sequences is increased because we remove the LDPC precoding that adds redundancy. The modified Raptor codes reduce the complexity of encoding with better performance. The proposed protocol gives a reconciliation efficiency higher than 98.1% in the SNR below −20 dB and maintains a certain SKR in long-distance transmission.

Distributional Transform Based Information Reconciliation

In this paper, we present an information reconciliation protocol designed for Continuous-Variable QKD using the Distributional Transform. By combining tools from copula and information theory, we present a method for extracting independent symmetric Bernoulli bits for Gaussian-modulated CVQKD protocols, which we called the Distributional Transform Expansion (DTE). We derived the expressions for the maximum reconciliation efficiency for both homodyne and heterodyne measurements, which, for the last, is achievable with an efficiency greater than 0.9 at a signal-to-noise ratio lower than -3.6 dB.

Reconciliation Efficiency Impact on Discrete Modulated CV-QKD Systems Key Rates

Continuous variable quantum key distribution (CV-QKD) allows the distribution of symmetric keys in a secure manner. CV-QKD systems can extract keys at its maximum rate when using Gaussian modulation (GM). Nonetheless, GM demands high-capacity random number sources and tends to be very hard to approach in practice. To circumvent these disadvantages, higher-order probabilistic -shaped discrete modulation (DM) can be used. State-of-the-art works compute the key rates of DM-CV-QKD systems considering a fixed value for the reconciliation efficiency and do not take into account the frame error rate (FER) of the system, thus over or under estimating the key rates. In this work, we study the security bounds of CV-QKD systems considering probabilistic shaped DM formats with 256-symbols in the finite-size regime. This accounting for the true value of the reconciliation efficiency, and the FER of the information reconciliation step. Both conventional and hexagonal 256-quadrature amplitude modulation (QAM) constellations yield higher key rates than 256-amplitude and phase shift keying (APSK) constellations, with 256-QAM constellations being indistinguishable in performance with GM for high transmission distances. Minimum signal-to-noise ratio (SNR) values were fixed from a FER analysis through a CV-QKD simulation allowing for key extraction considering different FER levels. Lower FER values are associated with higher SNRs in the system and thus lower achievable transmission distances. Nonetheless, the FER maximizing the extraction key rate is not null. Our results show that the extraction key rate is maximized by SNR adjustment which should have in account both the reconciliation efficiency and the FER.

Rate-Adaptive Polar-Coding-Based Reconciliation for Continuous-Variable Quantum Key Distribution at Low Signal-to-Noise Ratio

Information reconciliation significantly impacts the performance of the practical continuous-variable quantum key distribution (CV QKD) system. Fixed-rate error-correction codes limit the potential applications of the CV QKD because they lead to reduced reconciliation efficiency when the signal-to-noise ratio of the quantum channel changes, further deteriorating the system's performance. Therefore, we propose a rate-adaptive polar-coding-based reconciliation scheme for practical CV QKD systems with the time-variant quantum channel. Experimental results verify that the proposed scheme can successfully extract secret keys within the range of signal-to-noise ratios from $\ensuremath{-}0.5$ to $\ensuremath{-}4.5$ dB, and the minimum frame-error rate can be less than ${10}^{\ensuremath{-}3}$. Moreover, the proposed scheme can promote the application of the CV QKD system in a realistic environment.

Zero-photon catalysis based eight-state discrete modulated measurement-device-independent continuous-variable quantum key distribution

Zero-photon catalysis (ZPC) introduces noiseless attenuation and can be implemented by existing technologies in quantum key distribution (QKD) protocols. In this paper, we present a ZPC-based eight-state measurement-device-independent continuous-variable QKD (MDI-CV-QKD) combined with discrete modulation and reverse reconciliation. This ZPC-involved eight-state protocol shows better efficiency in terms of optimal modulation variances, secret key rates, transmission distances, tolerable excess noises, and reconciliation efficiency compared to the eight-state protocol without ZPC, the four-state protocol without ZPC, and the four-state protocol with ZPC, at a low signal-to-noise ratio (SNR).

IC-LDPC Polar codes-based reconciliation for continuous-variable quantum key distribution at low signal-to-noise ratio

The error correction of information reconciliation affects the performance of the continuous-variable quantum key distribution (CV-QKD). Polar codes can be strictly proven to reach the Shannon-limit. However, due to the insufficient polarization of finite code-length, partial subchannels are neither completely noise-free nor completely noisy. In this paper, an intermediate channel low-density parity check code concatenated polar code (IC-LDPC Polar codes)-based reconciliation for CV-QKD is proposed for the above shortcomings. The experimental results show that the reconciliation efficiency of IC-LDPC Polar code can be over 98% when the signal-to-noise ratio is from −13.2 dB to −20.8 dB, the secret keys can be extracted, and the minimum frame error rate (FER) is 0.19. Therefore, the proposed scheme can improve the reconciliation efficiency and reduce the FER at a very low signal-to-noise ratio range, and it is more useful for a practical long-distance CV-QKD system.

Plug-and-play discrete modulation continuous variable quantum key distribution based on non-Gaussian state-discrimination detection

Plug-and-play discrete modulation continuous variable quantum key distribution can generate local oscillator light locally without using two independent lasers, and both signal light and local oscillator are generated from the same laser, which can effectively ensure the practical security of the system and have a completely identical frequency characteristic. In addition, this scheme has good compatibility with efficient error correction codes, and can achieve high reconciliation efficiency even at low signal-to-noise ratio. However, there exists large excess noise in the plug-and-play configuration based on the untrusted source model, which seriously limits the maximum transmission distance of the discrete modulation scheme. To solve this problem, we propose a plug-and-play discrete modulation continuous variable quantum key distribution based on non-Gaussian state-discrimination detection. That is to say, a non-Gaussian state-discrimination detector is deployed at the receiver. With adaptive measurement method and Bayesian inference, four non-orthogonal coherent states which are based on four-state discrete modulation can be unconditionally distinguished on condition that the error probability is lower than the standard quantum limit. We analyze the security of the proposed protocol by considering both asymptotic limit and finite-size effect. Simulation results show that the secret key rate and maximum transmission distance are significantly enhanced by using no-Gaussian state-discrimination detection even under the influence of the untrusted source noise compared with the original plug-and-play discrete modulation continuous variable quantum key distribution. These results indicate that the proposed scheme can effectively reduce the negative influence of the untrust source noise on the performance of the plug-and-play discrete modulation continuous variable quantum key distribution protocol. The proposed protocol can not only ensure the practical security of the system, but also achieve more efficient and longer transmission distance quantum key distribution.

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.

Continuous-variable quantum key distribution with low-complexity information reconciliation.

Information reconciliation is an essential step of continuous-variable quantum key distribution (CV-QKD) because its efficiency affects both the maximum transmission distance and the final secret key rate of the whole system. Slice reconciliation can achieve high secret key rates for the CV-QKD systems under high signal-to-noise ratios (SNRs). However, it suffers from the high designing cost of the error-correcting codes in the multi-level coding and multi-stage decoding step. To reconcile one set of data with fixed SNR, multiple error-correcting codes with different code rates need to be designed. If the channel environment changed, the code rates need to change along to maintain high reconciliation efficiency, making it complicated and costly. In this paper, we introduce polar codes into slice reconciliation and proposed a scheme that is simply constructed, effectively performed, and well adapted to the systems with wide-range and variational SNRs. Simulation results show that the proposed scheme offers reconciliation efficiency over 95% for the systems with SNRs range from 1 to 10, which can support the systems with high secret key rates. The decrease of complexity and the increase of secret key rate have great significance for a practical CV-QKD system.

A Code Rate-Compatible High-Throughput Hardware Implementation Scheme for QKD Information Reconciliation

For high-speed quantum key distribution (QKD) post processing, information reconciliation is the most computational step, which usually acts as the system speed bottleneck. Reconciliation efficiency and operation throughput are the two most important performance parameters, but they are often compromised to each other in actual realization due to the available hardware resources. Another characteristic of the information reconciliation is that its channel is time-varying, and in order to guarantee high efficiency, some rate-compatible error correction scheme should be adopted. To cope with the above problems, this paper proposes a rate-compatible high-efficiency reconciliation algorithm based on quasi-cyclic (QC) low-density parity-check (LDPC) codes and puncturing algorithms. On the other hand, in order to obtain high throughput while maintaining low implementation complexity, the normalized min-sum algorithm (NMSA) is realized and optimized by using the fast prototyping tool of high-level synthesis (HLS). The proposed information reconciliation module was implemented on the Xilinx Zynq Ultrascale+ ZCU102 development board. Experimental results show that the maximum throughput rate of the implemented reconciliation module in this paper can reach 136 Mbps, while the efficiency factor is kept lower than 1.32 across the error rate range of 1.7%∼10.6% under the remaining frame error rate level of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">−3</sup> . The comprehensive good performance obtained by our design can strongly support the development of modern high-speed QKD systems.

High performance reconciliation for practical quantum key distribution systems

Quantum key distribution (QKD) is a promising technique for secure communication based on quantum mechanical principles. To improve the secure key rate (SKR) of a practical QKD system, most studies on reconciliation primarily focused on improving the reconciliation efficiency. With the increasing performance of practical QKD systems, the research priority has shifted to the improvement of both throughput and efficiency. In this paper, we propose a high-performance solution of Cascade reconciliation, including a high-throughput-oriented framework and an integrated-optimization-oriented scheme. Benefiting from the fully utilizing computation and storage resources, effectively dealing with communication delays, the integrated-optimization-oriented parameters setting, etc., an excellent overall performance was achieved. Experimental results showed that, the throughput of up to 570 Mbps with an efficiency of 1.038 was achieved, which, to our knowledge, was more than four times faster than any throughput previously demonstrated. Furthermore, throughputs on real data sets were capable of reaching up to 86 Mbps even on embedded platforms. Additionally, our solution offers good adaptability to the fluctuating communication delay and quantum bit error rate (QBER). Based on our study, low performance (i.e. low power-consumption and cost-effective) CPU platforms will be sufficient for reconciliation in the existing and near-term QKD systems.

Discrete modulation continuous-variable measurement-device-independent quantum key distribution scheme based on realistic detector compensation

Discrete modulation continuous variable measurement device independent quantum key distribution scheme has good compatibility with efficient error correction codes, which leads to high reconciliation efficiency even at low signal-to-noise ratio. Besides, the implementation of this protocol is simpler than that of Gaussian modulation scheme. However, the quantum efficiency of homodyne detector commonly used in the experiment is only 0.6, which will seriously affect the practical application performance of discrete modulation continuous variable measurement device independent quantum key distribution scheme. To solve this problem, we propose a discrete modulation continuous variable measurement device independent quantum key distribution scheme based on realistic detector compensation. In our scheme, for the outputs of two quantum channels, each adopts a phase sensitive amplifier to compensate for the corresponding realistic homodyne detector. The simulation results show that the phase sensitive amplifier can well compensate for the quantum efficiency of the realistic detector and effectively improve the performance of the discrete modulation continuous variable measurement device independent quantum key distribution scheme with realistic detector in terms of secret key rate and secure transmission distance. The proposed protocol provides an effective method for promoting the practical development of the discrete modulation continuous variable measurement device independent quantum key distribution scheme.

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 , 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 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.

A Lean Approach to Evaluating Prescribing Errors in Medication Reconciliation.

We evaluated medication reconciliation processes of a qualitative case study at a 1000-bed public hospital. Lean tools were applied to identify factors contributing to prescribing errors and propose process improvement. Errors were attributed to the prescriber's skills, high workload, staff shortage, poor user attitude and rigid system function. Continuous evaluation of medication reconciliation efficiency is imperative to identify and mitigate errors and increase patient safety.

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 dB. 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.

Virtual channel of multidimensional reconciliation in a continuous-variable quantum key distribution

The well-known multidimensional reconciliation is a significant stage of a continuous-variable quantum key distribution (CVQKD) system, which uses $d$-dimensional rotations to build a virtual channel between authenticated parties, Alice and Bob. Generally, a block low-density parity-check code with a belief-propagation (BP) iterative decoding algorithm, which is optimized for an additive white Gaussian noise channel, is always used in multidimensional reconciliation for the CVQKD system. In this paper, we study the signal-to-noise ratio (SNR) of the virtual channel of multidimensional reconciliation in CVQKD and prove that the noise of the virtual channel follows the Student's $t$-distribution. Therefore, we propose a $t$-BP decoding algorithm, which can be better applied to multidimensional reconciliation. Simulation results show that the frame error rate (FER) with the proposed $t$-BP decoding algorithm is superior to that with the conventional BP decoding algorithm applied to multidimensional reconciliation. Subsequently, the FER improvement results in significant influence on reconciliation efficiency and secret key rate of the CVQKD system.

Shannon-limit approached information reconciliation for quantum key distribution

Information reconciliation (IR) corrects the errors in sifted keys and ensures the correctness of quantum key distribution (QKD) systems. Polar codes-based IR schemes can achieve high reconciliation efficiency; however, the incidental high frame error rate decreases the secure key rate of QKD systems. In this article, we propose a Shannon-limit approached (SLA) IR scheme, which mainly contains two phases: the forward reconciliation phase and the acknowledgment reconciliation phase. In the forward reconciliation phase, the sifted key is divided into sub-blocks and performed with the improved block checked successive cancellation list decoder of polar codes. Afterward, only the failure corrected sub-blocks perform the additional acknowledgment reconciliation phase, which decreases the frame error rate of the SLA IR scheme. The experimental results show that the overall failure probability of SLA IR scheme is decreased to 10^{-8} and the efficiency is improved to 1.091 with the IR block length of 128 Mb. Furthermore, the efficiency of the proposed SLA IR scheme is 1.055, approached to Shannon limit, when the quantum bit error rate is 0.02 and the input scale of 1 Gb, which is hundred times larger than the state-of-the-art implemented polar codes-based IR schemes.