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

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

Georgios M. Nikolopoulos, G. Alber

Published Sep 16, 2005• 59 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.72.032320

Related papers

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

Error tolerance of two-basis quantum-key-distribution protocols using qudits and two-way classical communication

Georgios M. Nikolopoulos, Kedar S. Ranade, G. Alber

We investigate the error tolerance of quantum cryptographic protocols using $d$-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.

arXiv:quant-ph/0602008•Physical Review A•Mar 17, 2006•59 citations

Security bounds in quantum cryptography using d-level systems

Antonio Acín, Nicolas Gisin, Valerio Scarani

We analyze the security of quantum cryptography schemes for d-level systems using 2 or d+1 maximally conjugated bases, under individual eavesdropping attacks based on cloning machines and measurement after the basis reconciliation. We consider classical advantage distillation protocols, that allow to extract a key even in situations where the mutual information between the honest parties is smaller than the eavesdropper's information. In this scenario, advantage distillation protocols are shown to be as powerful as quantum distillation: key distillation is possible using classical techniques if and only if the corresponding state in the entanglement based protocol is distillable.

arXiv:quant-ph/0303009•Quantum Information and Computation•Nov 1, 2003•47 citations

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

Filippo Caruso, Helle Bechmann-Pasquinucci, Chiara Macchiavello

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.

arXiv:quant-ph/0505146•Physical Review A•Sep 30, 2005•17 citations

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

Security of quantum key distributions with entangled qudits

Thomas Durt, Dagomir Kaszlikowski, Jing‐Ling Chen +1 more

We consider a generalization of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by $N$- or $d$-dimensional systems (qudits). In order to study its robustness against optimal incoherent attacks, we derive the information gained by a potential eavesdropper during a cloning-based individual attack. In doing so, we generalize Cerf's formalism for cloning machines and establish the form of the most general cloning machine that respects all the symmetries of the problem. We obtain an upper bound on the error rate that guarantees the confidentiality of qudit generalizations of the Ekert's protocol for qubits.

arXiv:quant-ph/0302078•Physical Review A•Mar 19, 2004•124 citations
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.
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.
We investigate the error tolerance of quantum cryptographic protocols using ddd-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.
We analyze the security of quantum cryptography schemes for d-level systems using 2 or d+1 maximally conjugated bases, under individual eavesdropping attacks based on cloning machines and measurement after the basis reconciliation. We consider classical advantage distillation protocols, that allow to extract a key even in situations where the mutual information between the honest parties is smaller than the eavesdropper's information. In this scenario, advantage distillation protocols are shown to be as powerful as quantum distillation: key distillation is possible using classical techniques if and only if the corresponding state in the entanglement based protocol is distillable.
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.
We consider a generalization of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by NNN- or ddd-dimensional systems (qudits). In order to study its robustness against optimal incoherent attacks, we derive the information gained by a potential eavesdropper during a cloning-based individual attack. In doing so, we generalize Cerf's formalism for cloning machines and establish the form of the most general cloning machine that respects all the symmetries of the problem. We obtain an upper bound on the error rate that guarantees the confidentiality of qudit generalizations of the Ekert's protocol for qubits.