Journal
QUANTUM INFORMATION PROCESSING
Volume 16, Issue 11, Pages -Publisher
SPRINGER
DOI: 10.1007/s11128-017-1709-5
Keywords
Quantum key distribution; Finite length; Low-density parity-check codes
Funding
- Australian Research Council Discovery Early Career Researcher Award (DECRA) fellowship
- Spanish Ministry of Economy and Competitiveness through project Continuous Variables for Quantum Communications (CVQuCo) [TEC2015-70406-R]
- Vienna Science and Technology Fund (WWTF) [ICT10-067]
- STW
- NWO Vidi grant Large quantum networks from small quantum devices
Ask authors/readers for more resources
The security of quantum key distribution protocols is guaranteed by the laws of quantum mechanics. However, a precise analysis of the security properties requires tools from both classical cryptography and information theory. Here, we employ recent results in non-asymptotic classical information theory to show that one-way information reconciliation imposes fundamental limitations on the amount of secret key that can be extracted in the finite key regime. In particular, we find that an often used approximation for the information leakage during information reconciliation is not generally valid. We propose an improved approximation that takes into account finite key effects and numerically test it against codes for two probability distributions, that we call binary-binary and binary-Gaussian, that typically appear in quantum key distribution protocols.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available