random_ising_graph_magic
def
For a natural number n and a simple graph G on Fin n, random_ising_graph_magic n G is defined as 2^n times the second Pauli-Liouville moment of the Ising graph state on G with uniform edge angles Real.pi / 8.
Statement
open scoped Classical in noncomputable def random_ising_graph_magic (n : ℕ) (G : SimpleGraph (Fin n)) : ℝ
- Defined in
- arXiv:2610.27080, Rényi multi-entropy of graph states and the n -> 1 limit
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 2
- pauliLiouvilleMomentTwoFor an n-qubit pure state ψ, the second Pauli-Liouville moment m_2(ψ) is (1/2^n) times the sum over all n-qubit Pauli strings P of…
- ising_graph_stateFor a graph G on n vertices with edge angles θ, the Ising graph state psi_G is exp(-i sum_{uv in E} θ_uv Z_u Z_v) |+⟩^{⊗ n}, with…
- Used by 1
- op_1734_random_ising_magic_oneThe expected value of random_ising_graph_magic 1 with respect to the Erdős-Rényi measure erdos_renyi_half 1 equals 2.
Read back from the Lean
Given a natural number n and a simple graph G on the vertex set Fin n, 'random_ising_graph_magic n G' is defined as the real number 2^n * pauliLiouvilleMomentTwo n ψ, where ψ is the Ising graph state on G ('ising_graph_state') with constant edge coupling θ(e) = π / 8 for all edges e.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
open scoped Classical in /-- The normalized stabilizer Pauli fourth moment X_n(G) = 2^n Q(G) for the Ising graph state at edge angle pi/8. -/ noncomputable def random_ising_graph_magic (n : ℕ) (G : SimpleGraph (Fin n)) : ℝ := 2 ^ n * pauliLiouvilleMomentTwo n (ising_graph_state n G (fun _ => Real.pi / 8))