Final Secret Key Rate Research Articles

Experimental Demonstration of LLO Continuous-Variable Quantum Key Distribution With Polarization Loss Compensation

The compensation process for the state of polarization (SOP) from quantum signal plays an important role in the practical implementation of continuous-variable quantum key distribution (CV-QKD). In contrast to the previous scheme using an expensive digital dynamic polarization controller, we choose a cheaper manual polarization controller interfaced with a digital algorithm based on Kalman filter to achieve compensation of the polarization loss under the condition that the SOP of the fiber is relatively stable. This paper also enumerates the details of other digital signal processing method to achieve final secret key rate. And a pilot-sequential Gaussian modulated coherent state (GMCS) continuous-variable quantum key distribution system with a local local oscillator (LLO) is experimentally implemented based on the analysis of excess noise. Finally, the experimental results show that the method of polarization loss compensation takes advantages in maintaining the stability of the final secret key rate. And a secret key rate of 110 kbps is achieved within 20 km optical fiber (with 4 dB loss) under the finite-size block of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$1 \times {10^{6}}$</tex-math></inline-formula> during a more extended time in the laboratory.

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.

Improved polar-code-based efficient post-processing algorithm for quantum key distribution

Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner’s wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.

Weak Randomness Analysis of Measurement-Device-Independent Quantum Key Distribution with Finite Resources

The ideal quantum key distribution (QKD) protocol requires perfect random numbers for bit encoding and basis selecting. Perfect randomness is of great significance to the practical QKD system. However, due to the imperfection of practical quantum devices, an eavesdropper (Eve) may acquire some random numbers, thus affecting the security of practical systems. In this paper, we analyze the effects of the weak randomness in the measurement-device-independent QKD (MDI-QKD) with finite resources. We analytically derive concise formulas for estimating the lower bound of the single-photon yield and the upper bound of the phase error rate in the case of the weak randomness. The simulation demonstrates that the final secret key rate of MDI-QKD with finite resources is sensitive to state preparation, even with a small proportion of weak randomness, the secure key rate has a noticeable fluctuation. Therefore, the weak randomness of the state preparation may bring additional security risks. In order to ensure the practical security of the QKD system, we are supposed to strengthen the protection of state preparation devices.

Strengthening practical continuous-variable quantum key distribution against measurement angular error.

The optical phase shifter that constantly rotates the local oscillator phase is a necessity in continuous-variable quantum key distribution systems with heterodyne detection. In previous experimental implementations, the optical phase shifter is generally regarded as an ideal passive optical device that perfectly rotates the phase of the electromagnetic wave of 90∘. However, the optical phase shifter in practice introduces imperfections, mainly the measurement angular error, which inevitably deteriorates the security of the practical systems. Here, we will give a concrete interpretation of measurement angular error in practical systems and the corresponding entanglement-based description. Subsequently, from the parameter estimation, we deduce the overestimated excess noise and the underestimated transmittance, which lead to a reduction in the final secret key rate. Simultaneously, we propose an estimation method of the measurement angular error. Next, the practical security analysis is provided in detail, and the effect of the measurement angular error and its corresponding compensation scheme are demonstrated. We conclude that measurement angular error severely degrades the security, but the proposed calibration and compensation method can significantly help improve the performance of the practical CV-QKD systems.

Continuous-variable quantum cryptography with discrete alphabets: Composable security under collective Gaussian attacks

We consider continuous-variable quantum key distribution with discrete-alphabet encodings. In particular, we study protocols where information is encoded in the phase of displaced coherent (or thermal) states, even though the results can be directly extended to any protocol based on finite constellations of displaced Gaussian states. In this setting, we provide a composable security analysis in the finite-size regime assuming the realistic but restrictive hypothesis of collective Gaussian attacks. Under this assumption, we can efficiently estimate the parameters of the channel via maximum likelihood estimators and bound the corresponding error in the final secret key rate.

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

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.

Blind information reconciliation with variable step sizes for quantum key distribution

Quantum key distribution (QKD) generates symmetric keys between two authenticated parties with the guarantee of information-theoretically security. A vital step in QKD to obtain fully-matched key between two parties is information reconciliation. The blind reconciliation protocol provides a useful tool that corrects the mismatch in a wide range of qubit error rate (QBER) but without a prior error estimation. However, there is a contradiction between the reconciliation efficiency and the processing time in this protocol. In this work, we propose a blind reconciliation protocol with variable step sizes to relieve this contradiction. The analysis and simulation results show that the improved protocol inherits all the advantages of the original blind reconciliation protocol and can obtain better reconciliation efficiency with less operation time. The improved blind reconciliation protocol enhances the final secret key rate and accelerates the processing speed of a QKD system.

Small imperfect randomness restricts security of quantum key distribution

