The Quantum Bit Commitment Theorem

Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an “Einstein–Podolsky–Rosen” attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem.

[1]  Hoi-Kwong Lo,et al.  Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.

[2]  Chi-Yee Cheung.  On the Possibility of Unconditionally Secure Quantum Bit Commitment , 1999 .

[3]  S. N. Molotkov,et al.  Unconditionally Secure Relativistic Quantum Bit Commitment , 1999 .

[4]  Gilles Brassard,et al.  Defeating classical bit commitments with a quantum computer , 1998 .

[5]  Gilles Brassard,et al.  Quantum Bit Commitment and Coin Tossing Protocols , 1990, CRYPTO.

[6]  Vaidman,et al.  How to ascertain the values of sigmax, sigma y, and sigma z of a spin-1/2 particle. , 1987, Physical review letters.

[7]  Adrian Kent,et al.  Secure Classical Bit Commitment over Finite Channels , 1999 .

[8]  D. Mayers.  The Trouble with Quantum Bit Commitment , 1996, quant-ph/9603015.

[9]  Horace P. Yuen.  UNCONDITIONALLY SECURE QUANTUM BIT COMMITMENT IS POSSIBLE , 2000 .

[10]  Kurt Jacobs,et al.  Information-tradeoff relations for finite-strength quantum measurements , 2001 .

[11]  R. Mcweeny.  On the Einstein-Podolsky-Rosen Paradox , 2000 .

[12]  Adrian Kent,et al.  Unconditionally Secure Bit Commitment , 1998, quant-ph/9810068.

[13]  Adrian Kent.  Unconditionally Secure Commitment of a Certified Classical Bit is Impossible , 1999 .

[14]  J. Lebowitz,et al.  TIME SYMMETRY IN THE QUANTUM PROCESS OF MEASUREMENT , 1964 .

[15]  L. Goldenberg,et al.  Quantum Gambling , 1998, quant-ph/9808001.

[16]  Adrian Kent.  Quantum Bit Commitment from a Computation Bound , 1997 .

[17]  Andrew Chi-Chih Yao,et al.  Quantum bit escrow , 2000, STOC '00.

[18]  Arindam Mitra.  Unconditionally secure quantum bit commitment is simply possible , 2000, physics/0007089.

[19]  Dominic Mayers.  Unconditionally secure quantum bit commitment is impossible , 1997 .

[20]  Hoi-Kwong Lo,et al.  Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment) , 1998, IACR Cryptol. ePrint Arch..

[21]  R. Jozsa,et al.  A Complete Classification of Quantum Ensembles Having a Given Density Matrix , 1993 .

[22]  Hoi-Kwong Lo,et al.  Making an Empty Promise with a Quantum Computer Typeset Using Revt E X , 1997 .

[23]  Adrian Kent.  Permanently Secure Quantum Bit Commitment from a Temporary Computation Bound , 1997 .

[24]  Gilles Brassard,et al.  A brief review on the impossibility of quantum bit commitment , 1997 .

[25]  H. F. Chau,et al.  Why quantum bit commitment and ideal quantum coin tossing are impossible , 1997 .

[26]  Adrian Kent,et al.  Impossibility of unconditionally secure commitment of a certified classical bit , 2000 .

[27]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.