14

Is it proven that quantum computation is no better at solving NP complete problems than classical computation or it's just believed?

Nzall
  • 143
  • 3
kptlronyttcna
  • 243
  • 1
  • 7

1 Answers1

11

It is suspected that NP-complete problems cannot be solved in quantum polynomial time (i.e., that they are not in BQP), but this hasn't been proved. We don't expect a proof in the near future, since this would imply that P is different from NP.

Yuval Filmus
  • 280,205
  • 27
  • 317
  • 514