Quantum Simple Graphs: Minimal Quantum Models

• Quantum simple graphs are minimal graph-based quantum systems that use the simplest combinatorial structures to capture essential transport, interference, and scattering phenomena.
• They serve as tractable models in both metric-graph transport and finite-dimensional noncommutative settings, enabling analytical evaluation of quantum state preparation, entanglement, and symmetry.
• These models bridge classical graph theory and quantum algebra, demonstrating that simple motifs can yield rich interference effects, controlled dynamics, and innovative device proposals.

Searching arXiv for recent and foundational papers on "quantum simple graphs" and closely related formulations. Quantum simple graphs is not a single universally standardized term, but across several research traditions it consistently denotes graph-based quantum systems in which the underlying combinatorial structure is deliberately restricted to the simplest nontrivial cases while retaining genuinely quantum behavior. In metric-graph quantum transport, this refers to small looped scattering networks such as triangles, squares, diamonds, and hexagonal motifs with ideal edges and standard vertex conditions (Drinko et al., 2019, Drinko et al., 2019). In finite-dimensional quantum-graph theory, it refers to loopless undirected quantum graphs represented by traceless self-adjoint subspaces of matrix algebras, with the $M_2(\mathbb C)$ and $M_3(\mathbb C)$ cases providing the basic low-dimensional examples (Gromada, 2021, Hayes et al., 29 May 2026). In operator-algebraic and categorical settings, simplicity is encoded through Schur-idempotent adjacency data, through Cuntz–Pimsner simplicity criteria, or through embeddings of classical simple graphs into broader quantum-graph frameworks (Brannan et al., 2024, Hamidi et al., 1 Apr 2025, Ostrovska et al., 10 Mar 2026). The topic therefore spans transport theory, noncommutative graph theory, quantum information, operator algebras, and graph-based quantum matter, with the simplest graph motifs often serving as analytically tractable models in which interference, symmetry, entropy, or algebraic structure can be computed explicitly.

1. Metric-graph transport models

In the transport literature, simple quantum graphs are finite metric graphs with a free Schrödinger operator on each edge and standard flux-conserving boundary conditions at vertices. A quantum graph is described as the triple

$\{\Gamma(V,E),H,\mathrm{BC}\},$

where $\Gamma(V,E)$ is a metric graph, $H$ is the edge Hamiltonian, and $\mathrm{BC}$ denotes vertex boundary conditions (Silva et al., 2021). In the simplest transport models, the Hamiltonian on each edge is

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$

so propagation is free and phase accumulation on an edge of length $\ell$ is encoded by $e^{ik\ell}$ (Drinko et al., 2019, Silva et al., 2021).

The simplest concrete examples are cycle graphs with leads attached to neighboring vertices. One study defines its simple quantum graphs as the triangle $C_3$ and the square $M_3(\mathbb C)$0, both equilateral, both with only two vertices of degree $M_3(\mathbb C)$1, and both equipped mainly with Neumann–Kirchhoff vertex conditions (Drinko et al., 2019). Another study chooses simple diamond and hexagonal motifs with ideal leads, equal edge lengths, Neumann–Kirchhoff matching, and mostly degree-$M_3(\mathbb C)$2 vertices, precisely because degree-$M_3(\mathbb C)$3 junctions are the minimal nontrivial scattering nodes (Drinko et al., 2019). In both cases, simplicity means minimal topological complexity together with uniform local rules.

For open graphs with two leads, the Green’s-function formalism reduces transport to a global transmission amplitude. For the cycle graphs $M_3(\mathbb C)$4 with equal edge length $M_3(\mathbb C)$5,

$M_3(\mathbb C)$6

where $M_3(\mathbb C)$7 is the global transmission amplitude (Drinko et al., 2019). Under Neumann–Kirchhoff conditions,

$M_3(\mathbb C)$8

and for $M_3(\mathbb C)$9 and $\{\Gamma(V,E),H,\mathrm{BC}\},$0 the transmission amplitudes simplify to

$\{\Gamma(V,E),H,\mathrm{BC}\},$1

$\{\Gamma(V,E),H,\mathrm{BC}\},$2

with $\{\Gamma(V,E),H,\mathrm{BC}\},$3 (Drinko et al., 2019). The same paper gives a closed formula for the cycle graph on $\{\Gamma(V,E),H,\mathrm{BC}\},$4 vertices under Neumann–Kirchhoff conditions: $\{\Gamma(V,E),H,\mathrm{BC}\},$5

