Lower bound for a class of weak quantum coin flipping protocols
classification
🪐 quant-ph
cs.CR
keywords
classcoinflippingprotocolsquantumweakboundflip
read the original 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/\sqrt{2}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.