Lower bound for a class of weak quantum coin flipping protocols
Quantum Physics
2007-05-23 v1 Cryptography and Security
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 .
Cite
@article{arxiv.quant-ph/0204063,
title = {Lower bound for a class of weak quantum coin flipping protocols},
author = {Andris Ambainis},
journal= {arXiv preprint arXiv:quant-ph/0204063},
year = {2007}
}
Comments
6 pages