Content deleted Content added
Tom.Reding (talk | contribs) m →References: Rem stub tag (class = non-stub & non-list) using AWB |
|||
Line 10:
Quantum Query Complexity is the smallest number of queries to the oracle that are required in order to calculate the function. Clearly, Quantum Query Complexity is a lower bound on the overall time complexity of a function.
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
==External links==
| |||