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/9803007

Efficient Quantum Key Distribution

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

Published Mar 3, 1998• 15 citations
arXivHTMLPDF

Abstract

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}.

DOI
10.48550/arxiv.quant-ph/9803007

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•39 citations

Efficient Quantum Key Distribution Scheme And Proof of Its Unconditional Security

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

We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping attack that is allowed by the laws of physics. The first major ingredient of our scheme is the assignment of significantly different probabilities to the different polarization bases during both transmission and reception, thus reducing the fraction of discarded data. A second major ingredient of our scheme is a refined analysis of accepted data: We divide the accepted data into various subsets according to the basis employed and estimate an error rate for each subset *separately*. We then show that such a refined data analysis guarantees the security of our scheme against the most general eavesdropping strategy, thus generalizing Shor and Preskill's proof of security of BB84 to our new scheme. Up till now, most proposed proofs of security of single-particle type quantum key distribution schemes have relied heavily upon the fact that the bases are chosen uniformly, randomly and independently. Our proof removes this symmetry requirement.

arXiv:quant-ph/0011056•Nov 14, 2000•18 citations

Efficient quantum key distribution scheme with pre-announcing the basis

Jingliang Gao, Changhua Zhu, Heling Xiao

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.

arXiv:1410.5664•Europhysics Letters (EPL)•Mar 1, 2014•1 citation

Entanglement-enhanced quantum key distribution

Olli Ahonen, Mikko Möttönen, Jeremy L. O’Brien

We present and analyze a quantum key distribution protocol based on sending entangled $N$-qubit states instead of single-qubit ones as in the trail-blazing scheme by Bennett and Brassard 1984 (BB84). Since the qubits are sent and acknowledged individually, an eavesdropper is limited to accessing them one by one. In an intercept-resend attack, this fundamental restriction allows one to make the eavesdropper's information on the transmitted key vanish if even one of the qubits is not intercepted. The implied upper bound $1∕(2N)$ for this information is further shown not to be the lowest, as the information can be reduced to less than 30% of that in the BB84 scheme in the case $N=2$. In general, the protocol is at least as secure as BB84.

arXiv:0712.4241•Physical Review A•Sep 11, 2008•26 citations

Efficient quantum-key-distribution scheme with nonmaximally entangled states

Peng Xue, Chuan‐Feng Li, Guang‐Can Guo

We propose an efficient quantum-key-distribution scheme based on entanglement. The sender chooses pairs of photons in one of the two equivalent nonmaximally entangled states randomly, and sends a sequence of photons from each pair to the receiver. The sender and receiver choose from the various bases independently but with substantially different probabilities, thus reducing the fraction of discarded data, and a significant gain in efficiency is achieved. We then show that refined data analysis like that proposed by Lo et al. (H. K. Lo, H. F. Chau, and M. Adrehali, e-print quant-ph/0011056) guarantees the security of our scheme against a biased eavesdropping strategy. Remarkably, our scheme is more efficient than distillation of singlets out of the nonmaximally entangled states and biased detection afterward.

arXiv:quant-ph/0101043•Physical Review A•Aug 14, 2001•54 citations

Quantum cryptographic system with reduced data loss

Hoi‐Kwong Lo

A secure method for distributing a random cryptographic key with reduced data loss. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically.

•Jan 23, 2023•2 citations
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}.
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 the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping attack that is allowed by the laws of physics. The first major ingredient of our scheme is the assignment of significantly different probabilities to the different polarization bases during both transmission and reception, thus reducing the fraction of discarded data. A second major ingredient of our scheme is a refined analysis of accepted data: We divide the accepted data into various subsets according to the basis employed and estimate an error rate for each subset *separately*. We then show that such a refined data analysis guarantees the security of our scheme against the most general eavesdropping strategy, thus generalizing Shor and Preskill's proof of security of BB84 to our new scheme. Up till now, most proposed proofs of security of single-particle type quantum key distribution schemes have relied heavily upon the fact that the bases are chosen uniformly, randomly and independently. Our proof removes this symmetry requirement.
We present and analyze a quantum key distribution protocol based on sending entangled NNN-qubit states instead of single-qubit ones as in the trail-blazing scheme by Bennett and Brassard 1984 (BB84). Since the qubits are sent and acknowledged individually, an eavesdropper is limited to accessing them one by one. In an intercept-resend attack, this fundamental restriction allows one to make the eavesdropper's information on the transmitted key vanish if even one of the qubits is not intercepted. The implied upper bound 1∕(2N)1∕(2N)1∕(2N) for this information is further shown not to be the lowest, as the information can be reduced to less than 30% of that in the BB84 scheme in the case N=2N=2N=2. In general, the protocol is at least as secure as BB84.
We propose an efficient quantum-key-distribution scheme based on entanglement. The sender chooses pairs of photons in one of the two equivalent nonmaximally entangled states randomly, and sends a sequence of photons from each pair to the receiver. The sender and receiver choose from the various bases independently but with substantially different probabilities, thus reducing the fraction of discarded data, and a significant gain in efficiency is achieved. We then show that refined data analysis like that proposed by Lo et al. (H. K. Lo, H. F. Chau, and M. Adrehali, e-print quant-ph/0011056) guarantees the security of our scheme against a biased eavesdropping strategy. Remarkably, our scheme is more efficient than distillation of singlets out of the nonmaximally entangled states and biased detection afterward.
A secure method for distributing a random cryptographic key with reduced data loss. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically.