Improved key rate bounds for practical decoy-state quantum key distribution systems

Abstract

The decoy-state scheme is the most widely implemented quantum key distribution protocol in practice. In order to account for the finite-size key effects on the achievable secret key generation rate, a rigorous statistical fluctuation analysis is required. Originally, a heuristic Gaussian-approximation technique was used for this purpose, which, despite of its analytical convenience, was not sufficiently rigorous. The fluctuation analysis has recently been made rigorous by using the Chernoff bound. There is a considerable gap, however, between the key rate bounds obtained from these new techniques and that obtained from the Gaussian assumption. Here, we develop a tighter bound for the decoy-state method, which yields a smaller failure probability. This improvement results in a higher key rate and increases the maximum distance over which secure key exchange is possible. By optimizing the system parameters, our simulation results show that our new method almost closes the gap between the two previously proposed techniques and achieves a similar performance to that of conventional Gaussian approximations.

34 pages, 5 figures

References in corpus (7)

• Quantum key distribution over 122 km of standard telecom fiber
• Experimental Long-Distance Decoy-State Quantum Key Distribution Based On Polarization Encoding
• Long distance decoy state quantum key distribution in optical fiber
• Statistical fluctuation analysis for measurement-device-independent quantum key distribution
• General theory of decoy-state quantum cryptography with source errors
• Discrete-phase-randomized coherent state source and its application in quantum key distribution
• Unconditional security at a low cost

Cited by in corpus (3)

• Space division multiplexing chip-to-chip quantum key distribution
• Memory-Assisted Quantum Key Distribution with a Single Nitrogen Vacancy Center
• Quantum key distribution protocol with pseudorandom bases