Optimal Separation and Strong Direct Sum for Randomized Query Complexity

08/02/2019
by   Eric Blais, et al.
0

We establish two results regarding the query complexity of bounded-error randomized algorithms. * Bounded-error separation theorem. There exists a total function f : {0,1}^n →{0,1} whose ϵ-error randomized query complexity satisfies R_ϵ(f) = Ω( R(f) ·log1/ϵ). * Strong direct sum theorem. For every function f and every k > 2, the randomized query complexity of computing k instances of f simultaneously satisfies R_ϵ(f^k) = Θ(k ·R_ϵ/k(f)). As a consequence of our two main results, we obtain an optimal superlinear direct-sum-type theorem for randomized query complexity: there exists a function f for which R(f^k) = Θ( k log k ·R(f)). This answers an open question of Drucker (2012). Combining this result with the query-to-communication complexity lifting theorem of Göös, Pitassi, and Watson (2017), this also shows that there is a total function whose public-coin randomized communication complexity satisfies R^cc (f^k) = Θ( k log k ·R^cc(f)), answering a question of Feder, Kushilevitz, Naor, and Nisan (1995).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2020

A Strong XOR Lemma for Randomized Query Complexity

We give a strong direct sum theorem for computing xor ∘ g. Specifically,...
research
04/30/2019

Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Lifting theorems are theorems that relate the query complexity of a func...
research
08/17/2020

A near-optimal direct-sum theorem for communication complexity

We show a near optimal direct-sum theorem for the two-party randomized c...
research
02/25/2020

A New Minimax Theorem for Randomized Algorithms

The celebrated minimax principle of Yao (1977) says that for any Boolean...
research
09/23/2019

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead

Buhrman, Cleve and Wigderson (STOC'98) observed that for every Boolean f...
research
08/24/2020

An Optimal Separation of Randomized and Quantum Query Complexity

We prove that for every decision tree, the absolute values of the Fourie...
research
08/26/2022

Randomised Composition and Small-Bias Minimax

We prove two results about randomised query complexity R(f). First, we i...

Please sign up or login with your details

Forgot password? Click here to reset