Quantum weak coin-flipping with bias of 0.192
| dc.creator | Mochon, Carlos | |
| dc.date | 2004-03-26 | |
| dc.date | 2004-10-12 | |
| dc.date.accessioned | 2026-07-07T06:09:24Z | |
| dc.date.available | 2026-07-07T06:09:24Z | |
| dc.description | A family of protocols for quantum weak coin-flipping which asymptotically achieve a bias of 0.192 is described in this paper. The family contains protocols with n+2 messages for all n>1. The case n=2 is equivalent to the protocol of Spekkens and Rudolph with bias of 0.207. 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. The paper constructs an analytical solution to the dual problem which provides an upper bound on the amount that a party can cheat. | |
| dc.description | 13 pages, REVTeX 4 (minor corrections in v2). Arxiv paper is slightly longer than the FOCS version and contains extra examples and discussion | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0403193 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0403193 | |
| dc.identifier | In proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/91947 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum weak coin-flipping with bias of 0.192 | |
| dc.type | text |