Grover amplification
Theorem.Grover amplification — P(marked) = sin²((2k+1)θ) with sin θ = 1/√N — amplified above the classical 1/N from the first iteration.
Proof.the marked-state amplitude amplified above classical search.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/0/index.ts#grover
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Grover amplification" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation grover.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (grover @ src/0) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes grover (src/0/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.