arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.2628quant-ph

Finite-key analysis for practical implementations of quantum key distribution

Raymond Y. Q. Cai, Valerio Scarani

英文摘要:

The lists of bits processed in quantum key distribution are necessarily of finite length. The need for finite-key unconditional security bounds has been recognized long ago, but the theoretical tools have become available only very recently. We provide finite-key unconditional security bounds for two practical implementations of the Bennett-Brassard 1984 coding: prepare-and-measure implementations without decoy states, and entanglement-based implementations. A finite-key bound for prepare-and-measure implementations with decoy states is also derived under a simplified treatment of the statistical fluctuations. The presentation is tailored to allow direct application of the bounds in experiments. Finally, the bounds are also evaluated on a priori reasonable expected values of the observed parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