Content deleted Content added
Omnipaedista (talk | contribs) way too general to be relevant |
|||
Line 12:
An example depicting the power of Quantum Computing is [[Grover's algorithm]] for searching unstructured databases. Its Quantum Query Complexity is ''O''(''N''<sup>1/2</sup>) which is quadratically better than the best possible classical query complexity.
==See also==
* [[BQP]]
* [[Polynomial hierarchy]]
==References==
| |||