A central result of this line of work is that minimal graphs already show rich interference structure. The transmission observables depend on $\{\Gamma(V,E),H,\mathrm{BC}\},$6, are periodic in wave number up to edge-length scaling, and satisfy

$\{\Gamma(V,E),H,\mathrm{BC}\},$7

a relation attributed to time-reversal symmetry (Drinko et al., 2019). This leads to two recurring transport phenomena: transport inefficiency induced by interference complexity, and peaks of full transmission inside regions of suppressed transport (Drinko et al., 2019).

2. Minimal transport motifs and interference phenomena

The simplest metric examples are analytically solvable and reveal how topology alone changes scattering. For the diamond and hexagon motifs, the paper gives

$\{\Gamma(V,E),H,\mathrm{BC}\},$8

while for a modified diamond,

$\{\Gamma(V,E),H,\mathrm{BC}\},$9

For the main hexagonal pair,

$\Gamma(V,E)$0

$\Gamma(V,E)$1

(Drinko et al., 2019).

These formulas support several concrete conclusions. The graph $\Gamma(V,E)$2 has a broad suppression band around $\Gamma(V,E)$3, while $\Gamma(V,E)$4 instead has a central transmission feature at $\Gamma(V,E)$5 (Drinko et al., 2019). The direct comparison changes sign, and the paper reports that $\Gamma(V,E)$6 transmits better than $\Gamma(V,E)$7 for

$\Gamma(V,E)$8

whereas $\Gamma(V,E)$9 transmits better for

$H$0

(Drinko et al., 2019). Because $H$1 and $H$2 have the same number of vertices, the same number of edges, and all vertices of degree $H$3, this is a clean topology-only effect.

Series composition sharpens these effects. In the family $H$4, $H$5, and $H$6, broad regions of nearly or fully suppressed transmission coexist with narrow peaks of full transmission (Drinko et al., 2019). The reported peak positions are:

• for $H$7,

$H$8

with width

$H$9

• for $\mathrm{BC}$0,

$\mathrm{BC}$1

each with width

$\mathrm{BC}$2

• for $\mathrm{BC}$3,

$\mathrm{BC}$4

and

$\mathrm{BC}$5

(Drinko et al., 2019).

A related study finds similarly narrow resonances in $\mathrm{BC}$6, with two full-transmission peaks at

$\mathrm{BC}$7

with width

$\mathrm{BC}$8

(Drinko et al., 2019). The same paper interprets the broad suppression windows as destructive interference and the isolated unit-transmission resonances as constructive interference. This suggests that “simple” in these models does not imply spectrally simple; rather, the smallest looped motifs already suffice to realize blockers, resonant filters, and compound transport elements (Drinko et al., 2019, Drinko et al., 2019).

The comparison between triangle and square in the cycle-graph study sharpens this point. Using the Green’s function as a generating function for scattering paths, the step operator is defined by

$\mathrm{BC}$9

with

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$0

Under Neumann–Kirchhoff conditions,

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$1

(Drinko et al., 2019). Yet the triangle exhibits more complicated suppression over broad wave-number windows. A plausible implication is that path multiplicity and phase structure, rather than graph size alone, govern transport complexity.

3. Entropy, qubit-like scattering states, and graph-based devices

The same simple transport motifs have been used as diagnostics of scattering complexity. One work defines the average scattering entropy by fixing an incoming lead, forming the output probabilities

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$2

and the Shannon entropy

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$3

then averaging over one $H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$4-period: $H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$5 (Silva et al., 2021). For the elementary motifs $H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$6 and $H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$7,

$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$8

(Silva et al., 2021). The paper reports that average scattering entropy decreases rapidly with replication number and then saturates, is higher on circles than on lines, and is strongly affected by local vertex degree, with degree-$H=-\frac{\hbar^2}{2m}\frac{d^2}{dx^2},$9 motifs systematically exceeding degree-$\ell$0 motifs (Silva et al., 2021). This suggests that simple quantum graphs can serve as controlled probes of topological and geometrical effects in scattering statistics.

A distinct development interprets a two-channel open quantum graph as a two-level system. For an incoming particle in channel $\ell$1, the outgoing state is

$\ell$2

with

$\ell$3

(Silva et al., 6 Mar 2025). Two such graphs can be coupled by a controlled operation

$\ell$4