Quantum key distribution protocol requires true random numbers to prepare and measure quantum states, but the randomness may be weakened by applying the imperfect input random numbers or imperfect quantum devices. In this work, we propose the randomness attack model in the practical quantum key distribution system, and we analyze the final secret key rate under the randomness attack. The security analysis result demonstrates that the imperfect randomness can be amplified by considering the signal loss, thus the quantum key distribution system may be attacked even if the randomness has very small part of imperfection. Combining the practical experimental parameters with the small nonrandom probability parameters $0.1%$ and $1%$, we prove that the maximal transmission distance will be sharply reduced from 140 km to 60 and 12 km, respectively.

Parameter optimization of cascade in quantum key distribution

Quantum key distribution (QKD) protocol mainly includes two stages: signal transmission stage based on quantum channel and post-processing stage based on classical channel, and the post-processing stage has gradually become a bottleneck restricting the high performance of QKD. Information reconciliation (IR) is a key step in post-processing. Cascade has been widely used in IR due to its excellent error correction performance. In this study, we analyze original Cascade and adjust parameters to improve the partition strategy. As a result, more errors are corrected under near-optimal conditions. We consider both reconciliation efficiency and frame error rate to measure protocol performance. Simulation shows that the improved Cascade can effectively improve the reconciliation efficiency while ensuring a small frame error rate. Overall, our improved Cascade has better performance on the final secret key rate.

Measurement-device-independent entanglement-based quantum key distribution

We present a quantum key distribution protocol in a model in which the legitimate users gather statistics as in the measurement-device-independent entanglement witness to certify the sources and the measurement devices. We show that the task of measurement-device-independent quantum communication can be accomplished based on monogamy of entanglement, and it is fairly loss tolerate including source and detector flaws. We derive a tight bound for collective attacks on the Holevo information between the authorized parties and the eavesdropper. Then with this bound, the final secret key rate with the source flaws can be obtained. The results show that long-distance quantum cryptography over 144 km can be made secure using only standard threshold detectors.

Security of the Decoy State Two-Way Quantum Key Distribution with Finite Resources**Supported by the National Basic Research Program of China under Grant No 2013CB338002, and the National Natural Science Foundation of China under Grant Nos 11304397 and 61505261.

The quantum key distribution (QKD) allows two parties to share a secret key by typically making use of a one-way quantum channel. However, the two-way QKD has its own unique advantages, which means the two-way QKD has become a focus recently. To improve the practical performance of the two-way QKD, we present a security analysis of a two-way QKD protocol based on the decoy method with heralded single-photon sources (HSPSs). We make use of two approaches to calculate the yield and the quantum bit error rate of single-photon and two-photon pulses. Then we present the secret key generation rate based on the GLLP formula. The numerical simulation shows that the protocol with HSPSs has an advantage in the secure distance compared with weak coherent state sources. In addition, we present the final secret key generation rate of the LM05 protocol with finite resources by considering the statistical fluctuation of the yield and the error rate.

Methods for Improving the Rate of Secret Key Generation based on Wireless Channel Characteristics

Due to non-ideal conditions in the measurements of the wireless channel, high initial bit error rate (BER) in the preliminary key is resulted, which reduces the final secret key generation rate and even causes the secret key generation process fail. Aiming to resolve this problem, we first present and verify an optimal information reconciliation protocol; the validation experiment shows that not only the BER comes down more quickly, but also a higher information rate is achieved. Then, to address the problem of very high initial BER and further improve the efficiency of the secret key generation, we introduce the idea of pre-distillation into the secret key generation system, and present a pre-distillation method, which makes the initial BER comes down quickly, and ensures the subsequent information reconciliation be easily performed; hence the total key generation rate is improved. Experimental results demonstrate that the pre-distillation method has excellent ability of reducing the initial BER, especially in the case of very high initial BER. The combination of our proposed pre-distillation and our optimal information reconciliation is the most efficient one when the initial BER is larger than 0.15, and the information rate is improved by more than forty-nine times when the initial BER is 0.3

25 MHz clock continuous-variable quantum key distribution system over 50 km fiber channel.

In this paper, a practical continuous-variable quantum key distribution system is developed and it runs in the real-world conditions with 25 MHz clock rate. To reach high-rate, we have employed a homodyne detector with maximal bandwidth to 300 MHz and an optimal high-efficiency error reconciliation algorithm with processing speed up to 25 Mbps. To optimize the stability of the system, several key techniques are developed, which include a novel phase compensation algorithm, a polarization feedback algorithm, and related stability method on the modulators. Practically, our system is tested for more than 12 hours with a final secret key rate of 52 kbps over 50 km transmission distance, which is the highest rate so far in such distance. Our system may pave the road for practical broadband secure quantum communication with continuous variables in the commercial conditions.

