Exact quantum polynomial time
In computational complexity theory, exact quantum polynomial time (EQP or sometimes QP) 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.
In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem exactly and is guaranteed to run in polynomial time.
References
| General |   | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Theorems | |||||||||
| Quantum communication | |||||||||
| Quantum algorithms | |||||||||
| Quantum complexity theory | |||||||||
| Quantum computing models | |||||||||
| Quantum error correction | |||||||||
| Physical implementations |
| ||||||||
| Quantum programming | |||||||||
| |||||||||
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.