Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2009/iii/paper-53/4/b/protocol-3/solution

Secure in the intended ideal setting, with a sound entanglement-purification procedure. Bob confirms receipt before Alice reveals either the random basis string or the randomly chosen check positions. Eve must therefore release the travelling qubits before knowing which basis to use and which positions to protect from disturbance. Bob can then decode because .
The random check sample tests the same ensemble of encoded transmissions as the retained data. Random computational basis and Hadamard basis encodings make the test sensitive to complementary disturbances; Eve cannot use the targeted zero-error attack available in Protocol 1. For example, measuring every intercepted qubit in one fixed one of these two bases uses the wrong basis half the time, and then disagrees with Alice half the time, producing a bit error rate of . A sound entanglement purification protocol uses the tested error bounds, corrects both relevant types of error, and aborts if the noise is too high; secrecy is not claimed for every possible attack without an abort option.
When the protocol succeeds in producing nearly perfect Bell pairs, purity decouples a subsystem from its purification explains why they are nearly independent of Eve, and matching computational basis measurements produce an approximately uniform shared secret key. The disclosed check outcomes are discarded rather than included in that key. This is the standard entanglement-based quantum key distribution ordering: receipt first, basis and sample disclosure second, testing and purification next, and private measurements last.

New to topics? Read the docs here!