Algorithm families
One canonical page per family the registry has real evidence for. A family appears here only when measured, hash-verified runs exist for it — this list being short is a fact about the evidence, not a rendering choice.
2
published records
Unstructured search of N=2^n items with a single marked state: the optimal iteration count grows as (pi/4)sqrt(N) and the success probability at that count approaches certainty. The registry's reference run measures success probability across n = 2..6.
MODELLED · shot-based
Estimation of an eigenphase with an m-qubit counting register: dyadic phases representable in m bits are returned with certainty; non-representable phases concentrate on the nearest bin with probability at least 4/pi^2. The registry's reference runs sweep m = 3..8 for both regimes.
SIMULATED · statevector