graph_state_fisher_q
def
For any finite simple graph G on vertex set V, the collective-X quantum Fisher information Q(G) is the sum over all ordered pairs (u, v) in V of the indicator that u and v have identical open neighborhoods.
Statement
noncomputable def graph_state_fisher_q {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ
- Defined in
- arXiv:2611.08593, Eqs. (9)-(10)
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 2
- core_constant_bFor natural numbers d and c, let k = sparse_graph_state_fisher_core_k d c. The core constant B(d, c) is the supremum of Q(J) - 1 over all…
- sparse_graph_state_fisher_q_maxFor positive integers n, d, c, Q_max(n, d, c) is the maximum of Q(G) over all connected triangle-free graphs G on n vertices with d*n + c…
Read back from the Lean
For a finite type V and a simple graph G on V, graph_state_fisher_q G is defined as the natural number equal to the sum over all ordered pairs (u, v) : V × V of 1 if G.neighborSet u = G.neighborSet v and 0 otherwise; that is, the number of pairs (u, v) ∈ V × V such that u and v have identical open neighborhoods in G.
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
/-- Collective-X quantum Fisher information of a graph state G, given by the sum of indicators of open-neighborhood equality over ordered vertex pairs. -/ noncomputable def graph_state_fisher_q {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ := by classical exact ∑ u : V, ∑ v : V, if G.neighborSet u = G.neighborSet v then (1 : ℕ) else 0