Every finite graph cluster ket has unit norm
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.graphClusterState_isStatemeasurement-based-quantum-computationquantum-information
Let be a finite set of qubit sites, let be a finite set of ordered edges, and write for a computational bit string . The graph cluster ket
has norm one. The conclusion also holds for the empty site set and requires no connectedness condition. It certifies normalization for graph-state measurement and valence-bond projection formulas.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52
noncomputable section
open QAlgorithms QAlgorithms.Papers.Independent.Intakenext100.P52 QAlgorithms.Papers.Independent.Information100.P21 QAlgorithms.Papers.Independent.Gap20.P01
open scoped Matrix ComplexConjugate
private theorem edgePhase_norm {V : Type*} [DecidableEq V] (E : Finset (V × V)) (z : V → Bool) :
‖edgePhase E z‖ = 1 := by
simp only [edgePhase, norm_prod]
apply Finset.prod_eq_one
intro e he
cases z e.1 <;> cases z e.2 <;> simp [czPhase]
Formal statement
theorem QAlgorithms.Papers.Independent.Intakenext100.P52.graphClusterState_isState {V : Type*} [Fintype V] [DecidableEq V]
(E : Finset (V × V)) : IsState (graphClusterState E) := by sorrySource
R. Jozsa, An introduction to measurement based quantum computation, https://arxiv.org/abs/quant-ph/0508124v2, PDF pp.8,11–12, cluster-state preparation by CZ edges; finite-graph normalization of that construction.