skip to content
 

Provably secure experimental quantum bit string generation

Date: 
Thursday 26th August 2004 - 15:30 to 16:20
Venue: 
INI Seminar Room 1
Abstract: 

Coin Tossing is the problem in which two parties who do not trust each other want to generate a random coin. Quantum communication allows the parties to generate a coin with bias less than ½, which is impossible classically. However even quantum communication cannot guarantee that the bits are perfectly random. Bit string generation is the generalisation of coin tossing when the two parties want to generate a large number n of coins. We discuss the theory of quantum bit string generation and show that much better security is possible than for quantum coin tossing. We also report on an experiment in which a string of bits is generated which more random than is possible classically.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons