Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0203095 · Optics and Spectroscopy

Optimal dimensionality for quantum cryptography

D. B. Horoshko, S. Ya. Kilin

Published May 1, 2003• 6 citations
arXivHTMLPDF

Abstract

A comparison of two protocols for generating a cryptographic key composed from d -valued symbols, one using a string of independent qubits and another utilizing d -level systems prepared in states belonging to d + 1 mutually unbiased bases, is performed. The protocol based on qubits is shown to be optimal for quantum cryptography, since it provides higher security and a higher key generation rate.

DOI
10.1134/1.1576836

Related papers

Optimal dimensionality for quantum cryptography

D. B. Horoshko, S. Ya. Kilin

Two protocols are compared for sharing between Alice and Bob a cryptographic key composed from quarts. The first protocol uses a ququart (4-level system) prepared in one of 5 mutually biased bases. The second one uses two independent qubits, each being prepared in one of 3 mutually unbiased bases. Information gained by the eavesdropper Eve is calculated, suggesting that she uses an asymmetric cloner for cloning individual systems.

European Quantum Electronics Conference (EQEC)•Nov 15, 2004•0 citations

Security of Quantum Key Distribution Using d -Level Systems

Nicolas J. Cerf, Mohamed Bourennane, Anders Karlsson +1 more

We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e., quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while the second exploits all d+1 available such bases (extending the six-state protocol for qubits). We derive the information gained by a potential eavesdropper applying a cloning-based individual attack, along with an upper bound on the error rate that ensures unconditional security against coherent attacks.

arXiv:quant-ph/0107130•Physical Review Letters•Mar 8, 2002•1,355 citations

Quantum Cryptography with 3-State Systems

Helle Bechmann-Pasquinucci, Asher Peres

We consider quantum cryptographic schemes where the carriers of information are 3-state particles. One protocol uses four mutually unbiased bases and appears to provide better security than obtainable with 2-state carriers. Another possible method allows quantum states to belong to more than one basis. Security is not better, but many curious features arise.

arXiv:quant-ph/0001083•Physical Review Letters•Oct 9, 2000•557 citations

Qudits in Two Way Deterministic Quantum Key Distribution

Jesni Shamsul Shaari, Mohamed Ridza Wahiddin, Stefano Mancini

Development in two way deterministic quantum cryptography protocols using qubits and qutrits have seen the nontrivial generalization of the protocol to accommodate the use of all mutually unbiased bases (MUB). Here we consider the extension of the protocols to qudits (quantum systems of d dimensional Hilbert space) and note the security as well as practical efficiencies. We conclude that a practical solution when scaling to higher dimensions would not include exploiting the use of all MUB.

International Conference on Quantum Information•Jan 1, 2007•0 citations

Quantum Cryptography in d-dimensional Hilbert spaces

Anita Eusebi

The topic of this thesis is Quantum Cryptography. Based on the laws of Quantum Mechanics, this allows two parties to share a secure key, by using quantum states to carry classical information. Namely, the Quantum Key Distribution (QKD) process, completed with the classical algorithm One Time Pad, leads to an unconditionally secure cryptosystem. Most QKD protocols, like the famous BB84, are realized on unidirectional quantum channels and have probabilistic character. Recently, a new protocol, named LM05, has been proposed, which works on bidirectional quantum channels and in a deterministic way. This thesis is mainly concerned with protocols extending LM05 from binary to d-ary alphabets (dmajor2), by using multi-level quantum systems in d-dimensional Hilbert spaces. The construction of such protocols relies on the notion of Mutually Unbiased Bases (MUB). But the total number of MUB in a Hilbert space of dimension d is known only if d is a prime power. Accordingly, the new protocols are realized under this assumption. As a preliminary step, an explicit expression for MUB encompassing powers of both even and odd primes is discussed. The first proposed extension, called EM09, uses shift operators on MUB to encode information and the usual quantum measurement to realize the control procedure. This guarantees maximal security for dimension d=3 against a powerful individual attack. The second extension, named EM11, is characterized by an innovative control strategy based on a suitable unitary transformation rather than on quantum measurement. Such protocol only works for d an odd prime power, due to the particular choice of the control operator, which is proved to be the only possible with the required properties. The EM11 protocol leads to a relevant improvement. In fact, the security against the same attack is much better than in the EM09 and it increases in terms of the dimension d. Some partial results are also obtained about the possible extensions of the probabilistic protocol called SARG04 to higher dimensions. Finally, it is considered the use of the EM09 and EM11 protocols in the Quantum Direct Communication, where the meaningful message is transmitted without any encryption, as allowed by their deterministic character. In this context, the asymptotic security turns out to be optimal in dimension d=2 for EM09 and in dimension d=3 for EM11.

