Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians

arXiv:2609.14209 · math-ph, math.MP, math.OA · Submitted 2026-09-13 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematical Physics. The day in mathematical physics: rigorous models of physical systems.

Kai: We're looking at the paper: "Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians".

Mira: Here's the gist of the paper. We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods.

Kai: This framework provides an operator-theoretic description of graph-based Hamiltonians and offers a new mechanism for comparing graph-based quantum systems through Pauli-support data.

Mira: The central theme of this work is that periodic symmetry reduces an infinite graph to finitely many local combinatorial types.

Kai: The authors introduce a new invariant for periodic graphs based on Pauli support.

Paper summary: Kai: So we've covered a lot about this paper, focusing on how they introduced this Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians. To summarize what this means for us, it’s that we have a new way to look at graph structures using operator theory.

Mira: They are essentially taking the local connectivity of a periodic graph and translating it into a set of Pauli strings—the root set—which acts as an algebraic fingerprint for that local structure. This fingerprint is invariant under how you shift the entire periodic pattern on a lattice, provided the lattice is compatible with the graph structure.

Lev: What I take away from this is that instead of dealing with the massive infinite graph directly, we can focus on these finite local neighborhoods and their associated Pauli expansions, which should make it much more manageable for any kind of computation or simulation.

Kai: Right, and they also showed that this isn't just about the periodic case. They extended it to aperiodic graphs with finite local complexity, suggesting this framework is more versatile than we might initially think.

Mira: The key implication is that we gain an algebraic language for comparing quantum systems derived from these graphs through Pauli-support data, rather than relying only on purely combinatorial representations which can be much harder to compare across different types of symmetry.

Lev: For us building hardware, this means we have a tool to check the local structure and see if it adheres to certain algebraic rules before we even start building the full system.

Kai: So, in simple terms, this paper provides an operator-theoretic invariant that lets us compare graph-derived Hamiltonians by looking at how they decompose in the Pauli basis.

Mira: And they suggest that these local root-set invariants might already be able to distinguish several aperiodic graph realizations arising from Penrose-type constructions.

Lev: It’s an interesting direction for future work, though the paper itself has its limitations because it relies on assumptions like the root-separation hypothesis for those converse results.

Conclusion: Kai: So we're wrapping up the talk on "Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians" by Chehade, Vlasic, Herrman, and Mukherjee.

Mira: Basically, they've taken the local layout of a periodic graph and turned it into a set of Pauli strings—the root set—which acts like an algebraic fingerprint for that local structure.

Kai: It means that even though we have these huge infinite graphs, we can compare them by just looking at this finite set of Pauli data.

Lev: From my side, the key here is that this invariant stays the same when you shift the entire graph around on a lattice, as long as you respect the lattice structure.

Mira: And they proved that if you have aperiodic structures with finite local complexity, like Penrose tilings, this idea still holds up and gives us some useful invariants.

Kai: So for me working with superconducting qubits, this offers a new language to compare two different graph-based Hamiltonians without needing to solve the whole system from scratch.

Lev: It's about getting an operator-theoretic description of these Hamiltonians, which is better for error correction because we can analyze the algebraic structure directly.

Mira: The real point is that this connects graph theory, periodic geometry, and quantum information in a way that’s new for comparing these systems.

Kai: It sets up a whole new way to think about how local rules dictate global behavior in these structured quantum circuits.

Quantum Center, University of Tennessee · Department of Physics and Astronomy, University of Tennessee Chattanooga Department of Deloitte Consulting LLC Industrial and Systems Engineering University of Tennessee Knoxville

math-ph, math.MP, math.OA

Submitted: 2026-09-13

Updated: 2026-09-13

Comments: 25 pages, 6 figures, 1 table

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 83/100

The gist: We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods.

Key concepts

Root Set
A collection of Pauli strings that appear with non-zero coefficients when a local adjacency operator from a neighborhood is expanded in the Pauli basis. This set captures algebraic information about the local connectivity of a graph structure.
Pauli Support
The set of all Pauli strings appearing with non-zero coefficients when an operator, like a Hamiltonian derived from a graph, is expanded in the Pauli basis. This forms the core data used to define the invariant.
Periodic Graph Equivalence
A condition where two periodic graphs are considered equivalent if one can be transformed into the other using both a standard graph isomorphism and a translation by a lattice vector. The root set is proven to be preserved under this specific type of equivalence.
Local Adjacency Operator
An operator constructed from the adjacency structure of a local neighborhood (an h-hop ball). This operator is then embedded into a common Hilbert space and expanded in the Pauli basis to yield its root set.

