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/0505146 · Physical Review A

Robustness of a quantum key distribution with two and three mutually unbiased bases

Filippo Caruso, Helle Bechmann-Pasquinucci, Chiara Macchiavello

Published Sep 30, 2005• 17 citations
arXivHTMLPDF

Abstract

We study the robustness of various protocols for quantum key distributions. We first consider the case of qutrits and study quantum protocols that employ two and three mutually unbiased bases. We then derive the optimal eavesdropping strategy for two mutually unbiased bases in dimension 4 and generalize the result to a quantum key distribution protocol that uses two mutually unbiased bases in arbitrary finite dimensions.

DOI
10.1103/physreva.72.032340

Related papers

Security bound of two-basis quantum-key-distribution protocols using qudits

Georgios M. Nikolopoulos, G. Alber

We investigate the security bounds of quantum-cryptographic protocols using $d$-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.

arXiv:quant-ph/0507221•Physical Review A•Sep 16, 2005•59 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

Scalable implementation of (d+1) mutually unbiased bases for d -dimensional quantum key distribution

Takuya Ikuta, Seiseki Akibue, Yuya Yonezu +3 more

A scalable implementation of ($d$ + 1) mutually unbiased bases is proposed for prime power dimensions, where these bases can ensure a security of a robust $d$-dimensional quantum key distribution protocol.

arXiv:2204.02691•Physical Review Research•Oct 12, 2022•15 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

General quantum key distribution in higher dimension

Zhao-Xi Xiong, Handuo Shi, Yi-Nan Wang +4 more

We study a general quantum key distribution protocol in higher dimension. In this protocol, quantum states in arbitrary $g+1$ ($1\ensuremath{\le}g\ensuremath{\le}d$) out of all $d+1$ mutually unbiased bases in a $d$-dimensional system can be used for the key encoding. This provides a natural generalization of the quantum key distribution in higher dimension and recovers the previously known results for $g=1$ and $d$. In our investigation, we study Eve's attack by two slightly different approaches. One is considering the optimal cloner of Eve, and the other, defined as the optimal attack, is maximizing Eve's information. We derive results for both approaches and show the deviation of the optimal cloner from the optimal attack. With our systematic investigation of the quantum key distribution protocols in higher dimension, one may balance the security gain and the implementation cost by changing the number of bases in the key encoding. As a side product, we also prove the equivalency between the optimal phase covariant quantum cloning machine and the optimal cloner for the $g=d\ensuremath{-}1$ quantum key distribution.

arXiv:1108.4540•Physical Review A•Jan 31, 2012•17 citations

Optimal Protocols and Tradeoffs in Quantum Key Distribution

Joseph M. Renes

Quantum key distribution protocols based on equiangular spherical codes are introduced and a security comparison made to random and unbiased‐bases schemes in two and three dimensions. Attention is limited to intercept/resend attacks for simplicity. In each case, a general tradeoff between eavesdropper resistance and key generation speed is observed, with the largest possible spherical code found to be the most robust, inviting the question of their optimality in general.

AIP conference proceedings•Jan 1, 2004•2 citations
We study the robustness of various protocols for quantum key distributions. We first consider the case of qutrits and study quantum protocols that employ two and three mutually unbiased bases. We then derive the optimal eavesdropping strategy for two mutually unbiased bases in dimension 4 and generalize the result to a quantum key distribution protocol that uses two mutually unbiased bases in arbitrary finite dimensions.
We investigate the security bounds of quantum-cryptographic protocols using ddd-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.
A scalable implementation of (ddd + 1) mutually unbiased bases is proposed for prime power dimensions, where these bases can ensure a security of a robust ddd-dimensional quantum key distribution protocol.
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.
We study a general quantum key distribution protocol in higher dimension. In this protocol, quantum states in arbitrary g+1g+1g+1 ($1\ensuremath{\le}g\ensuremath{\le}d$) out of all d+1d+1d+1 mutually unbiased bases in a ddd-dimensional system can be used for the key encoding. This provides a natural generalization of the quantum key distribution in higher dimension and recovers the previously known results for g=1g=1g=1 and ddd. In our investigation, we study Eve's attack by two slightly different approaches. One is considering the optimal cloner of Eve, and the other, defined as the optimal attack, is maximizing Eve's information. We derive results for both approaches and show the deviation of the optimal cloner from the optimal attack. With our systematic investigation of the quantum key distribution protocols in higher dimension, one may balance the security gain and the implementation cost by changing the number of bases in the key encoding. As a side product, we also prove the equivalency between the optimal phase covariant quantum cloning machine and the optimal cloner for the $g=d\ensuremath{-}1$ quantum key distribution.