Content deleted Content added
Added a lot of information about query complexity of certain types of graph problems |
mNo edit summary |
||
Line 47:
==Quantum query complexity ==
One major advantage of using a quantum computational system instead of a classical one, is that a quantum computer may be able to give a [[Polynomial-time algorithm|polynomial time algorithm]] for some problem for which no classical polynomial time algorithm exists, but more importantly, a quantum computer may significantly decrease the calculation time for a problem that a classical computer can already solve efficiently. Essentially, a quantum computer may be able to both determine how long it will take to solve a problem, while a classical computer may be unable to do so, and can also greatly improve the computational efficiency associated with the solution to a particular problem. Quantum query complexity refers to how complex, or how many queries to the graph associated with the solution of a particular problem, are required to solve the problem. Before we delve further into query complexity, let us consider some background regarding graphing solutions to particular problems, and the queries associated with these solutions.
=== Query Models of Directed Graphs ===
| |||