to generate bipartite states whose entanglement is determined entirely by scattering amplitudes (Silva et al., 6 Mar 2025). For the simplest controlled-phase construction,

$\ell$5

and maximal entanglement occurs when

$\ell$6

(Silva et al., 6 Mar 2025). The same paper highlights entanglement in “a simple system consisting of two simple quantum graphs, with only one edge and a controlled phase.” This indicates that the simple-graph transport framework can be reinterpreted as a state-preparation and gate-like mechanism.

Device proposals in this literature are correspondingly concrete. The papers mention microwave networks, optical fiber and splitter networks, quantum dots, nanowires, nanorings, and modular series compositions as possible realizations (Drinko et al., 2019, Drinko et al., 2019, Silva et al., 6 Mar 2025). These claims are framed as proof-of-principle applications of ideal graph transport rather than as full device models with disorder, dissipation, or magnetic fields.

4. Finite-dimensional noncommutative quantum graphs

A different meaning of quantum simple graph arises when the “vertex space” is a finite-dimensional $\ell$7-algebra rather than a finite set. One paper defines a quantum graph on a finite quantum set $\ell$8 by an edge projection

$\ell$9

satisfying

$e^{ik\ell}$0

(Gromada, 2021). The graph is undirected iff

$e^{ik\ell}$1

and has no loops iff

$e^{ik\ell}$2

(Gromada, 2021). Rotating $e^{ik\ell}$3 yields an adjacency operator $e^{ik\ell}$4 satisfying

$e^{ik\ell}$5

with looplessness equivalent to

$e^{ik\ell}$6

(Gromada, 2021).

In the matrix-algebra case $e^{ik\ell}$7, quantum graphs with $e^{ik\ell}$8 quantum edges are classified by $e^{ik\ell}$9-dimensional subspaces

$C_3$0

with adjacency matrix

$C_3$1

for an orthonormal basis $C_3$2 of $C_3$3 (Gromada, 2021). The graph has no loops iff

$C_3$4

is undirected iff

$C_3$5

and two graphs are isomorphic iff

$C_3$6

(Gromada, 2021). In this language, a simple quantum graph is therefore a traceless self-adjoint matrix subspace.

The smallest genuinely quantum case is $C_3$7. The paper proves that a simple graph on $C_3$8 is determined up to isomorphism only by the number of quantum edges

$C_3$9

(Gromada, 2021). Using the Pauli matrices, the four classes are the zero graph, a one-edge graph such as $M_3(\mathbb C)$00, a two-edge graph such as $M_3(\mathbb C)$01, and the full traceless space $M_3(\mathbb C)$02 (Gromada, 2021). The same paper states that all simple quantum graphs in $M_3(\mathbb C)$03 are quantum Cayley graphs of $M_3(\mathbb C)$04, hence quantum isomorphic to classical graphs.

By contrast, $M_3(\mathbb C)$05 already exhibits genuinely nonclassical simple quantum graphs. One explicit example is the one-edge graph defined by

$M_3(\mathbb C)$06

where

$M_3(\mathbb C)$07

(Gromada, 2021). The paper proves that this simple graph is not quantum isomorphic to any classical graph because its endomorphism algebra is noncommutative with respect to the Schur product. This is the point at which finite-dimensional quantum simple graphs cease to be merely noncommutative presentations of classical examples.

A related construction uses 2-cocycle deformation of Cayley graphs of finite abelian groups. Given a finite abelian group $M_3(\mathbb C)$08, a subset $M_3(\mathbb C)$09, and a unitary bicharacter $M_3(\mathbb C)$10, the twisted algebra is defined by

$M_3(\mathbb C)$11

while the adjacency remains diagonal with eigenvalues

$M_3(\mathbb C)$12

(Gromada, 2021). The resulting twisted Cayley graph $M_3(\mathbb C)$13 is quantum isomorphic to the classical $M_3(\mathbb C)$14. For $M_3(\mathbb C)$15, a sign bicharacter yields Clifford algebras and anticommutative hypercube graphs $M_3(\mathbb C)$16, quantum isomorphic to the classical hypercube $M_3(\mathbb C)$17 (Gromada, 2021). This suggests that one large class of quantum simple graphs consists of noncommutative deformations with unchanged spectral adjacency data.

5. Vertex-transitivity and low-dimensional symmetry classification

A 2026 paper defines vertex-transitivity for a quantum graph by requiring that the join of its automorphism group be the maximum quantum relation on its quantum vertex set, in direct analogy with the classical case (Hayes et al., 29 May 2026). In the concrete matrix-algebra setting, if

