Theoretical Quantum computer using entanglement to perform their calculations make no claim to solve NP-hard problems. They can only solve some very specific class of problems, that are well identified but are still interesting. Integer factorisation is one of them, but factorisation is not thought to be in NP-complete, although we are not certain at this stage.
There is an old article in PNAS that says that adiabatic quantum computers are theoretically no better than classical computers at solving NP-hard problems. So even if D-Wave had a truly working adiabatic quantum computer, it is not clear that it would perform orders of magnitudes better than what we have now.
Anyway all of this is very interesting to watch, but the fact that D-Wave is so secretive is not very compatible with progress in the field.