Eqs.(40)–(42): covariance of graph-state encoding
ProvedQAlgorithms.Papers.Independent.Advance50.P50.graph_encoding_covarianceLet be simple graphs on the same vertices and a vertex permutation satisfying exactly when . Let be its physical site permutation, , and a permutation-invariant density matrix. Put , with unordered edges counted once, , and . Then
The encoding therefore respects vertex relabelling and isomorphism-class labels. No injective graph encoding or distinguishing evolution time is claimed.
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 pp.14–15, Eqs.(40)–(42): encoding is covariant under a vertex
bijection preserving adjacency. Printed P rho P is corrected to P rho P†;
general permutations are not self-adjoint. No injectivity is claimed.
Printed: PDF pp.14-15 defines graph isomorphism by an edge bijection and repeatedly writes P rho P and P H P for arbitrary permutations P.
Changed: Require a vertex permutation preserving adjacency and use P rho P-dagger, P H P-dagger and P exp(-itH) P-dagger throughout.
Why: An arbitrary edge bijection only fixes edge counts. The Ising-encoding proof relabels vertices and conjugates physical operators. A three-cycle has P-dagger different from P, so the adjoint is indispensable. No separating observable or injective encoding is added. -/
theorem graph_encoding_covariance {n : ℕ} (G H : SimpleGraph (Fin n))
(p : Equiv.Perm (Fin n)) (hiso : ∀ i j, H.Adj (p i) (p j) ↔ G.Adj i j)
(t : ℝ) (ht : 0 < t) (rho : Mat (Qubits n)) (hrho : IsDensityMatrix rho)
(hfixed : ∀ q : Equiv.Perm (Fin n), conjSuperop (sitePermutation q) rho = rho) :
graphHamiltonian H = conjSuperop (sitePermutation p) (graphHamiltonian G) ∧
graphEvolution H t = conjSuperop (sitePermutation p) (graphEvolution G t) ∧
graphEncoding H t rho = conjSuperop (sitePermutation p) (graphEncoding G t rho) := 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 every natural number , simple graphs on sites, and permutation of those sites satisfying is an edge exactly when is an edge, take any real and any positive semidefinite matrix of trace on -bit configurations. Suppose for every site permutation , where . Define , , and , where , , and each acts by at site and the identity elsewhere. Then
The quantification includes , when the Hamiltonians vanish and the site permutation is unique.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.