Terminology

Summary

We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. p. 0

Where the paper says it

edu; rick-mukherjee@utc. edu; Abstract We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods.

This framework provides an operator-theoretic description of graph-based Hamiltonians and offers a new mechanism for comparing graph-based quantum systems through Pauli-support data. p. 0
Where the paper says it

We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably, Penrose tilings. From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data.

Introduction to the Invariant

The central theme of this work is that periodic symmetry reduces an infinite graph to finitely many local combinatorial types. The authors introduce a new invariant for periodic graphs based on Pauli support. p. 1

Where the paper says it

In this setting, two periodic graphs should be considered equivalent only if there exists a graph isomorphism that preserves both the graph structure and the periodic translation structure induced by the lattice. In this work, we introduce a new invariant for periodic graphs based on Pauli support.

Given a graph, they associate to each local neighborhood a Hamiltonian encoding of its adjacency structure and expand this operator in the Pauli basis. p. 1
Where the paper says it

In this work, we introduce a new invariant for periodic graphs based on Pauli support. Given a graph, we associate to each local neighborhood a Hamiltonian encoding of its adjacency structure and expand this operator in the Pauli basis.

This resulting support, called the root set, captures algebraic information about the local structure. p. 1
Where the paper says it

Given a graph, we associate to each local neighborhood a Hamiltonian encoding of its adjacency structure and expand this operator in the Pauli basis. The resulting support, which we call the root set, captures algebraic information about the local structure.

Invariance and Equivalence

The authors prove that under suitable conditions, root sets provide a graph invariant for local structures in periodic graphs. Specifically, they show that the root sets are preserved under lattice-compatible graph equivalence. p. 2

Where the paper says it

We encode these local structures through Pauli-support data, yielding an operator-theoretic invariant that is preserved under lattice-compatible graph equivalence. Under a natural root-separation condition, this invariant also recovers the underlying local graph structure.

Furthermore, they establish converse results under the root-separation hypothesis to recover the underlying local graph structure. p. 0
Where the paper says it

Given a rooted h-hop neighborhood, we construct a local adjacency operator, embed it into a common Hilbert space dimension, and define its Pauli-support set as the collection of Pauli strings appearing with nonzero coefficients. For periodic graphs, we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis.

Operator Algebraic Structure

The framework extends naturally to Lie closures, commutants, and Cartan-type structures generated by the associated Pauli supports. The paper shows that the Lie algebra generated by root sets is preserved under permutation of the graph. p. 0

Where the paper says it

For periodic graphs, we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis. The framework naturally extends to Lie closures, commutants, and Cartan-type structures generated by the associated Pauli supports.

Specifically, if a root set construction is permutation equivariant, then the resulting Lie algebras and their Cartan decompositions are also preserved. p. 2
Where the paper says it

In Section 5, we develop partial converse results for periodic graphs through the notion of root separation and show how global graph structures can be recovered from local invariant data. In Section 6, we evaluate the operator-algebraic structure generated by our invariant by looking at Lie closures, commutants, and Cartan decompositions.

Extension to Aperiodic Structures

The framework is extended to aperiodic graphs with finite local complexity (FLC). For a graph with FLC, the set of local root sets is finite. p. 1

Where the paper says it

Consequently, Pauli-support invariants provide a mechanism for comparing graph-based quantum systems through operator-theoretic data rather than purely combinatorial representations. We show that under suitable conditions, root sets provide a graph invariant for local structures in periodic graphs.

This implies that the collection of local root set invariants remains finite and therefore computable even in the absence of global translational symmetry. p. 1
Where the paper says it

While graph isomorphism is efficiently solvable for many important classes, such as bounded degree [5], it remains a challenging problem in general and identifying computable invariants that reliably distinguish graphs is notoriously difficult [6]. This difficulty motivates the search for more structured settings in which local to global constructions become more tractable.

