simon

What problem does it solve?

Simon's algorithm finds the hidden bitstring s in a function f with the promise f(x) = f(x ⊕ s). It enables demonstration of quantum speedups and the hidden-subgroup structure behind Shor's algorithm in an educational setting.

Core Features & Use Cases

• Builds and runs the Simon oracle U_f for a given hidden string s, performs the mid-circuit measurement of the output register, and completes the interference step to reveal linear equations over GF(2).
• Provides end-to-end tooling for learning, prototyping, and validating small-n quantum circuits that exhibit the Simon problem, including classical post-processing to recover s.
• Returns runtime results such as the recovered s, status, and a circuit diagram path to aid analysis and visualization.

Quick Start

Run the included Simon Algorithm example to recover the hidden string s.