1 Answers
In computational complexity theory, exact quantum polynomial time is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time. It is the quantum analogue of the complexity class P.
4 views
Answered