Shor's Algorithm
Quantum period finding and integer factorization — visualized step by step
N to factor:
N = 15
N = 21
N = 35
N = 77
N = 91
N = 143
Base a:
Auto (random)
Run Shor's
Step Through
Shor 1994: factor N by finding period r of f(x)=aˣ mod N via QFT — then gcd(a^{r/2}±1, N) yields factors