and are unitary
ProvedGroverWiki.phaseOracle_diffusion_mem_unitarygrover-algorithmquantum-computingquantum-search
Let , let be the phase oracle and let be the Grover diffusion operator, where . Then both are unitary:
Both steps of a Grover iteration are therefore legitimate quantum operations, and the state of the algorithm stays normalized, so that the measurement probabilities of later milestones are probabilities.
Preamble
import Mathlib import Definitions.Def_GroverWiki_Defs open Matrix
Formal statement
namespace GroverWiki
/-- `U_ω` and `U_s` are unitary operators. -/
theorem phaseOracle_diffusion_mem_unitary {N : ℕ} (f : Fin N → Fin 2) :
phaseOracle f ∈ unitaryGroup (Fin N) ℂ ∧ diffusion N ∈ unitaryGroup (Fin 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, sections "Problem description" (PDF p. 2) and "Algorithm" / "Geometric proof" (PDF p. 4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.