A fast quantum mechanical algorithm for estimating the median

Details A fast quantum mechanical algorithm for estimating the median A fast quantum mechanical algorithm for estimating the median

1996-07-29

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

Physics

Quantum Physics

14 pages, single postscript file

Scientific paper

Consider the problem of estimating the median of N items to a precision epsilon, i.e., the estimate should be such that, with a high probability, the number of items, with values both smaller than and larger than this estimate, is less than N*(1+epsilon)/2. Any classical algorithm to do this will need at least O(1/epsilon^2) samples. Quantum mechanical systems can simultaneously carry out multiple computations due to their wave like properties. This paper describes an O(1/epsilon) step algorithm for the above estimation.

Affiliated with

Also associated with

No associations

Rating

A fast quantum mechanical algorithm for estimating the median 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 A fast quantum mechanical algorithm for estimating the median, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast quantum mechanical algorithm for estimating the median will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446589