We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function f is computable by a 1-query quantum algorithm with error bounded by epsilon<1/2 iff f can be approximated by a degree-2 polynomial with error bounded by epsilon'<1/2. This result holds for two different notions of approximation by a polynomial: the standard definition of Nisan and Szegedy and the approximation by block-multilinear polynomials recently introduced by Aaronson and Ambainis [Aaronson/Ambainis, STOC 2015]. The proof uses Grothendieck's inequality to relate two matrix norms, with one norm corresponding to polynomial approximations and the other norm corresponding to quantum algorithms. We also show two results for polynomials of higher degree. First, there is a total Boolean function which requires ~Omega(n) quantum queries but can be represented by a block-multilinear polynomial of degree ~O(sqrt(n)). Thus, in the general case (for an arbitrary number of queries), block-multilinear polynomials are not equivalent to quantum algorithms. Second, for any constant degree k, the two notions of approximation by a polynomial (the standard and the block-multilinear) are equivalent. As a consequence, we solve an open problem from [Aaronson/Ambainis, STOC 2015], showing that one can estimate the value of any bounded degree-k polynomial p:{0,1}^n -> [-1,1] with O(n^{1-1/(2k)) queries.
Motivated by the quantum algorithm in \cite{MN05} for testing commutativity of black-box groups, we study the following problem: Given a black-box finite ring
R=∠r1,...,rk where
{r1,r2,...,rk} is an additive generating set for
R and a multilinear polynomial
f(x1,...,xm) over
R also accessed as a black-box function
f:Rm→R (where we allow the indeterminates
x1,...,xm to be commuting or noncommuting), we study the problem of testing if
f is an \emph{identity} for the ring
R. More precisely, the problem is to test if
f(a1,a2,...,am)=0 for all
ai∈R. We give a quantum algorithm with query complexity
O(m(1+α)m/2km+1m) assuming
k≥(1+1/α)m+1. Towards a lower bound, we also discuss a reduction from a version of
m-collision to this problem. We also observe a randomized test with query complexity
4mmk and constant success probability and a deterministic test with
km query complexity.