Deterministic Quantum Distribution of a d-ary key
Anita Eusebi, Stefano Mancini
TL;DR
This paper extends a deterministic quantum key distribution protocol to a d-ary alphabet using mutually unbiased bases, analyzing its security and finding maximal security at d=3.
Contribution
It introduces an extension of a quantum key distribution protocol to prime power dimensions and provides explicit expressions for the bases used.
Findings
Security is maximal for d=3.
Explicit expressions for mutually unbiased bases in prime power dimensions.
The protocol's security depends on the dimension d.
Abstract
We present an extension to a d-ary alphabet of a recently proposed deterministic quantum key distribution protocol. It relies on the use of mutually unbiased bases in prime power dimension d, for which we provide an explicit expression. Then, by considering a powerful individual attack, we show that the security of the protocol is maximal for d=3.
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-Dot Cellular Automata · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography