Each classical public-coin protocol for coin flipping is naturally associated
with a quantum protocol for weak coin flipping. The quantum protocol is
obtained by replacing classical randomness with quantum entanglement and by
adding a cheat detection test in the last round that verifies the integrity of
this entanglement. The set of such protocols defines a family which contains
the protocol with bias 0.192 previously found by the author, as well as
protocols with bias as low as 1/6 described herein. The family is analyzed by
identifying a set of optimal protocols for every number of messages. In the
end, tight lower bounds for the bias are obtained which prove that 1/6 is
optimal for all protocols within the family.
%0 Generic
%1 citeulike:95928
%A Mochon, Carlos
%D 2005
%K probability protocol
%T A large family of quantum weak coin-flipping protocols
%U http://arxiv.org/abs/quant-ph/0502068
%X Each classical public-coin protocol for coin flipping is naturally associated
with a quantum protocol for weak coin flipping. The quantum protocol is
obtained by replacing classical randomness with quantum entanglement and by
adding a cheat detection test in the last round that verifies the integrity of
this entanglement. The set of such protocols defines a family which contains
the protocol with bias 0.192 previously found by the author, as well as
protocols with bias as low as 1/6 described herein. The family is analyzed by
identifying a set of optimal protocols for every number of messages. In the
end, tight lower bounds for the bias are obtained which prove that 1/6 is
optimal for all protocols within the family.
@misc{citeulike:95928,
abstract = {Each classical public-coin protocol for coin flipping is naturally associated
with a quantum protocol for weak coin flipping. The quantum protocol is
obtained by replacing classical randomness with quantum entanglement and by
adding a cheat detection test in the last round that verifies the integrity of
this entanglement. The set of such protocols defines a family which contains
the protocol with bias 0.192 previously found by the author, as well as
protocols with bias as low as 1/6 described herein. The family is analyzed by
identifying a set of optimal protocols for every number of messages. In the
end, tight lower bounds for the bias are obtained which prove that 1/6 is
optimal for all protocols within the family.},
added-at = {2007-08-18T13:22:24.000+0200},
author = {Mochon, Carlos},
biburl = {https://www.bibsonomy.org/bibtex/2f695a46ea2e6246a21b59006ae93dc0c/a_olympia},
citeulike-article-id = {95928},
description = {citeulike},
eprint = {quant-ph/0502068},
interhash = {4ce68d083e72f756ab5964b54dc36d0d},
intrahash = {f695a46ea2e6246a21b59006ae93dc0c},
keywords = {probability protocol},
month = {February},
priority = {2},
timestamp = {2007-08-18T13:22:53.000+0200},
title = {A large family of quantum weak coin-flipping protocols},
url = {http://arxiv.org/abs/quant-ph/0502068},
year = 2005
}