TY - GEN
T1 - A new protocol and lower bounds for quantum coin flipping
AU - Ambainis, A.
PY - 2001
Y1 - 2001
N2 - We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum protocols. For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most ε, it must use at least Ω(log log 1/ε) rounds of communication. This implies that the parallel repetition fails for quantum coin flipping. (The bias of a protocol cannot be arbitrarily decreased by running several copies of it in parallel).
AB - We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum protocols. For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most ε, it must use at least Ω(log log 1/ε) rounds of communication. This implies that the parallel repetition fails for quantum coin flipping. (The bias of a protocol cannot be arbitrarily decreased by running several copies of it in parallel).
UR - https://www.scopus.com/pages/publications/0034826544
U2 - 10.1145/380752.380788
DO - 10.1145/380752.380788
M3 - Conference paper
AN - SCOPUS:0034826544
SN - 9781581133493
T3 - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 134
EP - 142
BT - Proceedings of the 33rd annual ACM symposium on theory of computing
PB - Association for Computing Machinery (ACM)
T2 - 33rd Annual ACM Symposium on Theory of Computing, STOC 2001
Y2 - 6 July 2001 through 8 July 2001
ER -