Revision as of 18:40, 8 September 2014 edit Hardik24 (talk \| contribs) 3 edits No edit summary ← Previous edit		Revision as of 18:43, 8 September 2014 edit undo Hardik24 (talk \| contribs) 3 edits No edit summary Next edit →
Line 8: It is one of the major field of Quantum Complexity Theory which deals with the number of queries to input in order to calculate the function. In query complexity model, input is given as oracle(Black Box). We get the information about the input by quering oracle. In the start of algorithm we start in some fixed quantum state and the state evolves as we query the oracle. We have to develop an algorithm which minimizes the number of queries required to calculate function. Clearly, Quantum Query Complexity is lower bound on overall time complexity of function and sometimes more important than time complexity. [[Grover's algorithm]] for searching unstructured database is one of the best example depicting the power of Quantum Computing. Quantum Query Complexity of Grover Search is ''O''(''N^''<sup>1/2</sup>) which is quadratically better than best known classical query compleixty. ==References==

Quantum complexity theory: Difference between revisions