Empirical Validation

The authors validate their approach through empirical experiments comparing isomorphic and non-isomorphic graphs. They show that for certain graph pairs, the Lie information is the same however the root data is different. p. 2

Where the paper says it

Finally in Section 7, we extend this framework to aperiodic graphs with finite local complexity and discuss connections with cut-and-project quasicrystalline structures. 2 Preliminaries Since the proposed framework lies at the intersection of graph theory, quantum information, and Lie theory, with applications to quantum computing and materials science, readers from different backgrounds may find certain topics more familiar than others.

This demonstrates how the Pauli-support itself retains the distinguishing information. p. 0
Where the paper says it

We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably, Penrose tilings. From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data.

Conclusions

In summary, the paper introduces a local operator-theoretic invariant for periodic graphs by encoding rooted graph neighborhoods as adjacency Hamiltonians and recording their Pauli-support sets. The results provide a new bridge between graph invariants, periodic geometry, and operator algebras. p. 0

Where the paper says it

From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data. Keywords: graph invariants, quantum information theory, periodic graphs, crystalline graphs, Hamiltonian representations, quasicrystals 1 arXiv:2609.

This work offers an algebraic language for comparing graph-derived Hamiltonians and their dynamical structures which can be simulated on quantum computers. p. 1
Where the paper says it

Our perspective is motivated by the central role of Pauli expansions and operator algebras in quantum information [16]. From a quantum information perspective, our proposed invariant using Pauli-supports provides a natural language for describing graph-derived Hamiltonians [17, 18].

The paper also partially extends this constructed invariant to aperiodic and quasicrystalline graphs. p. 2
Where the paper says it

In Section 6, we evaluate the operator-algebraic structure generated by our invariant by looking at Lie closures, commutants, and Cartan decompositions. Finally in Section 7, we extend this framework to aperiodic graphs with finite local complexity and discuss connections with cut-and-project quasicrystalline structures.

The authors suggest that local root-set invariants already distinguish several aperiodic graph realizations arising from Penrose-type constructions. p. 1
Where the paper says it

Beyond periodic systems, we explore the applicability of this framework to aperiodic structures, also known as quasicrystalline structures, such as Penrose tilings. Although these systems lack strict periodicity and fall outside the scope of our main theorems, our numerical experiments suggest that root set invariants remain sensitive to their local structure and may provide a promising tool for distinguishing aperiodic graphs.

The paper concludes by suggesting future work may extend the framework to broader classes of graph structures and more physically detailed Hamiltonians. p. 2
Where the paper says it

Finally in Section 7, we extend this framework to aperiodic graphs with finite local complexity and discuss connections with cut-and-project quasicrystalline structures. 2 Preliminaries Since the proposed framework lies at the intersection of graph theory, quantum information, and Lie theory, with applications to quantum computing and materials science, readers from different backgrounds may find certain topics more familiar than others.

--- Page 1 ---

Pauli Supported Invariants for Periodic Graphs-Derived Hamiltonians Sarah Chehade1,2, Andrew Vlasic3, Rebekah Herrman4, Rick Mukherjee1,2 Abstract We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods Given a rooted h-hop neighborhood we construct a local adjacency operator embed it into a common Hilbert space dimension and define its Pauli-support set as the collection of Pauli strings appearing with nonzero coefficients For periodic graphs we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis The framework naturally extends to Lie closures commutants and Cartan-type structures generated by the associated Pauli supports We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably Penrose tilings From a quantum information perspective the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data Keywords graph invariants quantum information theory periodic graphs crystalline graphs Hamiltonian representations quasicrystals arXiv:2609.14209v1 [math-ph] 13 Sep 2026

--- Page 2 ---

