Algorithmic Polynomials

01/14/2018
by   Alexander A. Sherstov, et al.
0

The approximate degree of a Boolean function f(x_1,x_2,...,x_n) is the minimum degree of a real polynomial that approximates f pointwise within 1/3. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general. Nearly all known upper bounds on approximate degree arise in an existential manner from bounds on quantum query complexity. We develop a first-principles, classical approach to the polynomial approximation of Boolean functions. We use it to give the first constructive upper bounds on the approximate degree of several fundamental problems: - O(n^3/4-1/4(2^k-1)) for the k-element distinctness problem; - O(n^1-1/k+1) for the k-subset sum problem; - O(n^1-1/k+1) for any k-DNF or k-CNF formula; - O(n^3/4) for the surjectivity problem. In all cases, we obtain explicit, closed-form approximating polynomials that are unrelated to the quantum arguments from previous work. Our first three results match the bounds from quantum query complexity. Our fourth result improves polynomially on the Θ(n) quantum query complexity of the problem and refutes the conjecture by several experts that surjectivity has approximate degree Ω(n). In particular, we exhibit the first natural problem with a polynomial gap between approximate degree and quantum query complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2017

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials

The approximate degree of a Boolean function f is the least degree of a ...
research
10/20/2021

Optimizing Strongly Interacting Fermionic Hamiltonians

The fundamental problem in much of physics and quantum chemistry is to o...
research
09/14/2021

Open Problems Related to Quantum Query Complexity

I offer a case that quantum query complexity still has loads of enticing...
research
09/06/2018

Quantum algorithms and approximating polynomials for composed functions with shared inputs

We give new quantum algorithms for evaluating composed functions whose i...
research
12/30/2021

Set membership with two classical and quantum bit probes

We consider the following problem: Given a set S of at most n elements f...
research
02/22/2020

SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm

Sample- and computationally-efficient distribution estimation is a funda...
research
10/23/2020

Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem

Based on the recent breakthrough of Huang (2019), we show that for any t...

Please sign up or login with your details

Forgot password? Click here to reset