Twin-field quantum key distribution (TF-QKD), which is immune to all possible detector side channel attacks, enables two remote legitimate users to perform secure communications without quantum repeaters. With the help of a central node, TF-QKD is expected to overcome the linear key-rate constraint using current technologies. However, the security of the former TF-QKD protocols relies on the hypothesis of infinite-key and stable sources. In this paper, we present the finite-key analysis of a practical decoy-state twin-field quantum key distribution with variant statistical fluctuation models. We examine the composable security of the protocol with intensity fluctuations of unstable sources employing Azuma's inequality. Our simulation results indicate that the secret key rate is able to surpass the linear key-rate bound with limited signal pulses and intensity fluctuations. In addition, the effect of intensity fluctuations is extremely significant for small size of total signals.
Twin-field quantum key distribution (TF-QKD), which is immune to all possible detector side channel attacks, enables two remote legitimate users to perform secure communications without quantum repeaters. With the help of a central node, TF-QKD is expected to overcome the linear key-rate constraint using current technologies. However, the security of the former TF-QKD protocols relies on the hypothesis of infinite-key and stable sources. In this paper, we present the finite-key analysis of a practical decoy-state twin-field quantum key distribution with variant statistical fluctuation models. We examine the composable security of the protocol with intensity fluctuations of unstable sources employing Azuma's inequality. Our simulation results indicate that the secret key rate is able to surpass the linear key-rate bound with limited signal pulses and intensity fluctuations. In addition, the effect of intensity fluctuations is extremely significant for small size of total signals.
Abstract Twin-field quantum key distribution (TF-QKD) is a disruptive innovation which is able to overcome the rate-distance limit of QKD without trusted relays. Since the proposal of the first TF-QKD protocol, theoretical and experimental breakthroughs have been made to enhance its ability. However, there still exist some practical issues waiting for settlement. In this paper, we examine the performances of asymmetric TF-QKD protocol with unstable light sources and limited data sizes. The statistical fluctuations of the parameters are estimated employing Azuma’s inequality. Through numerical simulations, we compare the secret key rates of the asymmetric TF-QKD protocol with different data sizes and variant intensity fluctuation magnitudes. Our results demonstrate that both statistical and intensity fluctuations have significant impacts on the performance of asymmetric TF-QKD.
Long-distance quantum key distribution (QKD) has long time seriously relied on trusted relay or quantum repeater, which either has security threat or is far from practical implementation. Recently, a solution called twin-field (TF) QKD and its variants have been proposed to overcome this challenge. However, most security proofs are complicated, a majority of which could only ensure security against collective attacks. Until now, the full and simple security proof can only be provided with asymptotic resource assumption. Here, we provide a composable finite-key analysis for coherent-state-based TF-QKD with rigorous security proof against general attacks. Furthermore, we develop the optimal statistical fluctuation analysis method to significantly improve secret key rate in high-loss regime. The results show that coherent-state-based TF-QKD is practical and feasible, with the potential to apply over nearly one thousand kilometers.
Abstract Twin-Field quantum key distribution (TF-QKD) and its variants, e.g. phase-maching QKD, sending-or-not-sending QKD, and no phase post-selection TFQKD promise high key rates at long distance to beat the rate distance limit without a repeater. The security proof of these protocols are based on decoy-state method, which is usually performed by actively modulating a variable optical attenuator together with a random number generator in practical experiments, however, active-decoy schemes like this may lead to side channel and could open a security loophole. To enhance the source security of TF-QKD, in this paper, we propose passive-decoy based TF-QKD, in which we combine TF-QKD with the passive-decoy method. And we present a simulation comparing the key generation rate with that in active-decoy, the result shows our scheme performs as good as active decoy TF-QKD, and our scheme could reach satisfactory secret key rates with just a few photon detectors. This shows our work is meaningful in practice.
Abstract Twin-field (TF) quantum key distribution (QKD) represents a novel QKD approach whose principal merit is to beat the point-to-point private capacity of a lossy quantum channel, thanks to performing single-photon interference in an untrusted node. Indeed, recent security proofs of various TF-QKD type protocols have confirmed that the secret key rate of these schemes scales essentially as the square root of the transmittance of the channel. Here, we focus on the TF-QKD protocol introduced by Curty et al, whose secret key rate is nearly an order of magnitude higher than previous solutions. Its security relies on the estimation of the detection probabilities associated to various photon-number states through the decoy-state method. We derive analytical bounds on these quantities assuming that each party uses either two, three or four decoy intensity settings, and we investigate the protocol’s performance in this scenario. Our simulations show that two decoy intensity settings are enough to beat the point-to-point private capacity of the channel, and that the use of four decoys is already basically optimal, in the sense that it almost reproduces the ideal scenario of infinite decoys. We also observe that the protocol seems to be quite robust against intensity fluctuations of the optical pulses prepared by the parties.
Quantum key distribution (QKD) can help two distant peers to share secret key bits, whose security is guaranteed by the law of physics. In practice, the secret key rate of a QKD protocol is always lowered with the increasing of channel distance, which severely limits the applications of QKD. Recently, twin-field (TF) QKD has been proposed and intensively studied, since it can beat the rate-distance limit and greatly increase the achievable distance of QKD. Remarkalebly, K. Maeda et. al. proposed a simple finite-key analysis for TF-QKD based on operator dominance condition. Although they showed that their method is sufficient to beat the rate-distance limit, their operator dominance condition is not general, i.e. it can be only applied in three decoy states scenarios, which implies that its key rate cannot be increased by introducing more decoy states, and also cannot reach the asymptotic bound even in case of preparing infinite decoy states and optical pulses. Here, to bridge this gap, we propose an improved finite-key analysis of TF-QKD through devising new operator dominance condition. We show that by adding the number of decoy states, the secret key rate can be furtherly improved and approach the asymptotic bound. Our theory can be directly used in TF-QKD experiment to obtain higher secret key rate. Our results can be directly used in experiments to obtain higher key rates.
The decoy-state quantum key distribution (QKD) protocol has been widely used in commercial QKD systems. Several QKD field networks show its practicability and commercial prospects. Importantly, practical decoy-state QKD systems should be characterized with device imperfections. In this paper, for the case without intensity fluctuations, we present the parameter estimation based on the Chernoff bound for a practical decoy-state QKD protocol and compare performances of that based on Hoeffding's inequality and the Chernoff bound, respectively. Taking intensity fluctuations into consideration, we present the finite-key analysis with composable security against general attacks based on Azuma's inequality. Our numerical results show that the finite-key analysis based on the Chernoff bound is tighter than Hoeffding's inequality when the total number of transmitting signals $N<1\ifmmode\times\else\texttimes\fi{}{10}^{12}$. Moreover, the intensity fluctuations' influence is more obvious when the data size of total transmitting signals is small. Our results emphasize the importance of the stability of the intensity modulator as well as the accurate estimation of emitted pulse's intensity.