Dilemma that cannot be resolved by biased quantum coin flipping
| dc.creator | Ishizaka, Satoshi | |
| dc.date | 2007-03-13 | |
| dc.date | 2008-01-11 | |
| dc.date.accessioned | 2026-07-07T09:21:49Z | |
| dc.date.available | 2026-07-07T09:21:49Z | |
| dc.description | We show that a biased quantum coin flip (QCF) cannot provide the performance of a black-boxed biased coin flip, if it satisfies some fidelity conditions. Although such a QCF satisfies the security conditions of a biased coin flip, it does not realize the ideal functionality, and therefore, does not fulfill the demands for universally composable security. Moreover, through a comparison within a small restricted bias range, we show that an arbitrary QCF is distinguishable from a black-boxed coin flip unless it is unbiased on both sides of parties against insensitive cheating. We also point out the difficulty in developing cheat-sensitive quantum bit commitment in terms of the uncomposability of a QCF. | |
| dc.description | 5 pages and 1 figure. Accepted version | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0703099 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0703099 | |
| dc.identifier | Phys. Rev. Lett. 100, 070501 (2008) | |
| dc.identifier | doi:10.1103/PhysRevLett.100.070501 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155163 | |
| dc.subject | Quantum Physics | |
| dc.title | Dilemma that cannot be resolved by biased quantum coin flipping | |
| dc.type | text |