Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment
| dc.creator | Mochon, Carlos | |
| dc.date | 2003-11-24 | |
| dc.date | 2004-10-02 | |
| dc.date.accessioned | 2026-07-07T06:08:25Z | |
| dc.date.available | 2026-07-07T06:08:25Z | |
| dc.description | Quantum protocols for coin-flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin-flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin-flipping with arbitrarily small bias. | |
| dc.description | 7 pages, REVTeX 4 (minor corrections in v2) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0311165 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0311165 | |
| dc.identifier | Phys. Rev. A 70, 032312 (2004) | |
| dc.identifier | doi:10.1103/PhysRevA.70.032312 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/91623 | |
| dc.subject | Quantum Physics | |
| dc.title | Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment | |
| dc.type | text |