Scott Aaronson has commented numerous times on the so-called quantum computer produced by D-Wave. Here is an excerpt from his blog (full article available at
http://www.scottaaronson.com/blog/?p=954):
"The second question is one that I’ve encountered many times on the blogosphere: who cares how D-Wave’s system works, and whether it does or doesn’t exploit quantum coherence, as long as it solves practical problems faster? Sure, maybe what D-Wave is building is really a series of interesting, useful, but still basically “classical” annealing devices. Maybe the word “quantum” is functioning here as the stone in a stone soup: attracting money, interest, and talented people to build something that, while neat, ultimately doesn’t much depend on quantum mechanics at all. As long as D-Wave’s (literal!) black box solves the problem instances in such-and-such amount of time, why does it matter what’s inside?"
"To see the obtuseness of this question, consider a simple thought experiment: suppose D-Wave were marketing a classical, special-purpose, $10-million computer designed to perform simulated annealing, for 90-bit Ising spin glass problems with a certain fixed topology, somewhat better than an off-the-shelf computing cluster. Would there be even 5% of the public interest that there is now? I think D-Wave itself would be the first to admit the answer is no."
A brief summary is that the D-Wave "quantum computer" referenced by the OP may not even be a quantum computer and will certainly not be a threat to Bitcoin without further major scientific breakthroughs.
Here is Scott's Bio from his latest book, "Quantum Computing since Democritus," which is highly recommended for those interested in the subject:
Scott Aaronson is an Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Considered one of the top quantum complexity theorists in the world, he is well known both for his research in quantum computing and computational complexity theory, and for his widely read blog Shtetl-Optimized. Professor Aaronson also created Complexity Zoo, an online encyclopedia of computational complexity theory, and has written popular articles for Scientific American and The New York Times. His research and popular writing have earned him numerous awards, including the United States Presidential Early Career Award for Scientists and Engineers and the Alan T. Waterman Award.