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:1507.03740 · Physical Review A

Quantum key distribution using qudits that each encode one bit of raw key

H. F. Chau

Published Dec 11, 2015• 33 citations
arXivHTMLPDF

Abstract

All known qudit-based prepare-and-measure quantum key distribution (PMQKD) schemes are more error resilient than their qubit-based counterparts. Their high error resiliency comes partly from the careful encoding of multiple bits of signals used to generate the raw key in each transmitted qudit so that the same eavesdropping attempt causes a higher bit error rate (BER) in the raw key. Here I show that highly-error-tolerant PMQKD schemes can be constructed simply by encoding one bit of classical information in each transmitted qudit in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$, where $|i\ensuremath{\rangle}$'s form an orthonormal basis of the ${2}^{n}$-dimensional Hilbert space. Moreover, I prove that these schemes can tolerate up to the theoretical maximum of a 50% BER for $n\ensuremath{\ge}2$ provided the raw key is generated under a certain technical condition, making them extremely-error-tolerant PMQKD schemes involving the transmission of unentangled finite-dimensional qudits. This shows the potential of processing quantum information using lower-dimensional quantum signals encoded in a higher-dimensional quantum state.

DOI
10.1103/physreva.92.062324

Related papers

Experimentally feasible quantum-key-distribution scheme using qubit-like qudits and its comparison with existing qubit- and qudit-based protocols

H. F. Chau, Qinan Wang, Cardythy Wong

Recently, Chau [Phys. Rev. A 92, 062324 (2015)] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a ${2}^{n}$-dimensional Hilbert space in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$ with $n\ensuremath{\ge}2$. For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate $n$ bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional $(n\ensuremath{-}1)$ bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of $n=2$, the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.

arXiv:1603.02370•Physical Review A•Feb 7, 2017•8 citations

Photonic qudit entanglement and its applications to quantum key distribution

Jinwon Yoo, Luca Castello, Stefania Sciara +3 more

Abstract High-dimensional quantum key distribution (QKD) based on entangled qudits has emerged as a promising route for advancing the performance and practicality of quantum communication. By extending beyond the qubit framework, qudit entanglement enables the encoding of multiple bits per particle and offers greater robustness against noise, loss, and eavesdropping. In this review, we present qudit-based entanglement QKD protocols and their experimental demonstrations. We first introduce the basic concepts of qudits and provide an overview of foundational qubit-based entanglement QKD schemes, such as Ekert '91 (E91) and Bennett–Brassard–Mermin '92 (BBM92), which establish the core principles of entanglement-based secure key generation. Subsequently, we examine the generalization of these protocols to entangled qudits, highlighting how higher dimensionality enhances secure key rates and noise tolerance. Finally, we survey experimental demonstrations of qudit-based entanglement QKD across photonic platforms and outline prospects, showing that high-dimensional entanglement can be reliably generated, distributed, and measured for QKD with high stability and scalability. Remarkably, these achievements not only verify the feasibility of practical high-dimensional QKD, but also demonstrate clear advantages over qubit-based systems. Overall, theoretical frameworks and experimental realizations reviewed here position photonic qudit-based entanglement QKD as a promising resource for scalable, high-speed, and secure quantum communication networks, unveiling its potential as a central component in the future of quantum information technologies.

Rivista Del Nuovo Cimento•Sep 1, 2026•0 citations

Improved Eavesdropping Detection in Quantum Key Distribution

Muhammad Mubashir Khan, Jie Xu, Almut Beige

Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum bit error rate introduced by an eavesdropper unavoidably exceeds the system error rate. This condition guarantees that an eavesdropper cannot disguise his presence by simply replacing the original transmission line with a less faulty one. Unfortunately, this condition also limits the possible distance between the communicating parties, Alice and Bob, to a few hundred kilometers. To overcome this problem, we design a QKD protocol which allows Alice and Bob to distinguish system errors from eavesdropping errors. If they are able to identify the origin of their errors, they can detect eavesdropping even when the system error rate exceeds the eavesdropping error rate. To achieve this, the proposed protocol employs an alternative encoding of information in two-dimensional photon states. Errors manifest themselves as quantum bit and as index transmission errors with a distinct correlation between them in case of intercept-resend eavesdropping. As a result, Alice and Bob can tolerate lower eavesdropping and higher system error rates without compromising their privacy.

