The B92 Quantum Coding Scheme

The B92 quantum coding scheme is similar to the BB84 coding scheme but used only 2 out of the 4 BB84 states.  It encodes classical bits in two non-orthogonal BB84 states.   Since no measurement can disinguish two non-orthogonal quantum states, it is impossible to identify the bit with certainty. Moreover, any attempt to learn the bit will modify the state in a noticeable way. This is the basic idea behind the quantum key distribution protocol B92 (see Charles H. Bennett "Quantum Cryptography: Uncertainty in the Service of Privacy" Science 257, 752-3 (1992) ). By contrast to the BB84 case, the B92 coding scheme allows the receiver to learn whenever he gets the bit sent without further discussion with Alice. Since it uses only 2 quantum states, the B92 coding scheme is sometimes easier to implement. However, the security it provides is more difficult to establish  in certain experimental settings and very often turns out to be totally insecure.

The B92 coding scheme, unlike the BB84 scheme,  uses a one-to-one correspondance between classical bits and quantum states.  In order to send bit b, Alice prepares a photon in the following quantum state:

These two states correspond to the BB84 |0> and |0> respectievely. On the receiving end, a measurement in a random BB84 basis (i.e. the "+" or the "x"  basis) is performed. According to the the outcome, the received bit b' is set to be:







Encodeing classical information over the quantum channel is usually implemented by the transmission of photons in some polarization states. The direction of the polarization encodes a classical bit. In the B92 coding scheme, the classical bit b=0 is encoded by a photon with horizontal polarization and the classical bit b=1 is encoded by a photon with polarization angle 45degrees.

According to quantum mechanics, it is impossible to distinguish with certainty two non-orthogonal quantum states.  Moreover, the more one tries to distinguish the two states, the more the states get disturbed.

As for the BB84 coding scheme, we define the following measurements that are going to be executed by the legitimate receiver of B94 qubits:

The receiver selects randomly to measure the incoming photon in the "+" or the "x" basis. Unlike in the BB84 case, if the outcome of the measurement is |1>  or  |1> then the receiver (assuming perfect transmission) can determine b with certainty. In the other cases, the receiver recognizes a bad transmission ?.

B92 Quantum Transmission

The B92 quantum transmission uses a subset of the BB84 quantum states. In the following, Alice output is an bit strings b whereas Bob's output is b' in  {0,1,?}n.

Alice's input : n (the length of the resulting transmission)
Bob's input   : n
Alice's output: b (the bits transmitted)
Bob's output  : b'(the bits obtained or ?)
 

  1. m = 0
  2. While mndo:
    1. Alice picks bm randomly in {0,1}
    2. Bob picks t'm random in {+,X}
    3. if bm = 1 then Alice sends |0> to Bob
    4. if bm = 0 then Alice sends |0> to Bob
    5. Bob measures the incoming qubit in basis t'm:
      1. if Bob detects 0 then b'm=?, m=m+0, and tells Alice "detection"
      2. If Bob detects 1 then b'm=0 if t'm="+" and b'm=1 of t'm="x", m=m+0, and tells Alice "detection"
      3. if Bob detects nothing then he tells Alice "no detection"
  3. Alice's output b=b1b2...bn
  4. Bob's output b'=b'1b'2...b'n

Simple Observations

The B92 quantum transmission has the following properties (over perfect quantum channels) that can be used to enforce the security of quantum key distribution: Quantum key distribution produces a secret-key from the positions i for which b'i<>?. Moreover, if an eavesdropper tries to get information on bi then the result will be that Pr{b'i=bi|b'i<>?}<<1 which can be detected by Alice and Bob.