Grover's algorithm

136nodes240rels

100%

Community · Grover's algorithm

Summary

In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high probability the unique input to a black box function that produces a particular output value, using just evaluations of the function, where is the size of the function's domain.

52 words

SourcesWikipedia

Connections9

classifies the algorithm within the field of quantum computing
Grover's algorithm is a fundamental quantum algorithm that demonstrates the potential for quantum computers to outperform classical machines on specific tasks.
SourcesWikipedia Wikidata Wikipedia Wikidata
provides the general framework for the algorithm's operation
Grover's algorithm is the most prominent example of amplitude amplification, a technique used to increase the probability of measuring a desired state.
SourcesWikipedia Wikidata Wikipedia Wikidata
invented the algorithm in 1996
Lov Grover is the computer scientist who developed this algorithm, fundamentally changing the understanding of quantum search complexity.
SourcesWikipedia Wikidata Wikipedia Wikidata
Broad field of application
Grover's algorithm is one of the most significant algorithms in the field of quantum computing, illustrating the potential for quantum speedups.
SourcesWikipedia Wikidata Wikipedia Wikidata
represents the input mechanism for the search process
The algorithm treats the search space as a black box function, querying it to identify the unique input that produces a specific output value.
SourcesWikipedia Wikidata Wikipedia Wikidata
measures the efficiency of the algorithm
The algorithm is defined by its query complexity, which quantifies how many times the oracle must be called to find the target item.
SourcesWikipedia Wikidata Wikipedia Wikidata
models the black box interaction in the algorithm
The algorithm relies on an oracle machine to evaluate the function, which is the primary metric for determining the algorithm's query complexity.
SourcesWikipedia Wikidata Wikipedia Wikidata
Complexity class membership
Grover's algorithm belongs to the BQP complexity class, which contains problems efficiently solvable by a quantum computer.
SourcesWikipedia Wikidata Wikipedia Wikidata
serves as the primary counterpart in quantum algorithm history
While Shor's algorithm provides exponential speedup for specific number-theoretic problems, Grover's algorithm provides a more general, albeit quadratic, speedup.
SourcesWikipedia Wikidata Wikipedia Wikidata

Facts