Strong Direct Product Theorems for Quantum Communication and Query Complexity
نویسندگان
چکیده
منابع مشابه
Direct Product Theorems for Classical Communication Complexity via Subdistribution Bounds
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of classical communication complexity. We introduce a new measure, the subdistribution bound , which is a relaxation of the wellstudied rectangle or c...
متن کاملDirect Product Theorems for Communication Complexity via Subdistribution Bounds
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of classical communication complexity. We define a new measure, the subdistribution bound , which is a generalization of the well-studied rectangle or...
متن کاملA Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Disjointness
We prove that two-party randomized communication complexity satisfies a strong direct product property, so long as the communication lower bound is proved by a “corruption” or “one-sided discrepancy” method over a rectangular distribution. We use this to prove new n lower bounds for numberon-the-forehead protocols in which the first player speaks once and then the other two players proceed arbi...
متن کاملCharacterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of f is linearly related to the degree of a “non-deterministic” polynomial for f . We also prove a quantum-classical...
متن کاملA strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of J, Klauck and Nayak [JKN08], thereby our result implying their direct product result in terms of the two-way product subdistribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110842661