The quantum query complexity of learning multilinear polynomials

Details The quantum query complexity of learning multilinear polynomials The quantum query complexity of learning multilinear polynomials

2011-05-17

arxiv.org/abs/1105.3310v3

Physics

Quantum Physics

8 pages; v3: essentially published version

Scientific paper

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 F_q. Any bounded-error classical algorithm for this task requires Omega(n^d) 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.

Affiliated with

Also associated with

No associations

Rating

The quantum query complexity of learning multilinear polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The quantum query complexity of learning multilinear polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The quantum query complexity of learning multilinear polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727710