A study of BB84 protocol in a device-independent scenario: from the view of entanglement distillation

For the past few years, the security of practical quantum key distribution systems has attracted a lot of attention. Device-independent quantum key distribution was proposed to design a real-life secure quantum key distribution system with imperfect and untrusted quantum devices. In this paper, we analyzed the security of BB84 protocol in a device-independent scenario based on the entanglement distillation method. Since most of the reported loopholes are in receivers of quantum key distribution systems, we focus on condition that the transmitter of the system is perfectly coincident with the requirement of the BB84 protocol, while the receiver can be controlled by eavesdropper. Finally, the lower bound of the final secret-key rate was proposed and we explained why the secure-key rate is similar to the well-known result for the original entanglement distillation protocol.

Quantum repeaters and quantum key distribution: Analysis of secret-key rates

We analyze various prominent quantum repeater protocols in the context of long-distance quantum key distribution. These protocols are the original quantum repeater proposal by Briegel, D\"ur, Cirac and Zoller, the so-called hybrid quantum repeater using optical coherent states dispersively interacting with atomic spin qubits, and the Duan-Lukin-Cirac-Zoller-type repeater using atomic ensembles together with linear optics and, in its most recent extension, heralded qubit amplifiers. For our analysis, we investigate the most important experimental parameters of every repeater component and find their minimally required values for obtaining a nonzero secret key. Additionally, we examine in detail the impact of device imperfections on the final secret key rate and on the optimal number of rounds of distillation when the entangled states are purified right after their initial distribution.

Security of quantum key distribution with state-dependent imperfections

In practical quantum key distribution system, the state preparation and measurement have state-dependent imperfections comparing with the ideal BB84 protocol. If the state-dependent imperfection can not be regarded as an unitary transformation, it should not be considered as part of quantum channel noise introduced by the eavesdropper, the commonly used secret key rate formula GLLP can not be applied correspondingly. In this paper, the unconditional security of quantum key distribution with state-dependent imperfections will be analyzed by estimating upper bound of the phase error rate in the quantum channel and the imperfect measurement. Interestingly, since Eve can not control all phase error in the quantum key distribution system, the final secret key rate under constant quantum bit error rate can be improved comparing with the perfect quantum key distribution protocol.

Decoy-state quantum key distribution with practical light source

The performance of active decoy-state quantum key distribution (QKD) system with a practical light source is compared with that of passive decoy-state QKD. The effect of statistical fluctuation due to a finite data size on final secret key rate is analyzed. This procedure is based on the standard error analysis on the assumption that all the variables measured in the experiment fluctuate around their asymptotic values. The relation between key generation rate and secure transmission distance is shown with exchanged quantum efficiency of threshold detector (d=1 and d=0.4) under the condition of active decoy-state (or passive decoy-state ) QKD which we pick the data size to be N=6.0109. This analysis will provide important parameters for practical QKD experiment.

Experimental study on discretely modulated continuous-variable quantum key distribution

We present a discretely modulated continuous-variable quantum key distribution system in free space by using strong coherent states. The amplitude noise in the laser source is suppressed to the shot-noise limit by using a mode cleaner combined with a frequency shift technique. Also, it is proven that the phase noise in the source has no impact on the final secret key rate. In order to increase the encoding rate, we use broadband homodyne detectors and the no-switching protocol. In a realistic model, we establish a secret key rate of 46.8 kbits/s against collective attacks at an encoding rate of 10 MHz for a 90% channel loss when the modulation variance is optimal.

Passive decoy-state quantum key distribution with practical light sources

Decoy states have been proven to be a very useful method for significantly enhancing the performance of quantum key distribution systems with practical light sources. Although active modulation of the intensity of the laser pulses is an effective way of preparing decoy states in principle, in practice passive preparation might be desirable in some scenarios. Typical passive schemes involve parametric down-conversion. More recently, it has been shown that phase-randomized weak coherent pulses (WCP) can also be used for the same purpose [M. Curty et al., Opt. Lett. 34, 3238 (2009).] This proposal requires only linear optics together with a simple threshold photon detector, which shows the practical feasibility of the method. Most importantly, the resulting secret key rate is comparable to the one delivered by an active decoy-state setup with an infinite number of decoy settings. In this article we extend these results, now showing specifically the analysis for other practical scenarios with different light sources and photodetectors. In particular, we consider sources emitting thermal states, phase-randomized WCP, and strong coherent light in combination with several types of photodetectors, like, for instance, threshold photon detectors, photon number resolving detectors, and classical photodetectors. Our analysis includes as well the effect that detection inefficiencies and noise in the form of dark counts shown by current threshold detectors might have on the final secret key rate. Moreover, we provide estimations on the effects that statistical fluctuations due to a finite data size can have in practical implementations.