•Oct 13, 2011•0 citations

Qunits in Two Way Quantum Key Distribution

Jesni Shamsul Shaari, Mohamed Ridza Wahiddin

Works in two way deterministic quantum cryptography protocols using qubits and qutrits have seen the nontrivial generalization of the protocol to accommodate the use of all mutually unbiased bases (MUB). Here we consider the use of qunits (quantum systems of n dimensional Hilbert space) in a similar protocol and working with cases where the number of MUB is n +1 we show that n qunits are necessary to generalize the use of all available MUBs. We also provide a recipe that would allow for encoding with unitary efficiency.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Jan 1, 2007•1 citation
A comparison of two protocols for generating a cryptographic key composed from d -valued symbols, one using a string of independent qubits and another utilizing d -level systems prepared in states belonging to d + 1 mutually unbiased bases, is performed. The protocol based on qubits is shown to be optimal for quantum cryptography, since it provides higher security and a higher key generation rate.
We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e., quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while the second exploits all d+1 available such bases (extending the six-state protocol for qubits). We derive the information gained by a potential eavesdropper applying a cloning-based individual attack, along with an upper bound on the error rate that ensures unconditional security against coherent attacks.
The topic of this thesis is Quantum Cryptography. Based on the laws of Quantum Mechanics, this allows two parties to share a secure key, by using quantum states to carry classical information. Namely, the Quantum Key Distribution (QKD) process, completed with the classical algorithm One Time Pad, leads to an unconditionally secure cryptosystem. Most QKD protocols, like the famous BB84, are realized on unidirectional quantum channels and have probabilistic character. Recently, a new protocol, named LM05, has been proposed, which works on bidirectional quantum channels and in a deterministic way. This thesis is mainly concerned with protocols extending LM05 from binary to d-ary alphabets (dmajor2), by using multi-level quantum systems in d-dimensional Hilbert spaces. The construction of such protocols relies on the notion of Mutually Unbiased Bases (MUB). But the total number of MUB in a Hilbert space of dimension d is known only if d is a prime power. Accordingly, the new protocols are realized under this assumption. As a preliminary step, an explicit expression for MUB encompassing powers of both even and odd primes is discussed. The first proposed extension, called EM09, uses shift operators on MUB to encode information and the usual quantum measurement to realize the control procedure. This guarantees maximal security for dimension d=3 against a powerful individual attack. The second extension, named EM11, is characterized by an innovative control strategy based on a suitable unitary transformation rather than on quantum measurement. Such protocol only works for d an odd prime power, due to the particular choice of the control operator, which is proved to be the only possible with the required properties. The EM11 protocol leads to a relevant improvement. In fact, the security against the same attack is much better than in the EM09 and it increases in terms of the dimension d. Some partial results are also obtained about the possible extensions of the probabilistic protocol called SARG04 to higher dimensions. Finally, it is considered the use of the EM09 and EM11 protocols in the Quantum Direct Communication, where the meaningful message is transmitted without any encryption, as allowed by their deterministic character. In this context, the asymptotic security turns out to be optimal in dimension d=2 for EM09 and in dimension d=3 for EM11.
Works in two way deterministic quantum cryptography protocols using qubits and qutrits have seen the nontrivial generalization of the protocol to accommodate the use of all mutually unbiased bases (MUB). Here we consider the use of qunits (quantum systems of n dimensional Hilbert space) in a similar protocol and working with cases where the number of MUB is n +1 we show that n qunits are necessary to generalize the use of all available MUBs. We also provide a recipe that would allow for encoding with unitary efficiency.