Immediate classical shortcut if gcd(a, N) > 1.
Simulation studio
Shor's Algorithm
Pick a small composite and a valid base, run the period-finding step, and inspect how classical post-processing recovers non-trivial factors.
The lab stays deliberately small and pedagogical so learners see where the quantum subroutine ends and where classical number theory takes over.
QAL-04AdvancedQuantum AlgorithmsLive lab
Subject context
Quantum Algorithms
Step through core algorithmic ideas such as teleportation, Deutsch-Jozsa, the QFT, Shor-style period finding, and Grover amplification.
- 5 labs in this subject.
- Difficulty: Advanced.
- Dedicated route: /simulations/subjects/quantum-algorithms/shors-algorithm-period-finding.
Live lab
Interactive simulation workspace
These academy-style labs are designed as compact, browser-playable teaching surfaces: enough interaction to make the core idea legible, without pretending to be a full research workbench.
Interactive academy lab
Shor's Algorithm
Shor-style period finding lives inside a wider factorization workflow: period discovery matters because classical number theory can turn an even order into real factors.
Controls
Outputs
Smallest r such that a^r mod N = 1.
Whether the current selection produces non-trivial factors.
Recovered non-trivial factors: 3 x 5.
What this teaches
Core learning frame
The lab stays deliberately small and pedagogical so learners see where the quantum subroutine ends and where classical number theory takes over.
Pick a small composite and a valid base, run the period-finding step, and inspect how classical post-processing recovers non-trivial factors.
Keep exploring