That's not what I'm saying. I'm saying that if factoring were NP hard, by extension a quantum computer could solve NP complete problems in polynomial time (since every problem in NP is reducible to every NP hard problem, by definition [0]).
That's all I'm saying... they're implying that you could reduce, say, 3SAT to factoring, which would be very very surprising.
That's all I'm saying... they're implying that you could reduce, say, 3SAT to factoring, which would be very very surprising.
[0] https://en.wikipedia.org/wiki/NP-hardness