Grover's algorithm

English Wikipedia has an article on:

Grover's algorithm

Wikipedia

Named after Indian-American computer scientist Lov Grover, who devised the algorithm in 1996.

Grover's algorithm

1. (computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.
   • 2006, E. Arikan, 22: An Upper Bound on the Rate of Information Transfer by Grover's Algorithm, Rudolf Ahlswede et al. (editors), General Theory of Information Transfer and Combinatorics, Springer, LNCS 4123, page 452,

     Thus, Grover's algorithm has optimal order of complexity. Here, we present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up by Grover's algorithm is the best possible by any algorithm using the same quantum oracle.

   • 2018, Joseph F. Fitzsimons, Eleanor G. Rieffel, Valerio Scarani, 11: Quantum Frontier, Justyna Zander, Pieter J. Mosterman (editors), Computation for Humanity, Taylor & Francis (CRC Press), page 286,

     The best possible classical algorithm uses ${\displaystyle O(N)}$ time. This speed up is only polynomial, but, unlike for Shor's algorithm, it has been proven that Grover's algorithm outperforms any possible classical approach.

   • 2022 , Marco Lanzagorta, Jeffrey Uhlmann, Quantum Computer Science, Springer Nature, page 49,

     However, we cannot output the entire solution dataset using a single application of Grover's algorithm. Indeed, the superposition of states for the last iteration of Grover's algorithm, with known ${\displaystyle k}$, looks like:

     ${\displaystyle \left\vert Q_{A}\right\rangle =G^{r}\left\vert \Psi (0)\right\rangle \approx \sin((2r+1)\phi ){\frac {1}{\sqrt {k}}}\sum _{\mathit {solutions}}\left\vert y\right\rangle }$      (3.59)

     where the probability of finding a nonsolution is presumed to be small and has been neglected in the equation.