Action of and on
ProvedGroverWiki.action_on_span_ket_uniformgrover-algorithmquantum-computingquantum-search
Let have exactly one index with . For all ,
In the spanning set the two operators are thus given by the matrices and , and their product by ; this reduces the analysis of the algorithm to a matrix.
Preamble
import Mathlib import Definitions.Def_GroverWiki_Defs open Matrix
Formal statement
namespace GroverWiki
/-- Algebraic proof: action of `U_s` and `U_ω` in the span of `{|ω⟩, |s⟩}`:
`U_s : a|ω⟩ + b|s⟩ ↦ -a|ω⟩ + (2a/√N + b)|s⟩` and
`U_ω : a|ω⟩ + b|s⟩ ↦ (-a - 2b/√N)|ω⟩ + b|s⟩`. -/
theorem action_on_span_ket_uniform {N : ℕ} (f : Fin N → Fin 2) (ω : Fin N)
(hω : ∀ x, f x = 1 ↔ x = ω) (a b : ℂ) :
diffusion N *ᵥ (a • ket ω + b • uniformState N) =
(-a) • ket ω + (2 * a / (Real.sqrt N : ℂ) + b) • uniformState N ∧
phaseOracle f *ᵥ (a • ket ω + b • uniformState N) =
(-a - 2 * b / (Real.sqrt N : ℂ)) • ket ω + b • uniformState N := by sorry
end GroverWiki
Source
Wikipedia, "Grover's algorithm", revision oldid=1373498442, https://en.wikipedia.org/w/index.php?title=Grover%27s_algorithm&oldid=1373498442, section "Algebraic proof" (PDF pp. 5–6)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.