Lower bound for a class of weak quantum coin flipping protocols
Andris Ambainis · arXiv (Cornell University) · 2002
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/\sqrt{2}$.