Tight asymptotic key rate for the BB84 protocol with local randomisation and device imprecisions
Erik Woodhead

TL;DR
This paper derives a tight asymptotic key rate bound for the BB84 quantum key distribution protocol incorporating local randomisation and device imperfections, showing improved security thresholds and optimal attack strategies.
Contribution
It extends security analysis of BB84 to include local randomisation in imperfect setups, providing tight bounds and explicit attack constructions.
Findings
Improved threshold noise from 11% to 12.41% with local randomisation.
Derived tight asymptotic key rate bounds for imperfect BB84 implementations.
Constructed explicit source states and attacks achieving the bounds.
Abstract
Local randomisation is a preprocessing procedure in which one of the legitimate parties of a quantum key distribution (QKD) scheme adds noise to their version of the key and was found by Kraus et al. [Phys. Rev. Lett. 95, 080501 (2005)] to improve the security of certain QKD protocols. In this article, the improvement yielded by local randomisation is derived for an imperfect implementation of the BB84 QKD protocol, in which the source emits four given but arbitrary pure states and the detector performs arbitrarily-aligned measurements. Specifically, this is achieved by modifying an approach to analysing the security of imperfect variants of the BB84 protocol against collective attacks, introduced in [Phys. Rev. A 88, 012331 (2013)], to include the additional preprocessing step. The previously known improvement to the threshold channel noise, from 11\% to 12.41\%, is recovered in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
