Thread: Using Quantum Computers to Solve NP problems

I understand the difference between P and NP problems, but I just learned about them about an hour ago, so I don't understand too much. My question is:

Could quantum computers would have the ability to solve NP problems better than classical computers?

I have searched around a lot and I haven't been able to find a very straight answer. If anyone could help, that would be great!

Quantum computers are good at solving a class of problems known as BQP or bounded error quantum polynomial time problems. The relationship between NP problems and BQP problems is complicated and an active area of research. The current thought is that the NP-complete problems are distinct from the BQP problems and so quantum computers would not aid in P=NP type issues (unless P does equal NP). In fact our current knowledge of QC's shows that they are useful for a very distinct and small set of problems - integer factorization being the most famous.