The polynomial degree of recursive fourier sampling

Abstract

We present matching upper and lower bounds for the "weak" polynomial degree of the recursive Fourier sampling problem from quantum complexity theory. The degree bound is h + 1, where h is the order of recursion in the problem's definition, and this bound is exponentially lower than the bound implied by the existence of a BQP algorithm for the problem. For the upper bound we exhibit a degree-h + 1 real polynomial that represents the problem on its entire domain. For the lower bound, we show that any non-zero polynomial agreeing with the problem, even on just its zero-inputs, must have degree at least h + 1. The lower bound applies to representing polynomials over any Field. © 2011 Springer-Verlag.