Or you could read the thread and see how that true. QC has uses and it has limitations and Bitcoin isn't a viable use for QC.
There are no know (even theoretical) algorithms to speed up brute force searches of cryptographic hashes... any hashes using QC. None.
http://en.wikipedia.org/wiki/Grover's_algorithm
Every time the difficulty goes up by a factor of 4 for classical miners, it goes up only by 2 to quantum miners.
Grover's algorithm has nothing to do with hashing. It is for lookups. There is no lookup. Miners calculate and discard hashes in realtime. The proof of work is the amount of time it takes to complete the average number of hashes to solve the problem.
Grover's algorithm would require a lookup table for hashes. Given the target space is 2^256 even a planetary sized storage array powered by the molten core, and with storage density billions of times higher than current solid state wouldn't even be able to store a rounding error of the 2^256 range.
TL/DR version: No.