Quantum Weak Coin-Flipping with Bias of 0.192
Author:
- 23 December 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2-11
Abstract
We present a family of protocols for flipping a coin over a telephone in a quantum mechanical setting. The family contains protocols with n + 2 messages for all n > 1, and asymptotically achieves a bias of 0.192. The case n = 2 is equivalent to the protocol of Spekkens and Rudolph with bias 0.207, which was the best known protocol. The case n = 3 achieves a bias of 0.199, and n = 8 achieves a bias of 0.193. The analysis of the protocols uses Kitaev's description of coin-flipping as a semidefinite program. We construct an analytical solution to the dual problem which provides an upper bound on the amount that a party can cheat.Keywords
This publication has 5 references indexed in Scilit:
- Weak coin flipping with small biasInformation Processing Letters, 2004
- Quantum Protocol for Cheat-Sensitive Weak Coin FlippingPhysical Review Letters, 2002
- Degrees of concealment and bindingness in quantum bit commitment protocolsPhysical Review A, 2001
- A new protocol and lower bounds for quantum coin flipping2001
- Coin flipping by telephone a protocol for solving impossible problemsACM SIGACT News, 1983