Proved
ShorWiki.sum_eigState_eq_ket_onequantum-computingshor-algorithm
Let with , and . The eigenstates of the modular-multiplication gate satisfy
in the -qubit register.
So the easily prepared input is an equal-weight superposition of all eigenstates, and phase estimation on samples a uniformly random .
Preamble
import Mathlib import Definitions.Def_ShorWiki_Defs open Matrix Kronecker
Formal statement
namespace ShorWiki
theorem sum_eigState_eq_ket_one (N a : ℕ) (ha : 1 < a) (haN : a < N)
(hcop : Nat.Coprime a N) :
(1 / Real.sqrt (ord N a) : ℂ) • ∑ j ∈ Finset.range (ord N a), eigState N a (regBits N) j
= ket (2 ^ regBits N) 1 := by sorry
end ShorWiki
Source
Wikipedia, "Shor's algorithm", revision oldid=1378862216, https://en.wikipedia.org/w/index.php?title=Shor%27s_algorithm&oldid=1378862216, section "Quantum phase estimation" (PDF pp. 4–5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.