3 ms·
Quantum computers still can't solve NP-complete problems in polynomial time, sadly. Take a look at the BQP complexity class; it's only a subset of NP.
by Filligree 10y ago
Quantum computers still can't solve NP-complete problems in polynomial time, sadly. Take a look at the BQP complexity class; it's only a subset of NP.