A courier network wants to send a confidential message of bits using a one-time pad

PHYSICS · Multi-part · Fermi University Physics · Quantum Information & Technology · Quantum information theory and communication · Quantum information theory and communication

Quantum Information and Technology, Ch Quantum key distribution and quantum networks

Problem

A courier network wants to send a confidential message of L=106L = 10^6 bits using a one-time pad, which needs a key of the same length LL shared secretly in advance. The key is generated by BB84 over a fibre link whose sifted key has an asymptotic quantum bit error rate Q=4%Q = 4\% after all corrections, so the Shor-Preskill/CSS argument gives a net secret-key rate r=1−2h(Q)r = 1 - 2h(Q) secret bits per sifted bit, where hh is the binary entropy in bits. ((a)) Derive an expression for the number of sifted bits nn needed to supply a one-time-pad key of length LL, in terms of LL, hh and QQ. ((b)) Given that on average only half of the qubits Alice sends survive the public basis comparison (sifting), derive an expression for the number of qubits NN she must transmit. ((c)) Evaluate nn and NN for L=106L = 10^6 bits and Q=4%Q = 4\%.

Browse the problem library