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/0405016 · IEEE Transactions on Information Theory

Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization

H. F. Chau

Published Apr 1, 2005• 68 citations
arXivHTMLPDF

Abstract

This paper presents a prepare-and-measure scheme using N-dimensional quantum particles as information carriers where N is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli errors introduced to the quantum information carriers. Using the Shor-Preskill-type argument, we prove that this scheme is unconditionally secure against all attacks allowed by the laws of quantum physics. For N=2/sup n/>2, each information carrier can be replaced by n entangled qubits. In this case, there is a family of eavesdropping attacks on which no unentangled-qubit-based prepare-and-measure (PM) quantum key distribution scheme known to date can generate a provably secure key. In contrast, under the same family of attacks, our entangled-qubit-based scheme remains secure whenever 2/sup n//spl ges/4. This demonstrates the advantage of using entangled particles as information carriers and of using depolarization of Pauli errors to combat eavesdropping attacks more drastic than those that can be handled by unentangled-qubit-based prepare-and-measure schemes.

DOI
10.1109/tit.2005.844076

Related papers

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

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

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

H. F. Chau

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.

arXiv:1507.03740•Physical Review A•Dec 11, 2015•33 citations

Unconditional Security of a Three State Quantum Key Distribution Protocol

Jean-Christian Boileau, Kiyoshi Tamaki, Jamie Batuwantudawe +2 more

Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.

arXiv:quant-ph/0408085•Physical Review Letters•Jan 31, 2005•86 citations

Semi-quantum key distribution using qudit systems and security proof

WenWen Hu, Ri‐Gui Zhou, She-Xiang Jiang

Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([Formula: see text]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.

International Journal of Quantum Information•Jul 20, 2023•6 citations

Unconditional security of quantum key distribution and the uncertainty principle

Masato Koashi

An approach to the unconditional security of quantum key distribution protocols is presented, which is based on the uncertainty principle. The approach applies to every case that has been treated via the argument by Shor and Preskill, but it is not necessary to find quantum error correcting codes. It can also treat the cases with uncharacterized apparatuses. The proof can be applied to cases where the secret key rate is larger than the distillable entanglement.

Journal of Physics Conference Series•Apr 1, 2006•85 citations
This paper presents a prepare-and-measure scheme using N-dimensional quantum particles as information carriers where N is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli errors introduced to the quantum information carriers. Using the Shor-Preskill-type argument, we prove that this scheme is unconditionally secure against all attacks allowed by the laws of quantum physics. For N=2/sup n/>2, each information carrier can be replaced by n entangled qubits. In this case, there is a family of eavesdropping attacks on which no unentangled-qubit-based prepare-and-measure (PM) quantum key distribution scheme known to date can generate a provably secure key. In contrast, under the same family of attacks, our entangled-qubit-based scheme remains secure whenever 2/sup n//spl ges/4. This demonstrates the advantage of using entangled particles as information carriers and of using depolarization of Pauli errors to combat eavesdropping attacks more drastic than those that can be handled by unentangled-qubit-based prepare-and-measure schemes.
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.
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.
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 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{\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.
Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.
Most prior semi-quantum key distribution (SQKD) protocols are designed in the context of qubits. In this paper, we proposed an SQKD protocol using ([Formula: see text]+1) quantum states in two mutually unbiased bases in the context of qudits without invoking the classical party’s measurement capability. It not only decreases the quantum states sent by quantum party by half, but also improves the efficiency of key rate than qubits do. To prove the security of present protocol, we first illustrate that the present protocol is completely robust, and then prove its unconditional security from information theoretical perspective by computing its key rate and noise tolerance against cloning-based individual attack. The unconditional security proof demonstrates that the higher dimension of quantum system is, the higher key rate can be obtained and the higher noise tolerance is allowed in depolarization channel.