arXiv:1112.1110•Dec 5, 2011•3 citations

Noise-resistant quantum key distribution protocol

B. A. Grishanin, Сыч Денис Васильевич, Victor N. Zadkov

We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 28, 2004•0 citations

Quantum Key Distribution with Two-Qubit Quantum Codes

Xiang‐Bin Wang

We propose a prepare-and-measure scheme for quantum key distribution with two-qubit quantum codes. The protocol is unconditionally secure under all types of intercept-and-resend attack. Given the symmetric and independent errors to the transmitted qubits, our scheme can tolerate a bit of an error rate up to 26% in four-state protocol and 30% in six-state protocol, respectively. These values are higher than all currently known threshold values for the prepare-and-measure protocols. Moreover, we give a practically implementable linear optics realization for our scheme.

arXiv:quant-ph/0308057•Physical Review Letters•Feb 20, 2004•84 citations

Unconditionally Secure Quantum Key Distribution In Higher Dimensions

H. F. Chau

In search of a quantum key distribution scheme that could stand up for more drastic eavesdropping attack, I discover a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. Using the Shor-Preskill-type argument, I prove that this scheme is unconditional secure against all attacks allowed by the laws of quantum physics. Incidentally, for $N = 2^n > 2$, each information carrier can be replaced by $n$ entangled qubits. And in this case, I discover an eavesdropping attack on which no unentangled-qubit-based prepare-and-measure quantum key distribution scheme known to date can generate a provably secure key. In contrast, this entangled-qubit-based scheme produces a provably secure key under the same eavesdropping attack whenever $N \geq 16$. This demonstrates the advantage of using entangled particles as information carriers to combat certain eavesdropping strategies.

