Efficient quantum key distribution scheme with pre-announcing the basis
Jingliang Gao, Changhua Zhu, Heling Xiao

TL;DR
This paper introduces a more efficient quantum key distribution scheme using pre-announced bases, increasing the likelihood of basis matching and security, with broader applicability than previous methods.
Contribution
It presents a novel QKD scheme that improves efficiency and security by pre-announcing bases, extending applicability beyond existing protocols.
Findings
Higher basis matching probability increases efficiency
Security against eavesdropping is proven
Applicable to more quantum channels than previous schemes
Abstract
We devise a new quantum key distribution scheme that is more efficient than the BB84 protocol. By pre-announcing basis, Alice and Bob are more likely to use the same basis to prepare and measure the qubits, thus achieves a higher efficiency. The error analysis is revised and its security against any eavesdropping is proven briefly. Furthermore we show that, compared with the LCA scheme, our modification can be applied in more quantum channels.
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.
