# Quantum computers can search arbitrarily large databases by a single query

Source: [Quantum computers can search arbitrarily large databases by a single query](<https://www.sota2.com/research/paper/68fa248a2c2a3760193a58fe>)

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

Data updated: 2025-10-24T09:17:09.832Z

Authors: Lov K. Grover

Published: 1997-06-03T00:30:54.000Z

## Abstract

This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database has to return a (YES/NO) answer). A classical algorithm will be limited to the information theoretic bound of at least O(log N) queries (which it would achieve by using a binary search).

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

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