Deterministic Rendering of BB84 for Practical Quantum Cryptography
M. Lucamarini, J. S. Shaari, M. R. B. Wahiddin
TL;DR
This paper presents a deterministic modification of the BB84 quantum cryptography protocol, demonstrating its security, efficiency improvements at small scales, and feasibility with current technology through theoretical and experimental analysis.
Contribution
It introduces a deterministic version of BB84, maintaining security while enhancing efficiency and practicality for current quantum cryptography implementations.
Findings
The deterministic BB84 scheme is as secure as the original.
It offers increased efficiency at small-scale distances.
The scheme is feasible with existing technology.
Abstract
We describe how to modify the BB84 protocol for quantum cryptography in order to make it deterministic. We study both theoretical and experimental aspects of this issue, showing that the new scheme is as secure as the old one, more efficient on small-scale distances, and within the range of current technology.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Quantum Information and Cryptography