[adrianN]

This article is full of bullshit claims about the power of quantum computers. There are no known quantum algorithms for NP-complete problems like the travelling salesman problem mentioned in the article that run faster than exponential time. Quantum computers in general don't consider an exponential number of possible solutions, or if they do, you can't extract the true solution from the quantum state.

[Tossrock]

There seems to be a general misunderstanding of what quantum computers are capable of in the public mind, or at least that slice of it that is even aware of quantum computers' existence. I was just reading Hominids by Robert J Sawyer and it involves a quantum computer. He describes how it 'checks every possible answer simultaneously' to find the prime factors of a number instantaneously...which of course is not how Shor's algorithm actually works.