|
|
|
|
|
|
by SAI_Peregrinus
1590 days ago
|
|
|
> Is there anything even a tiny QC can do better, faster, and cheaper than a classical computer? That's an area of active research in computational complexity theory. It's not known if the class BQP[1] (bounded-error quantum polynomial time) is equal to P (classical polynomial time). Many people suspect that BQP > P, but it may not be and quantum computers might not have any problems where they're faster than classical computers. [1] https://en.wikipedia.org/wiki/BQP |
|
|