# How fast can a quantum computer search?

Source: [How fast can a quantum computer search?](<https://www.sota2.com/research/paper/68fa20047a2b558e2932e0d7>)

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

Data updated: 2025-10-23T20:36:06.504Z

Authors: Lov K. Grover

Published: 1998-09-10T17:43:29.000Z

## Abstract

This paper gives a simple proof of why a quantum computer, despite being in all possible states simultaneously, needs at least 0.707 sqrt(N) queries to retrieve a desired item from an unsorted list of items. The proof is refined to show that a quantum computer would need at least 0.785 sqrt(N) queries. The quantum search algorithm needs precisely this many queries.

## 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/9809029>)

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