Interactive Visualization
Quantum vs Classical: The Factoring Race
Watch a classical brute-force approach race against Shor's Algorithm on the same factoring problem, at different number sizes. The animation timing is compressed for visibility — see the note below for what's really being illustrated.
What this animation is really showing
The visual race timing above is compressed for watchability — it is not a literal real-time simulation. What it's meant to illustrate is the actual mathematical relationship: classical factoring difficulty grows exponentially with number size, while Shor's Algorithm's step count grows only polynomially. At small sizes (8-bit, 16-bit), this gap is barely noticeable — both approaches finish quickly. At large sizes (2048-bit, the kind used in real RSA encryption), the classical approach would take longer than the age of the universe, while Shor's Algorithm scales gracefully.
An important caveat
This visualization assumes a large, error-corrected quantum computer capable of actually running Shor's Algorithm at these sizes — which doesn't exist yet. No current quantum hardware can factor a real 2048-bit RSA key. See our Path to Fault Tolerance article for what's actually required to get there, and our Harvest Now, Decrypt Later entry for why this matters today regardless.