Simon's Algorithm (2D): Hidden XOR-Period Solver

Simon's algorithm is the quantum computing library's classic proof that entanglement and interference can buy an exponential speedup: given oracle access to a function hiding a secret XOR-period s, a quantum computer recovers s in O(n) queries where any classical algorithm needs O(2^n/2). This 2D bar-chart view renders the full candidate space for s and runs the real oracle-sampling distribution P(y) = 1/2^n-1 for y·s ≡ 0 (mod 2). Every query submitted collapses the bars of every candidate that fails the new GF(2) constraint, visibly shrinking the search space until, after roughly n − 1 independent equations, only the true secret is left standing — with the reduced GF(2) basis shown explicitly alongside the raw equation list.