Curator's Take
This research tackles a critical gap between quantum cryptography theory and practice by making mode-pairing quantum key distribution protocols actually implementable in real-world systems. While MP-QKD has shown impressive theoretical performance that surpasses traditional limits, it previously required perfect continuous phase randomization - something impossible to achieve with actual hardware. The new discrete approach demonstrates that just 14 carefully chosen phase settings can match the performance of infinite randomization, while slashing the randomness requirements from unlimited random bits down to just 4 bits. This breakthrough removes a major practical barrier for deploying advanced quantum cryptography systems that can exceed fundamental rate limits without complex phase-locking requirements.
— Mark Eatherly
Summary
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.