Appendix G: tied QGCNN generators preserve graph automorphisms
ProvedQAlgorithms.Papers.Independent.Advance50.P50.qgcnn_automorphism_invarianceLet be a fixed simple graph, an automorphism of its vertices, and its physical site-permutation matrix. Fix finite families of Hermitian one-qubit operators and real parameters , tied across all vertices and edges. Count each unordered edge once and define
Then
This is the automorphism invariance of the Appendix G generator, adapted there from Ref.[32]. It supplies no full-permutation invariance for a generic fixed graph.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P50
open MeasureTheory ProbabilityTheory
open scoped ComplexConjugate ENNReal
-- Exact accepted primitives; no paper-local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)
open QAlgorithms.Papers.Independent.Information100.P32 (purity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
-- Matrices carry the associative commutator bracket X*Y-Y*X.
attribute [local instance 100] LieRing.ofAssociativeRing
/-- PDF p.29, Appendix G: tied generators commute with every graph
AUTOMORPHISM. This does not assert full-Sn equivariance for a fixed graph. -/
theorem qgcnn_automorphism_invariance {n a b : ℕ} (G : SimpleGraph (Fin n))
(p : Equiv.Perm (Fin n)) (hp : ∀ i j, G.Adj (p i) (p j) ↔ G.Adj i j)
(W : Fin a → ℝ) (B : Fin b → ℝ) (O : Fin a → Mat Bool) (R : Fin b → Mat Bool)
(hO : ∀ r, (O r).IsHermitian) (hR : ∀ r, (R r).IsHermitian) :
conjSuperop (sitePermutation p) (qgcnnGenerator G W B O R) = qgcnnGenerator G W B O R := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary natural numbers , let be a simple graph on , and let be a permutation of these vertices satisfying for every . For arbitrary real coefficient families and , and Hermitian complex matrix families for and for , define on -bit strings and put
Let be the matrix with entry at exactly when , and otherwise. The conclusion is
All zero sizes are included; for , , and the graph and matrix-family hypotheses with empty index sets are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.