Revision as of 10:39, 23 November 2014 edit Erel Segal (talk \| contribs) Extended confirmed users, IP block exemptions 14,576 edits →Quantum Query Complexity: - language corrections ← Previous edit		Revision as of 05:41, 18 February 2016 edit undo Aravindreddy96 (talk \| contribs) 386 edits mNo edit summary Next edit →
Line 11: 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 known classical query complexity. ==External Links== Complexity Zoo is a good place to read more about Quantum Complexity Theory ==References==

Quantum complexity theory: Difference between revisions