Lower bound for a class of weak quantum coin flipping protocols
<|reference_start|>Lower bound for a class of weak quantum coin flipping protocols: 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}$.<|reference_end|>
@article{ambainis2002lower,
    title={Lower bound for a class of weak quantum coin flipping protocols},
    author={Andris Ambainis},
    journal={arXiv preprint arXiv:quant-ph/0204063},
    year={2002},
    archivePrefix={arXiv},
    eprint={quant-ph/0204063},
    primaryClass={quant-ph cs.CR}
}