arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9607024quant-ph

A fast quantum mechanical algorithm for estimating the median

Lov K. Grover

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