The Physical Impossibility of Quantum Computational Speedup
The Physical Impossibility of Quantum Computational Speedup: Two Independent Arguments from Quantum-Geometry Dynamics Quantum computing promises computational advantages that are, in the most celebrated cases, exponential. Shor's algorithm factors integers exponentially faster than the best known classical algorithm; G...