On exact quantum query complexity

Details On exact quantum query complexity On exact quantum query complexity

2011-11-02

arxiv.org/abs/1111.0475v1

Physics

Quantum Physics

26 pages

Scientific paper

We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these functions cannot be obtained by simply computing parities of pairs of bits. We also characterise the model of nonadaptive exact quantum query complexity in terms of coding theory and completely characterise the query complexity of symmetric boolean functions in this context. These results were originally inspired by numerically solving the semidefinite programs characterising quantum query complexity for small problem sizes. We include numerical results giving the optimal success probabilities achievable by quantum algorithms computing all boolean functions on up to 4 bits, and all symmetric boolean functions on up to 6 bits.

Affiliated with

Also associated with

No associations

Rating

On exact quantum query complexity 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 On exact quantum query complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On exact quantum query complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-328154