Average case quantum lower bounds for computing the boolean mean

Details Average case quantum lower bounds for computing the boolean mean Average case quantum lower bounds for computing the boolean mean

2003-11-03

arxiv.org/abs/quant-ph/0311007v1

Physics

Quantum Physics

18 pages

Scientific paper

We study the average case approximation of the Boolean mean by quantum algorithms. We prove general query lower bounds for classes of probability measures on the set of inputs. We pay special attention to two probabilities, where we show specific query and error lower bounds and the algorithms that achieve them. We also study the worst expected error and the average expected error of quantum algorithms and show the respective query lower bounds. Our results extend the optimality of the algorithm of Brassard et al.

Affiliated with

Also associated with

No associations

Rating

Average case quantum lower bounds for computing the boolean mean 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 case quantum lower bounds for computing the boolean mean, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average case quantum lower bounds for computing the boolean mean will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232626