Shor-Preskill Type Security-Proof for the Quantum Key Distribution without Public Announcement of Bases
classification
🪐 quant-ph
keywords
basesannouncementdistributionpublicquantumwithoutbitsdiscuss
read the original abstract
We give a Shor-Preskill type security-proof to the quantum key distribution without public announcement of bases [W.Y. Hwang et al., Phys. Lett. A 244, 489 (1998)]. First, we modify the Lo-Chau protocol once more so that it finally reduces to the quantum key distribution without public announcement of bases. Then we show how we can estimate the error rate in the code bits based on that in the checked bits in the proposed protocol, that is the central point of the proof. We discuss the problem of imperfect sources and that of large deviation in the error rate distributions. We discuss when the bases sequence must be discarded.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.