View source for Physics:EQP (complexity)

In [[Computational complexity theory|computational complexity theory]], '''EQP''' (sometimes called '''QP'''), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability&nbsp;1 and runs in polynomial time. It is the quantum analogue of the complexity class&nbsp;[[P (complexity)|P]].

In other words, there is an [[Algorithm|algorithm]] for a quantum computer (a [[Quantum algorithm|quantum algorithm]]) that solves the decision problem exactly and is guaranteed to run in polynomial time.

==References==
<references />
* {{CZoo|EQP|E#eqp}}

{{quantum_computing}}
{{ComplexityClasses}}

[[Category:Quantum complexity theory]]

{{Sourceattribution|EQP (complexity)|1}}