Introduction Understanding how local structure determines global behavior is a recurring theme across mathematics physics materials science and quantum information [1–4] In graph theory this question appears most prominently in the study of graph isomorphism which determines whether two graphs are structurally identical While graph isomorphism is efficiently solvable for many important classes such as bounded degree [5] it remains a challenging problem in general and identifying computable invariants that reliably distinguish graphs is notoriously difficult [6] This difficulty motivates the search for more structured settings in which local to global constructions become more tractable Periodic graphs also known as crystals or space graphs provide such a setting These graphs arise naturally in lattice systems condensed matter models and structured quantum circuits [2, 7–11] and are characterized by a finite repeating unit together with a lattice action that generates the full infinite structure The presence of this additional symmetry suggests that global structures may be recoverable from sufficiently rich local data Recent work indicates that quantum computing may be useful for identifying if graphs with particular structure are isomorphic or not by leveraging the local structure [12–15] A fundamental question is therefore whether periodic structures can be compared and classified using local invariants While graph isomorphism provides a notion of equivalence for finite graphs periodic graphs require a refinement that incorporates both combinatorial structure and lattice translations In this setting two periodic graphs should be considered equivalent only if there exists a graph isomorphism that preserves both the graph structure and the periodic translation structure induced by the lattice In this work we introduce a new invariant for periodic graphs based on Pauli support Given a graph we associate to each local neighborhood a Hamiltonian encoding of its adjacency structure and expand this operator in the Pauli basis The resulting support which we call the root set captures algebraic information about the local structure Aggregating this data across the graph yields a computable invariant that is sensitive to both local connectivity and global periodic structures Our perspective is motivated by the central role of Pauli expansions and operator algebras in quantum information From a quantum information perspective our proposed invariant using Pauli-supports provides a natural language for describing graph-derived Hamiltonians Such Hamiltonians naturally arise in quantum simulations quantum walks controllability analysis and circuit synthesis Consequently Pauli-support invariants provide a mechanism for comparing graph-based quantum systems through operator-theoretic data rather than purely combinatorial representations We show that under suitable conditions root sets provide a graph invariant for local structures in periodic graphs To validate this approach we present a series of examples Beyond periodic systems we explore the applicability of this framework to aperiodic structures also known as quasicrystalline structures such as Penrose tilings Although these systems lack strict periodicity and fall outside the scope of our main theorems our numerical experiments suggest that root set invariants remain sensitive to their local structure and may provide a promising tool for distinguishing aperiodic graphs

--- Page 3 ---

The central theme of this work is that periodic symmetry reduces an infinite graph to finitely many local combinatorial types We encode these local structures through Pauli-support data yielding an operator-theoretic invariant that is preserved under lattice-compatible graph equivalence Under a natural root-separation condition this invariant also recovers the underlying local graph structure Finally we show that finite local complexity plays an analogous finiteness role in the aperiodic setting allowing the framework to extend beyond periodic graphs The rest of the paper is structured as follows In Section 2 we review graphtheoretic and lattice-theoretic concepts required throughout the paper In Section 3 establishes the relationship between local neighborhoods and periodic graph structures showing how sufficiently large neighborhoods encode complete motif information In Section 4 we introduce the local adjacency operators their Pauli decompositions and the associated root-set invariants and establish their invariance under latticecompatible graph equivalence In Section 5 we develop partial converse results for periodic graphs through the notion of root separation and show how global graph structures can be recovered from local invariant data In Section 6 we evaluate the operator-algebraic structure generated by our invariant by looking at Lie closures commutants and Cartan decompositions Finally in Section 7 we extend this framework to aperiodic graphs with finite local complexity and discuss connections with cut-and-project quasicrystalline structures

--- Page 4 ---

2 Preliminaries Since the proposed framework lies at the intersection of graph theory quantum information and Lie theory with applications to quantum computing and materials science readers from different backgrounds may find certain topics more familiar than others For completeness we briefly review the graph-theoretic concepts required for the main results Our discussion of Lie algebras is saved for Section 6 and focuses only on the structural properties used throughout the paper and is not intended as a comprehensive introduction to the subject

2.1 Graph Theory A graph G = (V (G), E(G)) is a collection of vertices v ∈ V (G) and edges (u, v) ∈ E(G) for u, v ∈ V (G). p. 2

Where the paper says it

Our discussion of Lie algebras is saved for Section 6 and focuses only on the structural properties used throughout the paper and is not intended as a comprehensive introduction to the subject. 1 Graph Theory A graph G = (V (G), E(G)) is a collection of vertices v ∈ V (G) and edges (u, v) ∈ E(G) for u, v ∈ V (G).

In this work we consider only simple graphs which have no multiedges or self-loops A vertex u is said to be a neighbor of vertex v if (u, v) ∈ E(G). p. 2
Where the paper says it

