# A fast quantum mechanical algorithm for estimating the median

Source: [A fast quantum mechanical algorithm for estimating the median](<https://www.sota2.com/research/paper/68fa1ff77a2b558e2932da32>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T20:21:41.486Z

Authors: Lov K. Grover

Published: 1996-07-29T19:30:14.000Z

## Abstract

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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/quant-ph/9607024>)

[PDF](<https://arxiv.org/pdf/quant-ph/9607024.pdf>)
