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:1410.5664 · Europhysics Letters (EPL)

Efficient quantum key distribution scheme with pre-announcing the basis

Jingliang Gao, Changhua Zhu, Heling Xiao

Published Mar 1, 2014• 1 citation
arXivHTMLPDF

Abstract

We devise a new quantum key distribution scheme that is more efficient than the BB84 protocol. By pre-announcing the basis, Alice and Bob are more likely to use the same basis to prepare and measure the qubits, thus achieving a higher efficiency. The error analysis is revised and its security against any eavesdropping is proven briefly. Furthermore we show that, compared with the LCA scheme, our modification can be applied in more quantum channels.

DOI
10.1209/0295-5075/105/60003

Related papers

Security of quantum key distribution

Shuang Wang, Jingzheng Huang, Zheng‐Fu Han +10 more

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Oct 1, 2012•43 citations

Efficient Quantum Key Distribution

M. Ardehali, Chau, H. F., Hoi‐Kwong Lo

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset {\it individually}.

arXiv:quant-ph/9803007•Mar 3, 1998•37 citations

Semiquantum Key Distribution Using Entangled States

Jian Wang, Sheng Zhang, Quan Zhang +1 more

Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.

arXiv:1104.1267•Chinese Physics Letters•Oct 1, 2011•100 citations

Quantum Key Distribution with Qubits Encoded in Qutrit

Rupesh Kumar, Rafał Demkowicz-Dobrzański, Konrad Banaszek

We present a novel one-way quantum key distribution protocol based on 3-dimensional quantum state, a qutrit, that encodes two qubits in its 2-dimensional subspaces. The qubits hold the classical bit information that has to be shared between the legitimate users. Alice sends such a qutrit to Bob where he decodes one of the qubit and measures it along the random Pauli basis. This scheme has higher secure key rate at longer transmission distance than the standard BB84 protocol.

arXiv:1202.0456•Feb 2, 2012•0 citations

The BB84 protocol

Gilles Van Assche

The publication of the BB84 protocol by Bennett and Brassard in 1984 [10] marks the beginning of quantum key distribution. Since then, many other protocols have been invented. Yet, BB84 keeps a privileged place in the list of existing protocols: it is the one most analyzed and most often implemented, including those used in commercial products, e.g., [91, 113]. In this chapter, I define the BB84 protocol, although I already described it informally in Section 1.1. The physical implementation is then investigated. Finally, I analyze the eavesdropping strategies against BB84 and deduce the secret key rate. Description Alice chooses binary key elements randomly and independently, denoted by the random variable X ∈ χ = {0, 1}. In this protocol, there are two encoding rules, numbered by i ∈ {1, 2}. Alice randomly and independently chooses which encoding rule she uses for each key element. In case 1, Alice prepares a qubit from the basis {|0〉, |1〉} as In case 2, Alice prepares a qubit from the basis {|+〉, |−〉} as On his side, Bob measures either Z or X , yielding the result Y Z or Y X , choosing at random which observable he measures. After sending a predefined number of qubits, Alice reveals to Bob the encoding rule for each of them. They proceed with sifting, that is, they discard the key elements for which Alice used case 1 (or case 2) and Bob measured Z (or X ). For the remaining (sifted) key elements, we denote Bob's sifted measurements by Y .

Cambridge University Press eBooks•Jun 29, 2006•4 citations

Measuring-basis-encrypted six-state quantum key distribution scheme*

Chen Pan, Deng Fuguo, Pingxiao Wang +1 more

A six-state quantum key distribution scheme with measuring-basis encryption technique, which is based on the six-state protocol and the MBE protocol, is proposed. In this modified six-state quantum key distribution protocol, Alice and Bob use a control key to synchronize the use of their measuring-basis so that they always use the same measuring-basis. This modified six-state quantum key distribution protocol retains the advantage of higher security and at the same time has a higher efficiency.

Progress in Natural Science Materials International•Jan 1, 2006•3 citations
We devise a new quantum key distribution scheme that is more efficient than the BB84 protocol. By pre-announcing the basis, Alice and Bob are more likely to use the same basis to prepare and measure the qubits, thus achieving a higher efficiency. The error analysis is revised and its security against any eavesdropping is proven briefly. Furthermore we show that, compared with the LCA scheme, our modification can be applied in more quantum channels.
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually.
We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. An eavesdropper may try to break such a scheme by eavesdropping mainly along the predominant basis. To defeat such an attack, we perform a refined analysis of accepted data: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset {\it individually}.
Recently, Boyer et al. presented a novel semiquantum key distribution protocol [ Phys. Rev. Lett. 99 (2007) 140501 ] by using four quantum states, each of which is randomly prepared in the Z or X basis. Here we present a semi-quantum key distribution protocol by using maximally entangled states in which quantum Alice shares a secret key with classical Bob. Quantum Alice has the ability to prepare Bell states and perform Bell basis or computational basis measurement. Classical Bob is restricted to measuring, preparing a particle in the computational basis, reflecting or reordering the particles. The qubit efficiency of the protocol improves to 50% and the protocol can be modified to a measure-resend protocol or a protocol without quantum memory. We also show that the protocol is secure against eavesdropping.
The publication of the BB84 protocol by Bennett and Brassard in 1984 [10] marks the beginning of quantum key distribution. Since then, many other protocols have been invented. Yet, BB84 keeps a privileged place in the list of existing protocols: it is the one most analyzed and most often implemented, including those used in commercial products, e.g., [91, 113]. In this chapter, I define the BB84 protocol, although I already described it informally in Section 1.1. The physical implementation is then investigated. Finally, I analyze the eavesdropping strategies against BB84 and deduce the secret key rate. Description Alice chooses binary key elements randomly and independently, denoted by the random variable X ∈ χ = {0, 1}. In this protocol, there are two encoding rules, numbered by i ∈ {1, 2}. Alice randomly and independently chooses which encoding rule she uses for each key element. In case 1, Alice prepares a qubit from the basis {|0〉, |1〉} as In case 2, Alice prepares a qubit from the basis {|+〉, |−〉} as On his side, Bob measures either Z or X , yielding the result Y Z or Y X , choosing at random which observable he measures. After sending a predefined number of qubits, Alice reveals to Bob the encoding rule for each of them. They proceed with sifting, that is, they discard the key elements for which Alice used case 1 (or case 2) and Bob measured Z (or X ). For the remaining (sifted) key elements, we denote Bob's sifted measurements by Y .