This article says that "...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."

I think this would be of interest to those who are more advanced on our site. The link is: Magic quantum wand does not vanish hard math