A fast quantum mechanical algorithm for database search

Lov K. Grover
1996 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96  
An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records. Quantum mechanical systems can do several operations simultaneously due to their wave like properties. This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record. It
more » ... is within a constant factor of the fastest possible quantum mechanical algorithm.
doi:10.1145/237814.237866 dblp:conf/stoc/Grover96 fatcat:nr3iqw4eorem5o3dpjoyygezy4