Is it proven that quantum computation is no better at solving NP complete problems than classical computation or it's just believed?
Asked
Active
Viewed 1,788 times
1 Answers
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
- 276,994
- 27
- 311
- 503
-
3What about the other way around. If NP-complete is proved to be in BQP, does that say anything about P vs NP? – kptlronyttcna Jan 24 '17 at 07:39
-
1Nothing was known in 2007, though that was quite some time ago. – Yuval Filmus Jan 24 '17 at 08:01
-
1@kptlronyttcna I think it would not say anything on P vs NP as P vs BQP is also unestablished yet. – P.Péter Jan 24 '17 at 14:01