Lower bound for a class of weak quantum coin flipping protocols

2002/04/11 by Andris Ambainis, Ambainis, Andris
Computer Science · Physics and Astronomy · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph) #cs.CR #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0204063

6 pages

arxiv created 2002/04/11 · arxiv updated 2009/12/01

Abstract

We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this class, one party can win the coin flip with probability at least 1/√(2).

Related

• Quantum weak coin-flipping with bias of 0.192
• Weak coin flipping with small bias
• Protocols for Quantum Weak Coin Flipping
• Optimal quantum strong coin flipping
• Quantum coin flipping with arbitrary small bias is impossible