How Quantum coin flipping works part4(Quantum Information Science)

Abstract : So far, most of existed single-shot quantum coin flipping(QCF) protocols failed in a noisy quantum channel. Here, we present a nested-structured framework that makes it possible to achieve partially noise-tolerant QCF, due to that there is a trade-off between the security and the justice correctness. It is showed that noise-tolerant single-shot QCF protocols can be produced by filling the presented framework up with existed or even future protocols. We also proved a lower bound of 0.25, with which a cheating Alice or Bob could bias the outcome. 2. A search for quantum coin-flipping protocols using optimization techniques(arXiv) Author : <a href="https://arxiv.org/search/?searchtype=author&query=Nayak%2C+A" rel="noopener ugc nofollow" target="_blank">Ashwin Nayak</a>, <a href="https://arxiv.org/search/?searchtype=author&query=Sikora%2C+J" rel="noopener ugc nofollow" target="_blank">Jamie Sikora</a>, <a href="https://arxiv.org/search/?searchtype=author&query=Tun%C3%A7el%2C+L" rel="noopener ugc nofollow" target="_blank">Levent Tunçel</a> Abstract : Coin-flipping is a cryptographic task in which two physically separated, mistrustful parties wish to generate a fair coin-flip by communicating with each other. Chailloux and Kerenidis (2009) designed quantum protocols that guarantee coin-flips with near optimal bias. The probability of any outcome in these protocols is provably at most 1/2–√+δ for any given δ>0. However, no explicit description of these protocols is known, and the number of rounds in the protocols tends to infinity as δ goes to 0. In fact, the smallest bias achieved by known explicit protocols is 1/4 (Ambainis, 2001). We take a computational optimization approach, based mostly on convex optimization, to the search for simple and explicit quantum strong coin-flipping protocols. We present a search algorithm to identify protocols with low bias within a natural class, protocols based on bit-commitment (Nayak and Shor, 2003) restricting to commitment states used by Mochon (2005). An analysis of the resulting protocols via semidefinite programs (SDPs) unveils a simple structure. For example, <a href="https://medium.com/@monocosmo77/how-quantum-coin-flipping-works-part4-quantum-information-science-6e094b398cc9">Read More</a>