Viewing a single comment thread. View all comments

noideaman t1_j1ngjvs wrote

Notice, you didn’t reduce complexity to polynomial switching to quantum. We still don’t know if NP-Complete problems can be solved in polynomial time on a quantum computer. If I recall, the top theoreticians think no.

8

nicuramar t1_j1nv1yn wrote

Yeah, BQP (the problem class solved by quantum computers) is generally believed to be disjunct from NPC.

2