B92 protocol
B92 is a quantum key distribution (QKD) protocol developed by Charles Bennett in 1992.
≈ 5 min read
B92 protocol. encyclopegia.org, snapshot enwiki-001352863979. /a/b92-protocol
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
B92 is a quantum key distribution (QKD) protocol developed by Charles Bennett in 1992.[1] It is a simplified alternative to the BB84 protocol, using only two non-orthogonal quantum states rather than four. The protocol relies on the no-cloning theorem and the fundamental principle that non-orthogonal states cannot be perfectly distinguished.
Overview
edit edit sourceThe B92 protocol is a method of secure quantum key distribution, where a sender (Alice) transmits individual photons to a receiver (Bob). Alice encodes the key using two non-orthogonal quantum states, typically chosen from the Bloch sphere, and Bob measures the received states using a corresponding measurement basis. Due to the non-orthogonality of the states, any eavesdropper (Eve) attempting to intercept the communication will inevitably introduce errors, which Alice and Bob can detect using classical post-processing techniques.[2][3]
| Alice's state | Bob's basis | Measurement outcome | Interpretation | bi |
|---|---|---|---|---|
| |0⟩ | Z | |0⟩ | could be |0⟩ or |+⟩ (inconclusive) | discard |
| |0⟩ | Z | |1⟩ | orthogonal to |0⟩ ⇒ deduce |+⟩ | 1 |
| |0⟩ | X | |+⟩ | could be |0⟩ or |+⟩ (inconclusive) | discard |
| |0⟩ | X | |−⟩ | orthogonal to |+⟩ ⇒ deduce |0⟩ | 0 |
| |+⟩ | Z | |0⟩ | could be |0⟩ or |+⟩ (inconclusive) | discard |
| |+⟩ | Z | |1⟩ | orthogonal to |0⟩ ⇒ deduce |+⟩ | 1 |
| |+⟩ | X | |+⟩ | could be |0⟩ or |+⟩ (inconclusive) | discard |
| |+⟩ | X | |−⟩ | orthogonal to |+⟩ ⇒ deduce |0⟩ | 0 |
Key extraction rule:
Key={ai∣bi=1}
kAlice={ai∣bi=1}
kBob={a'i⊕1∣bi=1}
Description
edit edit sourceIn the B92 scheme, Alice chooses a random bit sequence and encodes each bit using one of two non-orthogonal quantum states, such as:
- |ψ0⟩=|0⟩
- |ψ1⟩=12(|0⟩+|1⟩)
Bob then randomly chooses a measurement basis for each received photon. He can only successfully determine the bit value when his chosen basis allows a conclusive measurement; otherwise, the result is inconclusive and discarded. The final shared key is obtained after Alice and Bob discard inconclusive results and perform classical error correction and privacy amplification.[4]
Recent experimental studies have demonstrated practical implementations of the B92 protocol using pulsed laser sources, offering an accessible alternative for quantum cryptography education and research.[5]
Security
edit edit sourceThe security of the B92 protocol is based on the fact that non-orthogonal quantum states cannot be perfectly distinguished. If an eavesdropper (Eve) tries to measure the quantum states in transit, she will introduce detectable errors. However, compared to BB84, B92 is more susceptible to certain types of attacks, such as the photon number splitting (PNS) attack in practical implementations using weak coherent pulses. Countermeasures, including decoy states and device-independent QKD techniques, have been proposed to enhance the security of B92-based systems.[6]
Advantages and limitations
edit edit sourceAdvantages
edit edit source- Simpler implementation compared to BB84 due to fewer quantum states.
- Lower hardware complexity as only two quantum states are required.
- Can be adapted for use in various QKD setups, including fiber-based and free-space quantum communication.
Limitations
edit edit source- Lower efficiency than BB84, as fewer successful detections occur.
- More vulnerable to practical quantum attacks, such as photon-number-splitting attacks.
- Requires higher detection efficiency to maintain security.
See also
edit edit sourceReferences
edit edit source- ^ Bennett, C. H. (1992). "Quantum cryptography using any two nonorthogonal states". Physical Review Letters. 68 (21): 3121–3124. Bibcode:1992PhRvL..68.3121B. doi:10.1103/PhysRevLett.68.3121. PMID 10045619. Wikipedia revision 1352863979, retrieved 2026-11-18
- ^ Curty, M.; Ma, X.; Qi, B.; Moroder, T. (2010). "Passive decoy-state quantum key distribution with practical light sources". Physical Review A. 81 (2) 022310. arXiv:0911.2815. Bibcode:2010PhRvA..81b2310C. doi:10.1103/PhysRevA.81.022310. Wikipedia revision 1352863979, retrieved 2026-11-18
- ^ "QKD (B92 protocol)". www.st-andrews.ac.uk. Retrieved 2026-05-06. Wikipedia revision 1352863979, retrieved 2026-11-18
- ^ Kumar, A.; Vishwakarma, M.; Panigrahi, P. (2023). "Noise analysis of practical B92 quantum key distribution protocol". Photonics. 12 (3). doi:10.3390/photonics12030220. Wikipedia revision 1352863979, retrieved 2026-11-18
- ^ Gandelman, S. P.; Maslennikov, A.; Rozenman, G. G. (2025). "Hands-On Quantum Cryptography: Experimentation with the B92 Protocol Using Pulsed Lasers". Photonics. 12 (3): 220. doi:10.3390/photonics12030220. Wikipedia revision 1352863979, retrieved 2026-11-18
- ^ Inamori, H. (2002). "Security of practical B92 quantum key distribution". Algorithmica. 34 (4): 340–365. doi:10.1007/BF00191318. Wikipedia revision 1352863979, retrieved 2026-11-18
communication
complexity theory
processor benchmarks
computing models
error correction
implementations
programming
Text derived from https://en.wikipedia.org/w/index.php?oldid=1352863979 under CC BY-SA 4.0; modifications have been made.