In this work, we consider only simple graphs, which have no multiedges or self-loops. A vertex u is said to be a neighbor of vertex v if (u, v) ∈ E(G).

The set of all neighbors of v NG(v) is called the neighborhood of v and is denoted NG(v) The degree of vertex v is the cardinality of the neighborhood of v NG(v) The degree sequence of G is an ordered list of the degree of each vertex in non-increasing order Note that when G is clear we shall drop the parenthetical and subscript G in the above definitions Two graphs G and H are said to be isomorphic if there exists a bijection f: V (G) → V (H) such that (u, v) ∈ E(G) if and only if (f(u), f(v)) ∈ E(H) Note that two graphs must have the same number of vertices and edges to be isomorphic and the degree sequence of both G and H must be the same However this is not a sufficient condition to prove isomorphism

--- Page 5 ---

2.2 Crystal Graphs Crystal graphs are objects where the periodicity of the structure can be infinitely repeated For instance periodic graphs can be used as a tiling of a Euclidean plane The following three definitions while mathematical were derived as a means to fully describe this structure Given this structure a proposition about the useful automorphism is then given The following definition is that of a lattice which gives a general framework for periodic graphs Definition 1 Let d ∈ N. p. 3

Where the paper says it

For instance, periodic graphs can be used as a tiling of a Euclidean plane. The following three definitions, while mathematical, were derived as a means to fully describe this structure.

A lattice in R d is a discrete subgroup Λ:= X d j=1 njaj: nj ∈ Z, where a1,. p. 3
Where the paper says it

Definition 1 Let d ∈ N. A lattice in R d is a discrete subgroup Λ :=    X d j=1 njaj : nj ∈ Z    , (2.

.., ad ∈ R d are linearly independent (2. p. 3
Where the paper says it

1) where a1, . , ad ∈ R d are linearly independent.

1) This lattice structure while essential is too general for a crystal Particularly that of invariance under translations describing the long-range periodic order The next definition makes this criterion rigorous Definition 2 A periodic set in R d is a discrete set of points X ⊂ R d that is invariant under translation by a lattice Λ i. p. 3
Where the paper says it

This lattice structure, while essential, is too general for a crystal. Particularly, that of invariance under translations, describing the long-range periodic order.

e, X + λ = X for all λ ∈ Λ (2.2) This graph G = (V, E) embedded in R d is called a Λ-space graph if 1. p. 3
Where the paper says it

2) Definition 3 Let Λ be a lattice. A graph G = (V, E) embedded in R d is called a Λ-space graph if 1.

V ⊂ R d is discrete, 2. p. 3
Where the paper says it

