# Quantum computers can search rapidly by using almost any transformation

Source: [Quantum computers can search rapidly by using almost any transformation](<https://www.sota2.com/research/paper/68fa23662c2a376019396f81>)

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

Data updated: 2025-10-24T06:45:20.703Z

Authors: Lov K. Grover

Published: 1997-12-03T22:06:53.000Z

## Abstract

A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology.

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

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