$M_3(\mathbb C)$18

then

$M_3(\mathbb C)$19

equivalently

$M_3(\mathbb C)$20

(Hayes et al., 29 May 2026). The degree matrix is

$M_3(\mathbb C)$21

for any orthonormal basis $M_3(\mathbb C)$22 of $M_3(\mathbb C)$23, and vertex-transitivity implies regularity in the sense that $M_3(\mathbb C)$24 (Hayes et al., 29 May 2026).

The low-dimensional outcome is sharply stratified. In $M_3(\mathbb C)$25, the paper states that the quantum graphs

$M_3(\mathbb C)$26

are all vertex-transitive (Hayes et al., 29 May 2026). Their panoramic polynomials are

$M_3(\mathbb C)$27

$M_3(\mathbb C)$28

$M_3(\mathbb C)$29

$M_3(\mathbb C)$30

(Hayes et al., 29 May 2026).

In $M_3(\mathbb C)$31, many simple quantum graphs are not vertex-transitive, but the paper gives a complete classification of the vertex-transitive ones: $M_3(\mathbb C)$32 (Hayes et al., 29 May 2026). The two most structurally significant families are:

• the $M_3(\mathbb C)$33-dimensional family

$M_3(\mathbb C)$34

with panoramic polynomial

$M_3(\mathbb C)$35

• the unique $M_3(\mathbb C)$36-dimensional vertex-transitive class

$M_3(\mathbb C)$37

with

$M_3(\mathbb C)$38

(Hayes et al., 29 May 2026).

The same paper introduces the panoramic polynomial

$M_3(\mathbb C)$39

for a Hermitian orthonormal basis $M_3(\mathbb C)$40 of $M_3(\mathbb C)$41 (Hayes et al., 29 May 2026). It is an isomorphism invariant up to orthogonal equivalence and is used to compute automorphism groups through the orthogonal symmetry groups of the maximizing set of $M_3(\mathbb C)$42 on the sphere. This provides a concrete invariant for distinguishing low-dimensional quantum simple graphs.

6. Operator-algebraic, categorical, and symmetry-theoretic formulations

In categorical and operator-algebraic approaches, simple quantum graphs are defined through adjacency objects rather than finite metric or matrix-subspace models. One paper develops a framework in which a quantum set is a Q-system $M_3(\mathbb C)$43, and a $M_3(\mathbb C)$44-equivariant graph is a pair $M_3(\mathbb C)$45 where $M_3(\mathbb C)$46 is a Schur idempotent up to a positive central scalar (Brannan et al., 2024). The Schur product is

$M_3(\mathbb C)$47

and Schur idempotence

$M_3(\mathbb C)$48

is the quantum replacement of the classical $M_3(\mathbb C)$49-$M_3(\mathbb C)$50 adjacency condition (Brannan et al., 2024). In the classical commutative case $M_3(\mathbb C)$51, the Schur product reduces to entrywise multiplication, so Schur-idempotent operators are exactly classical adjacency matrices of simple graphs (Brannan et al., 2024).

The same paper interprets complete quantum graphs via finite-index inclusions $M_3(\mathbb C)$52, with the Jones projection $M_3(\mathbb C)$53 giving the complete graph

$M_3(\mathbb C)$54

and the edge space identified with the Jones basic construction (Brannan et al., 2024). Every finite-index subfactor is thus regarded as a complete quantum graph, and all its subgraphs are obtained by classifying idempotents in higher relative commutants via a quantum Fourier transform (Brannan et al., 2024).

A related operator-algebraic direction studies the Cuntz–Pimsner algebra of the quantum edge correspondence $M_3(\mathbb C)$55 for a quantum graph $M_3(\mathbb C)$56, where $M_3(\mathbb C)$57 is a completely positive quantum adjacency matrix (Hamidi et al., 1 Apr 2025). If

$M_3(\mathbb C)$58

then simplicity of the associated Cuntz–Pimsner algebra $M_3(\mathbb C)$59 is controlled by minimality and aperiodicity, or more generally by Condition (S) (Hamidi et al., 1 Apr 2025). The paper proves that when $M_3(\mathbb C)$60 is full,

$M_3(\mathbb C)$61

