Complexity Classes:
P: polynomial with no random classical computer
NP: polynomial verification, or, equivalently, there exists a randomized algorithm can try to find the answer with non-zero probability
NP-complete: hardest in NP
BPP: polynomial with random classical computer (BPP = P)
BQP: polynomial with random quantum computer
CCNOT
(just NOT, CNOT, H
)H, NOT, CNOT, 1QubitRot(pi/8)
is quantum-completePP: quantum computer can get 0.5 + \gamma probability, but classical can get 0.5 + \gamma / 2^n probability.
Table of Content