Hacker News new | ask | show | jobs
by Filligree 3485 days 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.