# A fast quantum mechanical algorithm for database search

> An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N record...

## Metadata
- Authors: Lov K. Grover
- Published: 1996-01-01
- DOI: https://doi.org/10.1145/237814.237866
- Citations: 8,675
- Source: OpenAlex
- Access: Open Access

## Technology Hub
- Hub: Quantum Computing
- Discipline: Physics / Computer Science
- Hub URL: https://science-database.com/technology/quantum-computing
- Hub llms.txt: https://science-database.com/technology/quantum-computing/llms.txt

## Abstract
An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records. Quantum mechanical systems can do several operations simultaneously due to their wave like properties. This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record. It is within a constant factor of the fastest possible quantum mechanical algorithm.

## Links
- DOI: https://doi.org/10.1145/237814.237866
- OpenAlex: https://openalex.org/W2084652510
- PDF: https://dl.acm.org/doi/pdf/10.1145/237814.237866
- JSON API: https://science-database.com/api/v1/technology/quantum-computing

---
Generated by science-database.com — The Knowledge Interface
Paper ID: oa-W2084652510 | Hub: quantum-computing