A fast quantum mechanical algorithm for estimating the median

Simple item page
dc.creatorGrover, Lov K.
dc.date1996-07-29
dc.date.accessioned2026-07-07T06:13:54Z
dc.date.available2026-07-07T06:13:54Z
dc.descriptionConsider 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.
dc.description14 pages, single postscript file
dc.identifierhttps://arxiv.org/abs/quant-ph/9607024
dc.identifierhttp://arxiv.org/abs/quant-ph/9607024
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93272
dc.subjectQuantum Physics
dc.titleA fast quantum mechanical algorithm for estimating the median
dc.typetext

Files

Collections

arXiv