Quantum computing is not known to allow you to compute NP hard problems in linear (or polynomial) time. Specifically, the relationship between BQP and NP is ope

Quantum computing is not known to allow you to compute NP hard problems in linear (or polynomial) time. Specifically, the relationship between BQP and NP is open, but widely believed to be not equal (just as the general community's priors are biased towards P \neq NP). Here's a hint as to why: http://en.wikipedia.org/wiki/Grover%27s_algorithm#Optimality http://en.wikipedia.org/wiki/Grover%27s_algorithm#Optimality If you are interested in what exactly the D-Wave computer is doing, http://www.scottaaronson.com/blog/?p=1400 http://www.scottaaronson.com/blog/?p=1400 is a good source.