May 15, 2015 · We take a computational optimization approach, based mostly on convex optimization, to the search for simple and explicit quantum strong coin-flipping ...

Mar 3, 2014 · We take a computational optimization approach, based mostly on convex optimization, to the search for simple and explicit quantum strong coin-flipping ...

Abstract. Coin-flipping is a cryptographic task in which two physically separated, mis- trustful parties wish to generate a fair coin-flip by communicating ...

We present a search algorithm to identify protocols with low bias within a natural class, protocols based on bit-commitment (Nayak and Shor in Phys Rev A 67(1): ...

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.

We present a search algorithm to identify protocols with low bias within a natural class, protocols based on bit-commitment (Nayak and Shor in Phys Rev A 67(1): ...

The above lemma uses Ω(n2) second-order cone constraints and the usual treatment of these “cone constraints” with optimal self-concordant barrier functions lead ...

We focus on a family of quantum coin-flipping protocols based on quantum bit-commitment. We discuss how the semidefinite programming formulations of ...

Jan 15, 2019 · [36] Ashwin Nayak, Jamie Sikora, and Levent Tunçel. A search for quantum coin-flipping protocols using optimization techniques. Mathematical ...

This paper studies the problem of simulating a coin of arbitrary real bias q with a coin of arbitrary real bias p with minimum loss of entropy.