A complexity class is a collection of computational problems that can be solved by a computational model under certain resource constraints. For instance, the complexity class 展开

The important complexity classes P, BPP, BQP, PP, and PSPACE can be compared based on promise problems. A promise problem is a decision … 展开

There is no known way to efficiently simulate a quantum computational model with a classical computer. This means that a classical computer … 展开

It has been speculated that further advances in physics could lead to even faster computers. For instance, it has been shown that a non-local … 展开

The class of problems that can be efficiently solved by a quantum computer with bounded error is called BQP ("bounded error, quantum, … 展开

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 展开

• Quantum computing
• Quantum Turing machine
• Polynomial hierarchy (PH) 展开