The twin-field quantum key distribution (TF-QKD) protocol and its variations have been proposed to overcome the linear Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. One variation called phase-matching QKD (PM-QKD) protocol employs discrete phase randomization and the phase post-compensation technique to improve the key rate quadratically. However, the discrete phase randomization opens a loophole to threaten the actual security. In this paper, we first introduce the unambiguous state discrimination (USD) measurement and the photon-number-splitting (PNS) attack against PM-QKD with imperfect phase randomization. Then, we prove the rigorous security of decoy state PM-QKD with discrete phase randomization. Simulation results show that, considering the intrinsic bit error rate and sifting factor, there is an optimal discrete phase randomization value to guarantee security and performance. Furthermore, as the number of discrete phase randomization increases, the key rate of adopting vacuum and one decoy state approaches infinite decoy states, the key rate between discrete phase randomization and continuous phase randomization is almost the same.
The twin-field quantum key distribution (TF-QKD) protocol and its variations have been proposed to overcome the linear Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. One variation called phase-matching QKD (PM-QKD) protocol employs discrete phase randomization and the phase post-compensation technique to improve the key rate quadratically. However, the discrete phase randomization opens a loophole to threaten the actual security. In this paper, we first introduce the unambiguous state discrimination (USD) measurement and the photon-number-splitting (PNS) attack against PM-QKD with imperfect phase randomization. Then, we prove the rigorous security of decoy state PM-QKD with discrete phase randomization. Simulation results show that, considering the intrinsic bit error rate and sifting factor, there is an optimal discrete phase randomization value to guarantee security and performance. Furthermore, as the number of discrete phase randomization increases, the key rate of adopting vacuum and one decoy state approaches infinite decoy states, the key rate between discrete phase randomization and continuous phase randomization is almost the same.
Due to the single-photon interference at a third untrusted party, the twin-field quantum key distribution (TF-QKD) protocol and its variants can beat the well-known rate-loss bound without quantum repeaters and related experiments have recently been implemented. In general, quantum states in these schemes should be randomly switched between the code mode and the test mode. To adopt the standard decoy-state method, the phases of coherent-state sources in the test mode are assumed to be continuously randomized. However, such a crucial assumption cannot be satisfied well in experimental implementations. In this paper, to bridge the gap between theory and practice, we propose a TF-QKD variant with discrete-phase-randomized sources both in the code mode and the test mode and prove its security against collective attacks. Our simulation results indicate that, with only a small number of discrete phases, the performance of discrete-phase-randomized sources can overcome the rate-loss bound and approach that of continuous-phase-randomized sources.
The twin-field quantum key distribution (TF-QKD) protocol has been studied widely to overcome the linear bound, and several variations of the TF-QKD protocol have been proposed to improve security and practicality. One variation called the phase-matching QKD (PM-QKD) protocol develops an optical-mode-based security; simultaneously, it has a quadratic improvement of key rate without either basis choice or phase locking. So far, the main research work of the PM-QKD protocol has focused on symmetric channels. However, it is quite common that the two channels have asymmetric transmittances in real life. In this paper, we discuss the effects of asymmetric channels on the PM-QKD protocol; to reach a much better performance and achieve a higher key rate, the intensity must be optimized to compensate for channel asymmetry. We also study the practical issues of finite-key effects and intensity fluctuations, which have significant effects on the key rate of PM-QKD.
The phase-matching quantum key distribution (PM-QKD), one of the variants of Twin-Field (TF) QKD protocol, was recently proposed to overcome the rate-distance limits of point to point protocol without quantum repeaters. In this paper, we propose a more practical PM-QKD protocol version with four-intensity decoy states and source errors, since neither the infinite decoy states nor the precise control of the light source is available in practice. We present the formulation of the secure key rate of the proposed protocol and analyze the performances of the protocol with and without source errors by numerical simulations.
Variations of phase-matching measurement-device-independent quantum key distribution (PM-MDI QKD) protocols have been investigated before, but it was recently discovered that this type of protocol (under the name of twin-field QKD) can beat the linear scaling of the repeaterless bound on secret key capacity. We propose a variation of PM-MDI QKD protocol, which reduces the sifting cost and uses non-phase-randomized coherent states as test states. We provide a security proof in the infinite key limit. Our proof is conceptually simple and gives tight key rates. We obtain an analytical key rate formula for the loss-only scenario, confirming the square root scaling and also showing the loss limit. We simulate the key rate for realistic imperfections and show that PM-MDI QKD can overcome the repeaterless bound with currently available technology.
Mode-pairing quantum key distribution (MP-QKD) protocol achieves performance beyond the repeaterless rate-transmittance bound and exhibits excellent practicality by avoiding the requirement for difficult global phase locking. However, the source side of MP-QKD still relies on the assumption of continuous phase randomization, an experimentally infeasible requirement in practice. Therefore, the practical security of the protocol cannot be fully guaranteed. In this work, we propose a discrete-phase-randomized mode-pairing quantum key distribution (DPR-MP-QKD) protocol and analyze the basis-dependence of the source side. Then, we introduce a concrete discrete version of the decoy state method that ensures the security of the DPR-MP-QKD protocol. Finally, simulation results indicate that as the number of discrete phases increases, the key rate performance of DPR-MP-QKD progressively approaches that of the continuous case, with convergence achieved at approximately 14 discrete phases. Moreover, our approach drastically lowers the demand for randomness. While conventional continuous phase randomization demands an unlimited supply of random bits, we show that merely a few bits (e.g., 4) are adequate.
Quantum key distribution (QKD) allows two remote parties to share information-theoretic secret keys. Many QKD protocols assume the phase of encoding state can be continuous randomized from 0 to 2π, which, however, may be questionable in the experiment. This is particularly the case in the recently proposed twin-field (TF) QKD, which has received a lot of attention since it can increase the key rate significantly and even beat some theoretical rate-loss limits. As an intuitive solution, one may introduce discrete-phase randomization instead of continuous randomization. However, a security proof for a QKD protocol with discrete-phase randomization in the finite-key region is still missing. Here, we develop a technique based on conjugate measurement and quantum state distinguishment to analyze the security in this case. Our results show that TF-QKD with a reasonable number of discrete random phases, e.g., 8 phases from {0,π/4,π/2,…,7π/4}, can achieve satisfactory performance. On the other hand, we find the finite-size effects become more notable than before, which implies that more pulses should be emit in this case. More importantly, as a the first proof for TF-QKD with discrete-phase randomization in the finite-key region, our method is also applicable in other QKD protocols.