Algorithm
Shor's Algorithm
Problem: factor large integers by reducing factoring to period finding.
Expected output
The simulator demo shows interference, one ingredient in making patterns visible.
Algorithm
Problem: factor large integers by reducing factoring to period finding.
The simulator demo shows interference, one ingredient in making patterns visible.
Find a repeating pattern in modular powers, then use classical math to extract factors.
Full Shor needs modular arithmetic, phase estimation, and QFT.
A large fault-tolerant version would threaten RSA and related public-key cryptography.
The current DSL cannot express full Shor; this page links to interference and phase building blocks.
# Interference: H then H returns to |0> qubits 1 H 0 H 0 MEASURE 0
What is the quantum part of Shor mainly trying to find?