Wow. Can't wait to see if this holds up.

For context: "On the other hand, Bennett et al. [11] gave oracle evidence that NP is not in BQP, and while no one regards such evidence as decisive, today it seems extremely unlikely that quantum computers can solve NP-complete problems in polynomial time."

http://www.scottaaronson.com/papers/bqpph.pdf