Definition 1 Let d ∈ N. A lattice in R d is a discrete subgroup Λ :=    X d j=1 njaj : nj ∈ Z    , (2.

V + Λ = V vertex set is invariant under translation, 3. p. 3
Where the paper says it

V ⊂ R d is discrete, 2. V + Λ = V (vertex set is invariant under translation), 3.

G is invariant under lattice translations That is (v, w) ∈ E ⇒ (v + λ, w + λ) ∈ E for all λ ∈ Λ (2. p. 3
Where the paper says it

V + Λ = V (vertex set is invariant under translation), 3. G is invariant under lattice translations.

3) For a periodic space graph we introduce a computationally tractable notion of automorphism Recall an automorphism is a map from an object to itself where the map is a bijection The following proposition provides the corresponding characterization Proposition 2. p. 3
Where the paper says it

Recall an automorphism is a map from an object to itself, where the map is a bijection. The following proposition provides the corresponding characterization.

1 Let G = (V, E) be a Λ-space graph Then for every λ ∈ Λ, the translation map τλ: V → V, τλ(v):= v + λ (2. p. 3
Where the paper says it

1 Let G = (V, E) be a Λ-space graph. Then for every λ ∈ Λ, the translation map τλ : V → V, τλ(v) := v + λ (2.

4) is a graph automorphism

--- Page 6 ---

Proof Fix λ ∈ Λ. Since G is a space graph with respect to the lattice Λ it follows that the vertex set is invariant under lattice translations Hence v ∈ V ⇒ v + λ ∈ V + Λ = V (2. p. 4

Where the paper says it

Since G is a space graph with respect to the lattice Λ, it follows that the vertex set is invariant under lattice translations. Hence v ∈ V =⇒ v + λ ∈ V + Λ = V.

5) So τλ: V → V holds Moreover the inverse map is precisely τ−λ because τ−λτλ(v) = τ−l(v + λ) = v, (2. p. 4
Where the paper says it

5) So τλ : V → V holds. Moreover, the inverse map is precisely τ−λ because τ−λτλ(v) = τ−λ(v + λ) = v, (2.

6) and similarly for τλτ-l holds Hence S is a bijection Next by translation invariance of edges in a space graph we have that (u, v) ∈ E ⇒ (τλ(u), τλ(v)) ∈ E (2. p. 4
Where the paper says it

Hence τλ is a bijection. Next, by translation invariance of edges in a space graph, we have that (u, v) ∈ E ⇐⇒ (τλ(u), τλ(v)) ∈ E.

7) This completes the proof

--- Page 7 ---

Definition 4 Let (G, Λ) be a periodic graph For a vertex v ∈ V G the orbit of v under Λ is O(v):= v + λ: λ ∈ Λ (2.8) The lattice Λ partitions V G into disjoint orbits under translation Since G/Λ has finitely many vertices there are finitely many such orbits A unit cell VY contains exactly one representative from each orbit Definition 5 A fundamental domain for a lattice Λ is a subset Y ⊂ R d where Y = (X d i=1 tiai: ∀i 0 ≤ ti < 1) such that 1. p. 4

Where the paper says it

Since G/Λ has finitely many vertices, there are finitely many such orbits. A unit cell VY contains exactly one representative from each orbit.

R d = Sλ∈Λ(Y + λ), and 2. (Y + λ1)∩(Y + λ2) = Ø for all λ1! p. 4
Where the paper says it

R d = S λ∈Λ (Y + λ), 2. (Y + λ1) ∩ (Y + λ2) = ∅, for all λ1 ̸= λ2.

= λ2 Definition 6 A unit cell of a space graph G is a fundamental domain Y restricted to the vertex set VY:= V ∩ Y The diameter is defined as DY:= max u,v∈VY dG(u, v) (3. p. 5
Where the paper says it

Definition 6 1. A unit cell of a space graph G is a fundamental domain Y restricted to the vertex set VY := V ∩ Y .

1) With this definition we can define an h-hop ball Definition 9 Let G be a space graph For v ∈ V define the h-hop ball as B G h (v):= u ∈ V: dG(u, v) ≤ h (3. p. 7
Where the paper says it

1) With this definition, we can define a h-hop ball. Definition 9 Let G be a space graph.

2) Before our next result we need a way to ensure that the unit cell only connects to nearby cells and not arbitrary distant ones similar to how atoms interact with only nearby atoms To do this define the edge-span by ∆(Y):= λ ∈ Λ: ∃ u, w ∈ VY with (u, w + λ) ∈ E (3. p. 7
Where the paper says it

2) Before our next result, we need a way to ensure that the unit cell only connects to nearby cells and not arbitrary distant ones (similar to how atoms interact with only nearby atoms). To do this, define the edge-span by ∆(Y ) := {λ ∈ Λ : ∃ u, w ∈ VY with (u, w + λ) ∈ E}.

3) In our work we only consider crystals where the edge-span cardinality i. p. 7
Where the paper says it

To do this, define the edge-span by ∆(Y ) := {λ ∈ Λ : ∃ u, w ∈ VY with (u, w + λ) ∈ E}. 3) In our work, we only consider crystals where the edge-span cardinality, i.

e., ∆(Y) is finite

--- Page 8 ---

Theorem 3.1 Let G be a connected space graph with respect to lattice Λ Fix a fundamental domain Y Then there exists h˜ ∈ N such that for every h ≥ h˜, there exists λ ∈ Λ for which the ball B G h (v) satisfies the following: λ + VY ⊂ B G h (v)

--- Page 9 ---