(Hamidi et al., 1 Apr 2025). It also gives explicit examples: complete quantum graphs always yield simple $M_3(\mathbb C)$62, whereas trivial quantum graphs never do (Hamidi et al., 1 Apr 2025).

The same paper provides the first example of a quantum graph with distinct quantum Cuntz–Krieger and local quantum Cuntz–Krieger algebras (Hamidi et al., 1 Apr 2025). A plausible implication is that, in the noncommutative setting, simplicity of the graph itself and simplicity of associated universal graph algebras can diverge in ways without a direct classical counterpart.

Another symmetry-theoretic development embeds any classical simple graph $M_3(\mathbb C)$63 into a quantum graph

$M_3(\mathbb C)$64

and studies its game algebra $M_3(\mathbb C)$65 (Ostrovska et al., 10 Mar 2026). The paper proves that for every graph with $M_3(\mathbb C)$66, the associated quantum graph $M_3(\mathbb C)$67 admits a nonlocal symmetry (Ostrovska et al., 10 Mar 2026). For complete graphs, $M_3(\mathbb C)$68 is noncommutative already for all $M_3(\mathbb C)$69, in contrast with the ordinary graph quantum automorphism algebra $M_3(\mathbb C)$70, which becomes noncommutative only for $M_3(\mathbb C)$71 (Ostrovska et al., 10 Mar 2026). This suggests that passing from a classical simple graph to its associated quantum graph can systematically enlarge the symmetry landscape.

7. Dynamical quantum simple graphs and graph thermodynamics

A further research line treats the graph itself as a quantum degree of freedom. In the framework of dynamical quantum multigraphs, labeled undirected quantum multigraphs on $M_3(\mathbb C)$72 vertices with local edge dimension $M_3(\mathbb C)$73 are described by

$M_3(\mathbb C)$74

(Betre et al., 10 Sep 2025). Quantum simple graphs are the specialization $M_3(\mathbb C)$75, so that

$M_3(\mathbb C)$76

with

$M_3(\mathbb C)$77

(Betre et al., 10 Sep 2025). Basis states

$M_3(\mathbb C)$78

are in one-to-one correspondence with labeled classical simple graphs.

The free Hamiltonian is

$M_3(\mathbb C)$79

and for labeled simple graphs the partition function is exactly

$M_3(\mathbb C)$80

(Betre et al., 10 Sep 2025). The model is identified exactly with the Erdős–Rényi–Gilbert random graph $M_3(\mathbb C)$81, with

$M_3(\mathbb C)$82

(Betre et al., 10 Sep 2025). Because the free energy is analytic, the labeled free theory has no thermodynamic phase transition.

The unlabeled theory is obtained by projecting labeled graph states under the $M_3(\mathbb C)$83-action: $M_3(\mathbb C)$84 (Betre et al., 10 Sep 2025). Its partition function becomes

$M_3(\mathbb C)$85

where $M_3(\mathbb C)$86 is the automorphism group (Betre et al., 10 Sep 2025). The paper reports evidence that unlabeled quantum graphs exhibit proper thermodynamic phase transitions in both the free and ferromagnetic Ising models, characterized by divergence in the specific heat and critical slowing near the critical temperature, with order parameter

$M_3(\mathbb C)$87

the fraction of vertices in the largest connected component of $M_3(\mathbb C)$88 (Betre et al., 10 Sep 2025). This suggests a distinct notion of quantum simple graph in which combinatorial configurations themselves span the Hilbert space and become thermodynamic degrees of freedom.

---

A recurring misconception is that “simple” implies either graph-theoretic triviality or classical reducibility. The transport studies show the opposite: the smallest regular cycles and degree-$M_3(\mathbb C)$89 motifs already generate broad suppression bands, narrow resonances, and nontrivial interference hierarchies (Drinko et al., 2019, Drinko et al., 2019). The finite-dimensional theory adds a second correction: in $M_3(\mathbb C)$90, all simple quantum graphs are quantum isomorphic to classical graphs, but in $M_3(\mathbb C)$91 there are simple graphs that are not quantum isomorphic to any classical graph (Gromada, 2021). A third correction comes from symmetry theory: simple classical graphs embedded as quantum graphs may acquire nonlocal quantum symmetries absent from the original combinatorial object (Ostrovska et al., 10 Mar 2026). Taken together, these results indicate that quantum simple graphs form a broad family of minimal yet structurally rich models in which quantum transport, noncommutative adjacency, quantum symmetry, and graph-based state spaces can all be studied in explicitly computable settings.