Factoring is almost certainly not NP-hard. That would mean that NP is contained in BQP which would be a staggering result. While there are some NP problems that

Factoring is almost certainly not NP-hard. That would mean that NP is contained in BQP which would be a staggering result. While there are some NP problems that are in BQP the idea that somehow NP-complete problems are solvable in polynomial time on a quantum computer seems kinda ridiculous to me. I'd be happy to be proven wrong some time in the future though.