Magic quantum wand does not vanish hard math
In the end, they conclude that NP-complete problems are just as hard on an adiabatic quantum computer as on a classical computer. And, since earlier work showed the equivalence between different variants of quantum computers, that pretty much shuts down the possibility of any quantum computer helping with NP-complete problems.
more on arstechnica.com
It's seems like the hope for solving NP-complete problems in polynomial time is gone again.
