I don't suppose you could spend a post or two explaining in your nice easy to understand way exactly what it is a quantum computer is supposed to do and how this might impact the NP problems.
It's not exactly known.
Grover's algorithm provides a quadratic speedup over brute-force algorithms for solving NP-complete problems, but that still leaves them as exponential-time. BQP (Bounded error, quantum, polynomial-time; basically the complexity class of quantum computers) is suspected to be disjoint from NP and a superset of P, but neither is known for sure.
This is an inclusive guide to the series of posts on quantum mechanics that began on April 9th, 2008, including the digressions into related topics (such as the difference between Science and Bayesianism) and some of the preliminary reading.
You may also be interested in one of the less inclusive post guides, such as:
My current plan calls for the quantum physics series to eventually be turned into one or more e-books.
Preliminaries:
Basic Quantum Mechanics:
Many Worlds:
(At this point in the sequence, most of the mathematical background has been built up, and we are ready to evaluate interpretations of quantum mechanics.)
Timeless Physics:
(Now we depart from what is nailed down in standard physics, and enter into more speculative realms - particularly Julian Barbour's Machian timeless physics.)
Rationality and Science:
(Okay, so it was many-worlds all along and collapse theories are silly. Did first-half-of-20th-century physicists really screw up that badly? How did they go wrong? Why haven't modern physicists unanimously endorsed many-worlds, if the issue is that clear-cut? What lessons can we learn from this whole debacle?)