Still unresolved
As Evgeny commented, the D-wave folks didn’t claim to solve NP-hard problems.
For the life of me, I couldn’t understand how adiabatic evolution is in line with one of the fundamental theorems of computational complexity. The fundamental theorem being that every NP-hard problem can be converted into any other NP-hard problem in polynomial time. It seems that adiabatic evolution only works on problems were the target Hamiltonian is not too “far” away from the initial Hamiltonian. Furthermore, the evolution time grows exponentially with distance. How’s that polynomial?
That clears up a lot of things, but not all.
PS: Thanks to Adam for the picture. Calin is obviously turned on by NP-completeness….:P