Metraipolis › archive › dc_d7788892ca0c

Grover's algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Grover%27s_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T14:06:21.446Z
SHA-256 of the archived text
f250a94dfcf93439dfcad43649de3258d17f86ab40c235af8e2671b14a2b59f4
Stable URL of this page
https://metraipolis.com/documento/dc_d7788892ca0c

How to cite

Grover's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Grover%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d7788892ca0c (Metraipolis archive dc_d7788892ca0c, sha256 f250a94dfcf93439dfcad43649de3258d17f86ab40c235af8e2671b14a2b59f4)
BibTeX
@misc{dcd7788892ca0c,
  title = {Grover's algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Grover%27s_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d7788892ca0c; sha256 f250a94dfcf93439dfcad43649de3258d17f86ab40c235af8e2671b14a2b59f4},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Grover%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 O ( N ) {\displaystyle O({\sqrt {N}})} evaluations of the function, where N {\displaystyle N} is the size of the function's domain. It was devised by an Indian-American computer scientist Lov Grover in 1996. The analogous problem in classical computation would have a query complexity O ( N ) {\displaystyle O(N)} (i.e., the function would have to be evaluated O ( N ) {\displaystyle O(N)} times: there is no better approach than trying out all input values one after the other, which, on average, takes N / 2 {\displaystyle N/2} steps). Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani proved that any quantum solution to the problem needs to evaluate the function Ω ( N ) {\displaystyle \Omega ({\sqrt {N}})} times, so Grover's algorithm is asymptotically optimal. Since classical algorithms for NP-complete problems require exponentially many steps, and Grover's algorithm provides at most a quadratic speedup over the classical solution for unstructured search, this suggests that Grover's algorithm by itself will not provide polynomial-time solutions for NP-complete problems (as the square root of an exponential function is still an exponential, not a polynomial function). Unlike other quantum algorithms, which may provide exponential speedup over their classical counterparts, Grover's algorithm provides only a quadratic speedup. However, even quadratic speedup is considerable when N {\displaystyle N} is large, and Grover's algorithm can be applied to speed up broad classes of algorithms. Grover's algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 264 iterations, or a 256-bit key in roughly 2128 iterations. It may not be the case that Grover's algorithm poses a significantly increased risk to encryption over existing classical algorithms, however.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Grover's algorithm» — https://en.wikipedia.org/wiki/Grover%27s_algorithm
Wikidata Q1028292: «quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1028292
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Grover%27s_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1373498442, consultata il 2026-10-06T12:26:06.719Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 03c9fdda34be8135ba320b3bc73206c230307ee3872b707a707c4803eebc023f