= Lov Grover
{c}
{wiki}
= Lov K. Grover
{c}
{synonym}
<Lov Grover> introduced a <quantum algorithm> for an unstructured <search problem> that finds a marked item among $N$ possibilities with $O(\sqrt N)$ queries. The <algorithm> repeatedly changes <quantum phases> so that the amplitude of a desired outcome grows. Its <query complexity> concerns access to the marking rule; the time needed to implement that rule still matters in an application.<A fast quantum mechanical algorithm for database search by Lov Grover>[abstract and inversion-about-average construction]{ref}
Back to article page
