Content deleted Content added
adjusted first sentence |
→Quantum complexity theorists: removed section—the inclusion of such a section is is not in accordance with pages for related fields and is inappropriate for an encylopedia |
||
Line 14:
An example depicting the power of quantum computing is [[Grover's algorithm]] for searching unstructured databases. The algorithm's quantum query complexity is <math display="inline">O{\left(\sqrt{N}\right)}</math>, a quadratic improvement over the best possible classical query complexity (i.e. a [[linear search]]).
==See also==
|