arXiv:quant-ph/0212055•Dec 10, 2002•7 citations
All known qudit-based prepare-and-measure quantum key distribution (PMQKD) schemes are more error resilient than their qubit-based counterparts. Their high error resiliency comes partly from the careful encoding of multiple bits of signals used to generate the raw key in each transmitted qudit so that the same eavesdropping attempt causes a higher bit error rate (BER) in the raw key. Here I show that highly-error-tolerant PMQKD schemes can be constructed simply by encoding one bit of classical information in each transmitted qudit in the form (∣i\ensuremath⟩\ifmmode±\else\textpm\fi∣j\ensuremath⟩)/2(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}(∣i\ensuremath⟩\ifmmode±\else\textpm\fi∣j\ensuremath⟩)/2​, where ∣i\ensuremath⟩|i\ensuremath{\rangle}∣i\ensuremath⟩'s form an orthonormal basis of the 2n{2}^{n}2n-dimensional Hilbert space. Moreover, I prove that these schemes can tolerate up to the theoretical maximum of a 50% BER for n\ensuremath≥2n\ensuremath{\ge}2n\ensuremath≥2 provided the raw key is generated under a certain technical condition, making them extremely-error-tolerant PMQKD schemes involving the transmission of unentangled finite-dimensional qudits. This shows the potential of processing quantum information using lower-dimensional quantum signals encoded in a higher-dimensional quantum state.
Recently, Chau [Phys. Rev. A 92, 062324 (2015)] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a 2n{2}^{n}2n-dimensional Hilbert space in the form $(|i\ensuremath{\rangle}\ifmmode\pm\else\textpm\fi{}|j\ensuremath{\rangle})/\sqrt{2}$ with $n\ensuremath{\ge}2$. For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate nnn bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional $(n\ensuremath{-}1)$ bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of n=2n=2n=2, the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.
Abstract High-dimensional quantum key distribution (QKD) based on entangled qudits has emerged as a promising route for advancing the performance and practicality of quantum communication. By extending beyond the qubit framework, qudit entanglement enables the encoding of multiple bits per particle and offers greater robustness against noise, loss, and eavesdropping. In this review, we present qudit-based entanglement QKD protocols and their experimental demonstrations. We first introduce the basic concepts of qudits and provide an overview of foundational qubit-based entanglement QKD schemes, such as Ekert '91 (E91) and Bennett–Brassard–Mermin '92 (BBM92), which establish the core principles of entanglement-based secure key generation. Subsequently, we examine the generalization of these protocols to entangled qudits, highlighting how higher dimensionality enhances secure key rates and noise tolerance. Finally, we survey experimental demonstrations of qudit-based entanglement QKD across photonic platforms and outline prospects, showing that high-dimensional entanglement can be reliably generated, distributed, and measured for QKD with high stability and scalability. Remarkably, these achievements not only verify the feasibility of practical high-dimensional QKD, but also demonstrate clear advantages over qubit-based systems. Overall, theoretical frameworks and experimental realizations reviewed here position photonic qudit-based entanglement QKD as a promising resource for scalable, high-speed, and secure quantum communication networks, unveiling its potential as a central component in the future of quantum information technologies.
Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum bit error rate introduced by an eavesdropper unavoidably exceeds the system error rate. This condition guarantees that an eavesdropper cannot disguise his presence by simply replacing the original transmission line with a less faulty one. Unfortunately, this condition also limits the possible distance between the communicating parties, Alice and Bob, to a few hundred kilometers. To overcome this problem, we design a QKD protocol which allows Alice and Bob to distinguish system errors from eavesdropping errors. If they are able to identify the origin of their errors, they can detect eavesdropping even when the system error rate exceeds the eavesdropping error rate. To achieve this, the proposed protocol employs an alternative encoding of information in two-dimensional photon states. Errors manifest themselves as quantum bit and as index transmission errors with a distinct correlation between them in case of intercept-resend eavesdropping. As a result, Alice and Bob can tolerate lower eavesdropping and higher system error rates without compromising their privacy.
We present the scheme of compatible quantum information analysis of the quantum key distribution (QKD) protocols, which give answers to the following questions: is it possible to improve the quantum bit error rate (QBER) of the 6-state protocol by employing more states, up to infinity, and can we essentially improve the QBER if the multidimensional Hilbert space with dimensionality more than 3 is used? Also, a novel quantum key distribution (QKD) protocol, based on all unselected states of a quantum system, which set the alphabet with continuous set of letters, is proposed. Employing all states of the Hilbert space leads to the maximal quantum uncertainty of transmitted states and therefore an eavesdropper receives the minimal amount of information. For the case of two-dimensional Hilbert space, our protocol allows secure transmission at the error rate higher than that one for the BB84-protocol and comparable with the characteristics of the best known QKD-protocols. However, with increasing the dimensionality of the Hilbert space the critical error rate for our protocol increases and in the limit of infinite-dimensional space the protocol becomes non-threshold.
We propose a prepare-and-measure scheme for quantum key distribution with two-qubit quantum codes. The protocol is unconditionally secure under all types of intercept-and-resend attack. Given the symmetric and independent errors to the transmitted qubits, our scheme can tolerate a bit of an error rate up to 26% in four-state protocol and 30% in six-state protocol, respectively. These values are higher than all currently known threshold values for the prepare-and-measure protocols. Moreover, we give a practically implementable linear optics realization for our scheme.
In search of a quantum key distribution scheme that could stand up for more drastic eavesdropping attack, I discover a prepare-and-measure scheme using NNN-dimensional quantum particles as information carriers where NNN is a prime power. Using the Shor-Preskill-type argument, I prove that this scheme is unconditional secure against all attacks allowed by the laws of quantum physics. Incidentally, for N=2n>2N = 2^n > 2N=2n>2, each information carrier can be replaced by nnn entangled qubits. And in this case, I discover an eavesdropping attack on which no unentangled-qubit-based prepare-and-measure quantum key distribution scheme known to date can generate a provably secure key. In contrast, this entangled-qubit-based scheme produces a provably secure key under the same eavesdropping attack whenever N≥16N \geq 16N≥16. This demonstrates the advantage of using entangled particles as information carriers to combat certain eavesdropping strategies.