The quantum query complexity of learning multilinear polynomials
Abstract
In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field Fq. Any bounded-error classical algorithm for this task requires Omega(nd) queries to the polynomial. We give an exact quantum algorithm that uses O(n(d-1)) queries for constant d, which is optimal. In the case q=2, this gives a quantum algorithm that uses O(n(d-1)) queries to identify a codeword picked from the binary Reed-Muller code of order d.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.