Deterministic Quantum Distribution of a d-ary key
classification
🪐 quant-ph
keywords
d-arydeterministicdistributionprotocolquantumalphabetattackbases
read the original 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.
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.