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/0308057 · Physical Review Letters

Quantum Key Distribution with Two-Qubit Quantum Codes

Xiang‐Bin Wang

Published Feb 20, 2004• 84 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.92.077902

Related papers

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

Quantum key distribution with time coding on linearly dependent states

D. B. Horoshko, D. I. Pustakhod, S. Ya. Kilin

A quantum key distribution protocol with information coding by the time of photon arrival based on four linearly dependent single-photon states is proposed and the resistance of the protocol to a realistic intercept-resend attack is analyzed. The protocol on four linearly independent states is shown to be sensitive to an attack with unambiguous discrimination of all states when the level of losses in the quantum channel is higher than 7.2 dB.

Optics and Spectroscopy•Mar 1, 2012•2 citations

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

Quantum Key Distribution Scheme Based on Dense Encoding in Entangled States

Zhang Xiaolong, Yuexia Zhang, Kelin Gao

A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode,two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.

Communications in Theoretical Physics•Apr 1, 2005•7 citations

Mixed basis quantum key distribution with linear optics

Mladen Pavičić, Oliver J. Benson, Andreas W. Schell +1 more

Two-qubit quantum codes have been suggested to obtain better efficiency and higher loss tolerance in quantum key distribution. Here, we propose a two-qubit quantum key distribution protocol based on a mixed basis consisting of two Bell states and two states from the computational basis. All states can be generated from a single entangled photon pair resource by using local operations on only one auxiliary photon. Compared to other schemes it is also possible to deterministically discriminate all states using linear optics. Additionally, our protocol can be implemented with today's technology. When discussing the security of our protocol we find a much improved resistance against certain attacks as compared to the standard BB84 protocol.

arXiv:1709.06194•Optics Express•Sep 18, 2017•4 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
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.
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.
A quantum key distribution protocol, based on the quantum dense encoding in entangled states, is presented. In this protocol, we introduce an encoding process to encode,two classical bits information into one of the four one-qubit unitary operations implemented by Alice and the Bell states measurement implemented by Bob in stead of direct measuring the previously shared Einstein-Podolsky-Rosen pairs by both of the distant parties, Alice and Bob Considering the practical application we can get the conclusion that our protocol has some advantages. It not only simplifies the measurement which may induce potential errors, but also improves the effectively transmitted rate of the generated qubits by the raw key. Here we also discuss eavesdropping attacks against the scheme and the channel loss.
Two-qubit quantum codes have been suggested to obtain better efficiency and higher loss tolerance in quantum key distribution. Here, we propose a two-qubit quantum key distribution protocol based on a mixed basis consisting of two Bell states and two states from the computational basis. All states can be generated from a single entangled photon pair resource by using local operations on only one auxiliary photon. Compared to other schemes it is also possible to deterministically discriminate all states using linear optics. Additionally, our protocol can be implemented with today's technology. When discussing the security of our protocol we find a much improved resistance against certain attacks as compared to the standard BB84 protocol.
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.