Vanishing-Error Approximate Degree and QMA Complexity

09/16/2019
by   Alexander A. Sherstov, et al.
0

The ϵ-approximate degree of a function f X →{0, 1} is the least degree of a multivariate real polynomial p such that |p(x)-f(x)| ≤ϵ for all x ∈ X. We determine the ϵ-approximate degree of the element distinctness function, the surjectivity function, and the permutation testing problem, showing they are Θ(n^2/3log^1/3(1/ϵ)), Θ̃(n^3/4log^1/4(1/ϵ)), and Θ(n^1/3log^2/3(1/ϵ)), respectively. Previously, these bounds were known only for constant ϵ. We also derive a connection between vanishing-error approximate degree and quantum Merlin–Arthur (QMA) query complexity. We use this connection to show that the QMA complexity of permutation testing is Ω(n^1/4). This improves on the previous best lower bound of Ω(n^1/6) due to Aaronson (Quantum Information Computation, 2012), and comes somewhat close to matching a known upper bound of O(n^1/3).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2020

Improved Approximate Degree Bounds For k-distinctness

An open problem that is widely regarded as one of the most important in ...
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
06/02/2019

Approximate degree, secret sharing, and concentration phenomena

The ϵ-approximate degree deg_ϵ(f) of a Boolean function f is the least d...
research
09/04/2022

The Approximate Degree of DNF and CNF Formulas

The approximate degree of a Boolean function f{0,1}^n→{0,1} is the minim...
research
04/29/2020

The Dual Polynomial of Bipartite Perfect Matching

We obtain a description of the Boolean dual function of the Bipartite Pe...
research
06/09/2021

Strongly Sublinear Algorithms for Testing Pattern Freeness

Given a permutation π:[k] → [k], a function f:[n] →ℝ contains a π-appear...
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