Quantum Boolean Summation with Repetitions in the Worst-Average Setting

Details Quantum Boolean Summation with Repetitions in the Worst-Average Setting Quantum Boolean Summation with Repetitions in the Worst-Average Setting

2003-11-06

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

Physics

Quantum Physics

16 pages

Scientific paper

We study the quantum summation QS algorithm of Brassard, Hoyer, Mosca and Tapp, which approximates the arithmetic mean of a Boolean function defined on $N$ elements. We present sharp error bounds of the QS algorithm in the worst-average setting with the average performance measured in the $L_q$ norm, $q \in [1,\infty]$. We prove that the QS algorithm with $M$ quantum queries, $M

Affiliated with

Also associated with

No associations

Rating

Quantum Boolean Summation with Repetitions in the Worst-Average Setting 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 Quantum Boolean Summation with Repetitions in the Worst-Average Setting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Boolean Summation with Repetitions in the Worst-Average Setting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519558