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


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.

  • 3
    $\begingroup$ What about the other way around. If NP-complete is proved to be in BQP, does that say anything about P vs NP? $\endgroup$ Jan 24 '17 at 7:39
  • 1
    $\begingroup$ Nothing was known in 2007, though that was quite some time ago. $\endgroup$ Jan 24 '17 at 8:01
  • 1
    $\begingroup$ @kptlronyttcna I think it would not say anything on P vs NP as P vs BQP is also unestablished yet. $\endgroup$
    – P.Péter
    Jan 24 '17 at 14:01

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.