Shor's Algorithm and the Unproven Premise: An Assumption Audit of the Quantum Factoring Narrative
QNFO Research, Rowan Brad Quni-Gudzinas
Abstract
Systematic audit decomposing Shor's 1994 algorithm into nine assumptions spanning number theory, computational complexity, and quantum physics. The central finding: Shor proved FACTORING ∈ BQP (factoring is in quantum polynomial time), but the claim "quantum computers break RSA" additionally requires FACTORING ∉ BPP — a premise unproven after 30 years. Delivers 17 artifacts: manuscript, Shor-Crossover Simulator (Python + HTML dashboard), policy brief, abelian HSP classification audit, GNFS constant trajectory analysis, NIST PQC narrative analysis, expert survey synthesis, formal claim gap analysis, Shor failure probability bounds, classical ORDER-FINDING analysis, and Knowledge Graph cross-reference against 611 QNFO publications. RSA-2048 requires 2.1-7.9M physical qubits; crossover at ~2040 under optimistic projections.