Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size

Details Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size

2009-08-18

arxiv.org/abs/0908.2468v1

Physics

Quantum Physics

19 pages

Scientific paper

This paper considers the query complexity of the functions in the family F_{N,M} of N-variable Boolean functions with onset size M, i.e., the number of inputs for which the function value is 1, where 1<= M <= 2^{N}/2 is assumed without loss of generality because of the symmetry of function values, 0 and 1. Our main results are as follows: (1) There is a super-linear gap between the average-case and worst-case quantum query complexities over F_{N,M} for a certain range of M. (2) There is no super-linear gap between the average-case and worst-case randomized query complexities over F_{N,M} for every M. (3) For every M bounded by a polynomial in N, any function in F_{N,M} has quantum query complexity Theta (sqrt{N}). (4) For every M=O(2^{cN}) with an arbitrary large constant c<1, any function in F_{N,M} has randomized query complexity Omega (N).

Affiliated with

Also associated with

No associations

Rating

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size 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 Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8104