Communication Complexity with Small Advantage
نویسندگان
چکیده
منابع مشابه
Communication Complexity with Small Advantage
We study problems in randomized communication complexity when the protocol is only required to attain some small advantage over purely random guessing, i.e., it produces the correct output with probability at least ǫ greater than one over the codomain size of the function. Previously, Braverman and Moitra (STOC 2013) showed that the set-intersection function requires Θ(ǫn) communication to achi...
متن کاملQuantum communication complexity advantage implies violation of a Bell inequality.
We obtain a general connection between a large quantum advantage in communication complexity and Bell nonlocality. We show that given any protocol offering a sufficiently large quantum advantage in communication complexity, there exists a way of obtaining measurement statistics that violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical...
متن کاملComparative Advantage, Complexity, and Volatility∗
Less developed countries tend to experience higher output volatility, a fact that is in part explained by their specialization in more volatile sectors. This paper proposes theoretical explanations for this pattern of specialization – with the complexity of the goods playing a central role. Specifically, less developed countries with lower institutional ability to enforce contracts, or alternat...
متن کاملCommunication Complexity of Key Agreement on Small Ranges
This paper studies a variation on classical key-agreement and consensus problems in which the set S of possible keys is the range of a random variable that can be sampled. We give tight upper and lower bounds of dlog2 ke bits on the communication complexity of agreement on some key in S, using a form of Sperner’s Lemma, and give bounds on other problems. In the case where keys are generated by ...
متن کاملCorrection for Buhrman et al., Quantum communication complexity advantage implies violation of a Bell inequality.
PHYSICS Correction for “Quantum communication complexity advantage implies violation of a Bell inequality,” by Harry Buhrman, Łukasz Czekaj, Andrzej Grudka, Michał Horodecki, Paweł Horodecki, Marcin Markiewicz, Florian Speelman, and Sergii Strelchuk, which appeared in issue 12, March 22, 2016, of Proc Natl Acad Sci USA (113:3191–3196; first published March 8, 2016; 10.1073/ pnas.1507647113). Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2020
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-020-00192-w