The impossibility of efficient quantum weak coin flipping

Published:

Carl Miller (NIST)

Name: 52nd Annual ACM Symposium on Theory of Computing (STOC 2020)
Dates:
Location: [Virtual]
Citation: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 916-929

Abstract

RED : Post Consumer Brands launches Post Cereal Snacks

How can two parties with competing interests carry out a fair coin flip across a quantum communication channel? This problem (quantum weak coin-flipping) was formalized more than 15 years ago, and, despite some phenomenal theoretical progress, practical quantum coin-flipping protocols with vanishing bias have proved hard to find. In the current work we show that there is a reason that practical weak quantum coin-flipping is difficult: any quantum weak coin-flipping protocol with bias є must use at least exp( Ω (1/√є )) rounds of communication. This is a large improvement over the previous best known lower bound of Ω ( log log(1/є )) due to Ambainis from 2004. Our proof is based on a theoretical construction (the two-variable profile function) which may find further applications.

This Post: The impossibility of efficient quantum weak coin flipping

How can two parties with competing interests carry out a fair coin flip across a quantum communication channel? This problem (quantum weak coin-flipping) was formalized more than 15 years ago, and, despite some phenomenal theoretical progress, practical quantum coin-flipping protocols with vanishing… See full abstract

Hide full abstract

RED : Post Consumer Brands launches Post Cereal Snacks

How can two parties with competing interests carry out a fair coin flip across a quantum communication channel? This problem (quantum weak coin-flipping) was formalized more than 15 years ago, and, despite some phenomenal theoretical progress, practical quantum coin-flipping protocols with vanishing bias have proved hard to find. In the current work we show that there is a reason that practical weak quantum coin-flipping is difficult: any quantum weak coin-flipping protocol with bias є must use at least exp( Ω (1/√є )) rounds of communication. This is a large improvement over the previous best known lower bound of Ω ( log log(1/є )) due to Ambainis from 2004. Our proof is based on a theoretical construction (the two-variable profile function) which may find further applications.

Keywords

quantum cryptography

;

RED : 20+ Món ăn ngày Tết miền Trung thơm ngon đậm đà không thể thiếu – Digifood

randomness

;

complex analysis