Classical lower bounds from quantum upper bounds

by   Shalev Ben-David, et al.

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the combinatorial group testing problem. We show that for any function f, the approximate degree of computing the OR of n copies of f is Omega(sqrtn) times the approximate degree of f, which is optimal. No such general result was known prior to our work, and even the lower bound for the OR of ANDs function was only resolved in 2013. We then prove an analogous result in communication complexity, showing that the logarithm of the approximate rank (or more precisely, the approximate gamma_2 norm) of F: X x Y -> 0,1 grows by a factor of Omega (sqrtn) when we take the OR of n copies of F, which is also essentially optimal. As a corollary, we give a new proof of Razborov's celebrated Omega(sqrtn) lower bound on the quantum communication complexity of the disjointness problem. Finally, we generalize both these results from composition with the OR function to composition with arbitrary symmetric functions, yielding nearly optimal lower bounds in this setting as well.


page 1

page 2

page 3

page 4


Approximate degree lower bounds for oracle identification problems

The approximate degree of a Boolean function is the minimum degree of re...

The composition complexity of majority

We study the complexity of computing majority as a composition of local ...

Lower Bounds on Stabilizer Rank

The stabilizer rank of a quantum state ψ is the minimal r such that | ψ⟩...

Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

In this work, we prove a hypercontractive inequality for matrix-valued f...

Post-selected Classical Query Complexity

We study classical query algorithms with post-selection, and find that t...

Sign-Rank Can Increase Under Intersection

The communication class UPP^cc is a communication analog of the Turing M...

On the Probabilistic Degrees of Symmetric Boolean functions

The probabilistic degree of a Boolean function f:{0,1}^n→{0,1} is define...

Please sign up or login with your details

Forgot password? Click here to reset