Grover's algorithm: Difference between revisions

{{Use American English|date=January 2019}}In [[quantum computing]], '''Grover's algorithm''', also known as the '''quantum search algorithm''', refers tois 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 <math>O(\sqrt{N})</math> evaluations of the function, where <math>N</math> is the size of the function's [[domain of a function|domain]]. It was devised by [[Lov Grover]] in 1996.<ref>{{Cite book|last=Grover|first=Lov K.|title=Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 |chapter=A fast quantum mechanical algorithm for database search |date=1996-07-01|chapter-url=https://doi.org/10.1145/237814.237866|location=Philadelphia, Pennsylvania, USA|publisher=Association for Computing Machinery|pages=212–219|doi=10.1145/237814.237866|arxiv=quant-ph/9605043|bibcode=1996quant.ph..5043G|isbn=978-0-89791-785-8|s2cid=207198067}}</ref>