Every eigenvalue of is an -th root of unity
ProvedShorWiki.mulModGate_eigenvalue_root_of_unityquantum-computingshor-algorithm
Let with , , , and let be the modular-multiplication gate on qubits. If is an eigenvalue of , then
The phases that phase estimation can return are therefore exactly the fractions , which is what makes the order visible in the measurement.
Preamble
import Mathlib import Definitions.Def_ShorWiki_Defs open Matrix Kronecker
Formal statement
namespace ShorWiki
theorem mulModGate_eigenvalue_root_of_unity (N a : ℕ) (ha : 1 < a) (haN : a < N)
(hcop : Nat.Coprime a N) (μ : ℂ)
(hμ : Module.End.HasEigenvalue (Matrix.toLin' (mulModGate N a (regBits N))) μ) :
∃ k < ord N a, μ = omega (ord N a) ^ k := 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 p. 4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.