Brute force on quantum computer will require around 2^(n/2) invocations of algorithm, compared to 2^n on classical computer. Not a huge problem.
http://en.wikipedia.org/wiki/Key_size#Effect_of_quantum_comp...
I was under the impression that QNP (the class of problems solvable by a quantum non-deterministic Turing machine in P-time) is a (non strict) subset of NP. Things might have changed since I last checked though.
Did you mean superset instead of subset?
Anyway for my statement I was only interested deterministic polynomial time (perhaps with access to randomness) with or without quantum capabilities.
"Why Philosophers Should Care About Computational Complexity" (http://arxiv.org/abs/1108.1791v3) is a good read about this---amongst other things.
I did mean subset, apparently a quantum computer could not solve every NP-complete problem in polynomial time. factorisation seems to be one of the candidates to benefit from quantum computation (thanks to Shor's algorithm), but SAT (for instance) would not, at least based on current state-of-art
(We do not know everything about that class, yet. But we strongly suspect that it is neither a superset nor a subset of NP.)