Proof For the fundamental domain Y the unit cell connects to finitely many neighboring cells That is in this work we assume the set ∆(Y):= λ ∈ Λ: ∃ u, w ∈ VY with (u, w + λ) ∈ E is finite Define S:= VY U [λ∈∆(Y) (VY + λ) ⊂ V (3.4) This set is finite because VY is finite and so is ∆(Y) Fix a reference vertex v0 ∈ VY and set h0:= max x∈S dG(v0, x). p. 8

Where the paper says it

4) This set is finite because VY is finite and so is ∆(Y ). Fix a reference vertex v0 ∈ VY , and set h0 := max x∈S dG(v0, x).

This maximum is indeed finite because S is finite and G is connected Then by definition we have that S ⊆ B G h0 (v0) Since h ≥ h0 implies that B G h0(. p. 8
Where the paper says it

This maximum is indeed finite because S is finite and G is connected. Then by definition, we have that S ⊆ B G h0 (v0).

) ⊆ B G h(.) resulting in S + µ ⊆ B G h (v0 + µ) for all h ≥ h0 The proof continues to show that for any vertex x in V and by the triangle inequality we see that dG(x, v) ≤ dG(x, v0 + µ) + dG(v0 + µ, v) = dG(x, v0 + µ) + dG(v0, u) ≤ h0 + DY Thus every w ∈ S + µ satisfies dG(w, v) ≤ h0 + DY so that S + µ ⊆ B G h+DY (v). p. 8
Where the paper says it

For any vertex x ∈ V and by the triangle inequality, we see that dG(x, v) ≤ dG(x, v0 + µ) + dG(v0 + µ, v) = dG(x, v0 + µ) + dG(v0, u) ≤ h0 + DY . Thus, every w ∈ S + µ satisfies dG(w, v) ≤ h0 + DY , so that S + µ ⊆ B G h+DY (v).

Setting h˜:= h0 + DY we see that for all v in V and every h ≥ h˜ there exists λ ∈ Λ such that VY + λ ⊂ B G h (v)

--- Page 10 ---

Definition 10 From [16] and using Equation (3.2) let G be a graph and let v ∈ V Let G[B G h(v)] denote the induced subgraph on this ball Fix an ordering of vertices mentioned above and let A G h(v) ∈ Mm(C), m:= B G h (v) (4. p. 9

Where the paper says it

Let G[B G h (v)] denote the induced subgraph on this ball. Fix an ordering of vertices mentioned above and let A G h (v) ∈ Mm(C), m := |B G h (v)| (4.

1) be the local adjacency matrix of G[B G h(v)] with respect to this ordering where Mm(C) denotes the set of square matrices of dimension m with complex values For each graph… p. 9
Where the paper says it

1) be the local adjacency matrix of G[B G h (v)] with respect to this ordering, where Mm(C) denotes the set of square matrices of dimension m with complex values. For each graph G, fixed vertex v, and hop h, we form the skew Hermitian matrix HG h (v) := −i A G h (v).

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

1

Noisy graph Hamiltonians can be analyzed using Pauli support data to compare systems through operator-theoretic data rather than purely combinatorial representations. This allows for a new mechanism for comparing graph-based quantum systems.

2

AI systems can determine if two periodic graphs are equivalent by checking the invariance of their root sets under lattice-compatible graph equivalence. This provides a computable invariant that is sensitive to both local connectivity and global periodic structures.

3

Quantum simulation algorithms can utilize Lie algebraic tools, such as Cartan decompositions and KAK factorizations, to speed up simulations and gain deeper understandings of systems under investigation.

Abstract

We introduce a graph invariant obtained from Pauli decompositions of Hamiltonians derived from local graph neighborhoods. Given a rooted h-hop neighborhood, we construct a local adjacency operator, embed it into a common Hilbert space dimension, and define its Pauli-support set as the collection of Pauli strings appearing with nonzero coefficients. For periodic graphs, we prove invariance under lattice-compatible graph equivalence and establish converse results under root-separation hypothesis. The framework naturally extends to Lie closures, commutants, and Cartan-type structures generated by the associated Pauli supports. We further discuss extensions to aperiodic graphs with finite local complexity and make connections to cut-and-project models of quasicrystals and notably, Penrose tilings. From a quantum information perspective, the resulting invariants provide a operator-theoretic description of graph-based Hamiltonians and offer a new mechanism for comparing graph-based quantum systems through Pauli-support data.

Sources

Related papers