A Number Theoretic Interpolation Between Quantum and Classical Complexity Classes


We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.