Algorithmcore
Simon's algorithm
Also called Simon's period-finding.
Finds the hidden period with polynomially many queries, an early oracle separation from classical computation.
Finds the hidden period with polynomially many queries, an early oracle separation from classical computation.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag FEHRFQ Edit this page History Report an error