A Quantum Key Distribution Protocol for qudits with better noise resistance
Zo\'e Amblard, Fran\c{c}ois Arnault

TL;DR
This paper introduces a generalized quantum key distribution protocol for qudits that surpasses previous protocols in noise resistance by utilizing a new Bell inequality, enhancing security and robustness in quantum communication.
Contribution
The paper presents a new qudit-based QKD protocol using the hCHSH-$d$ inequality, achieving superior noise resistance and security against cloning attacks compared to prior protocols.
Findings
Achieves better noise resistance than N-DEB protocol.
Maintains security against cloning attacks.
Uses hCHSH-$d$ inequality involving 2d observables.
Abstract
The Ekert quantum key distribution protocol uses pairs of entangled qubits and performs checks based on a Bell inequality to detect eavesdropping. The N-DEB protocol uses instead pairs of entangled qudits to achieve better noise resistance than the Ekert protocol. It performs checks based on the Bell CGLMP inequality for qudits. In this paper, we present the generalization for qudits of our protocol h3DEB (for qutrits). This protocol also uses pairs of entangled qudits, but achieves even better noise resistance than N-DEB and is showed to be secure against the same family of cloning attacks than N-DEB. This gain of performance is obtained by using another inequality called here hCHSH-. For each party, the hCHSH- inequality involves observables. We explain how the parties can measure these observables and thus are able to check the violation of hCHSH-. In the presence of…
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 Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
