Quantum Multigraphs Overview

• Quantum multigraphs are nonclassical multigraphs that embed extra data like Kraus-space attributes or controlled-phase operations, extending traditional graph structures.
• They employ operator-algebraic, combinatorial, and categorical frameworks to model multiplicities as higher-rank projections and noncommutative labels, crucial in quantum channel theory and symmetry studies.
• Applications span quantum walks, entangled multigraph states, and statistical mechanics, offering precise methods to analyze connectivity, automorphisms, and quantum phase transitions.

Quantum multigraphs are nonclassical generalizations of multigraphs that appear in several adjacent research programs, including operator-algebraic quantum graph theory, zero-error information theory, multipartite entanglement, quantum symmetry, quantum walks, and quantum statistical mechanics. In these settings, a multiedge need not be merely an integer multiplicity in an adjacency matrix: it may carry Kraus-space data, output labels, a noncommutative bimodule structure, or a controlled-phase operation. A recurring theme is that an ordinary single-edged graph is often recovered only after a collapse operation such as multiplication, partial trace, or explicit “edge counting” (Brannan et al., 2024, Hossain et al., 7 Apr 2026).

1. Formal meanings of “quantum multigraph”

The literature contains several formal definitions of quantum multigraphs. In the confusability framework, a quantum multigraph on a pair $(M,N)$ of finite-dimensional algebras is a subspace $V \subseteq B(H)\otimes N$ such that $V$ is an $(M' \otimes 1)$-bimodule and $(1 \otimes Z(N))V \subseteq V$. Here $M$ plays the role of a quantum vertex set and $N$ the role of a quantum label set, so multiplicity is built into the label algebra rather than represented only by an integer edge count (Hossain et al., 7 Apr 2026).

A second operator-algebraic usage starts from a quantum graph specified by a triple $(V_G,\phi_G,A_G)$, where $V_G$ is a finite quantum space, $\phi_G$ is a faithful state, and $V \subseteq B(H)\otimes N$0 is a self-adjoint operator on the GNS Hilbert space $V \subseteq B(H)\otimes N$1. In this setting, quantum multigraphs arise by allowing multiplicities or higher weights encoded in $V \subseteq B(H)\otimes N$2, and the associated operator system

$V \subseteq B(H)\otimes N$3

captures the multiedged structure as well (Bochniak et al., 14 Feb 2025).

A third usage is algebraic-combinatorial rather than operator-algebraic. A quantum multigraph may be a formal real linear combination

$V \subseteq B(H)\otimes N$4

of finite undirected multigraphs, called nonnegative when

$V \subseteq B(H)\otimes N$5

for all multigraphs $V \subseteq B(H)\otimes N$6. In that tradition, the object of study is not a single quantum system but a noncommutative analogue of graph-density inequalities and Positivstellensätze (Netzer et al., 2013).

2. Operator-algebraic and categorical structure

A major unifying framework models finite quantum sets by finite-index inclusions of unital C$V \subseteq B(H)\otimes N$7-algebras

$V \subseteq B(H)\otimes N$8

with adjacency encoded by Schur idempotents $V \subseteq B(H)\otimes N$9. The quantum Fourier transform

$V$0

intertwines composition and the Schur product,

$V$1

Within this formalism, classical multigraphs arise from integer-valued Schur idempotents, while quantum multiedges arise from higher-rank projections or sums thereof. The same language encompasses finite classical simple graphs, Cayley graphs of finite quantum groupoids, and all finite-dimensional quantum graphs (Brannan et al., 2024).

The infinite-dimensional extension replaces bounded-operator bimodules by Hilbert–Schmidt quantum relations. For a von Neumann algebra $V$2, an HS quantum relation is a Hilbert–Schmidt norm-closed $V$3-bimodule in $V$4. Using an operator-valued weight $V$5, one obtains a self-dual Hilbert $V$6-module that mediates a bijection between HS quantum relations and projections $V$7. When $V$8 is integrable for the slice map $V$9, there is an associated normal CP map $(M' \otimes 1)$0, interpreted as a quantum adjacency operator, with Kraus representation built from the HS quantum relation (Daws, 28 Nov 2025).

Concrete low-dimensional examples clarify the boundary between classical and genuinely quantum behavior. On the quantum space $(M' \otimes 1)$1, all simple quantum graphs are classified, and all are quantum isomorphic to classical Cayley graphs of $(M' \otimes 1)$2; the summaries of these examples state that quantum-specific multiple edges do not arise at that level (Gromada, 2021).

3. Confusability, adjacency, and graph parameters

In channel theory, the quantum confusability multigraph refines the standard noncommutative confusability graph by retaining output information. For a quantum channel $(M' \otimes 1)$3 with linear Kraus space $(M' \otimes 1)$4, the confusability multigraph is

$(M' \otimes 1)$5

while the usual single-edged confusability graph is recovered by “counting” edges,

$(M' \otimes 1)$6

This retains the full Kraus-space structure as a finer invariant than the operator system alone. The same work gives a necessary and sufficient condition: a quantum multigraph arises as a confusability multigraph of some quantum channel if and only if it is a symmetric decomposable quantum multi-relation (Hossain et al., 7 Apr 2026).

A complementary development constructs large parametric families of quantum graphs that can still be treated discretely. In “Quantum Graph Theory by Example,” the examples are parametrised by triples of matrices $(M' \otimes 1)$7. The parametrisation decomposes the structure into classical and genuinely quantum parts: $(M' \otimes 1)$8 and $(M' \otimes 1)$9 are described by a classical weighted graph called the strange graph, while $(1 \otimes Z(N))V \subseteq V$0 supplies a purely quantum contribution with no classical analogue. On this basis, exact formulas or bounds are given for the number of connected components, the chromatic number, the independence number, and the clique number, yielding the first large parametric families of quantum graphs for which standard graph parameters can be computed analytically (Spitzer et al., 24 Mar 2026).

These two lines address different aspects of adjacency. The confusability construction asks how much channel-output information can be retained before collapsing to the usual operator system, whereas the $(1 \otimes Z(N))V \subseteq V$1-model isolates how much of a quantum graph’s combinatorics is still governed by a weighted classical graph and how much remains genuinely nonclassical. This suggests that multiplicity in quantum multigraphs is often inseparable from extra structural data, not merely from repeated incidence.

4. Quantum symmetry and automorphisms of multigraphs

For classical directed or undirected multigraphs, quantum symmetry has been developed as an extension of the Banica and Bichon quantum automorphism-group formalisms. If $(1 \otimes Z(N))V \subseteq V$2 is a multigraph with adjacency matrix

$(1 \otimes Z(N))V \subseteq V$3

the theory in “Quantum symmetry in multigraphs (part I)” introduces three categories: $(1 \otimes Z(N))V \subseteq V$4, $(1 \otimes Z(N))V \subseteq V$5, and $(1 \otimes Z(N))V \subseteq V$6. For single-edged graphs these reduce to the already existing notions of quantum symmetry. For general multigraphs, universal objects always exist in the Banica-type and Bichon-type categories, while for the symmetric category existence is generally open. A central theorem states that any multigraph with at least two pairs of vertices with multiple edges among them possesses genuine quantum symmetry (Goswami et al., 2023).

The continuation “part II” constructs an explicit non-Bichon type co-action on a multigraph: it preserves quantum symmetry of $(1 \otimes Z(N))V \subseteq V$7 in the new sense but not always in Bichon’s sense. The construction is motivated by automorphisms of quantum graphs and works on a fibered vertex algebra rather than only through quantum permutations of the edge set. This makes precise that, for multigraphs, operator-level compatibility can be strictly broader than edge-permutation symmetry (Goswami et al., 2024).

Quantum Mycielskians provide a further symmetry-sensitive construction. In that framework, a quantum graph is given by $(1 \otimes Z(N))V \subseteq V$8, and quantum multigraphs arise by allowing multiplicities or higher weights in $(1 \otimes Z(N))V \subseteq V$9. The quantum Mycielski construction lifts quantum automorphisms from $M$0 to $M$1; if $M$2 has no quantum twin vertices, then all quantum automorphisms of the quantum Mycielskian fixing the master vertex arise from those of $M$3. The same paper introduces a quantum distinguishing number and proves that, if $M$4 has no quantum twins, then

$M$5

For classical graphs with $M$6, the quantum and classical notions of twin vertices coincide (Bochniak et al., 14 Feb 2025).

5. Multigraph states, multihypergraph states, and entanglement structure

In multipartite state theory, a quantum multigraph state is an entangled $M$7-qudit state built from edge-dependent controlled-phase operations. If $M$8 is a multigraph and $M$9 denotes the multiplicity or weight of edge $N$0, the state is

$N$1

The edges can be parameterized by tuples $N$2, so distinct multiedges between the same vertices may implement distinct controlled-phase gates. Standard graph states are recovered when all exponents are $N$3. The same paper introduces multihypergraph states and proves a one-to-one correspondence between $N$4-dimensional multihypergraph states and generalized real equally weighted states when $N$5 is prime; for composite $N$6, multihypergraph states form a subset of the generalized real equally weighted states (Zhang et al., 2023).

This formalism should be distinguished from quantum hypergraph states in the earlier stabilizer literature. There, a $N$7-uniform hypergraph state is generated by $N$8-body controlled-$N$9 gates, with graph states as the $(V_G,\phi_G,A_G)$0 special case. The same source explicitly contrasts multigraphs and hypergraphs: a multigraph allows multiple edges between pairs of vertices but remains pairwise, whereas a hypergraph allows general $(V_G,\phi_G,A_G)$1-body interactions. It also proves that $(V_G,\phi_G,A_G)$2 and $(V_G,\phi_G,A_G)$3 are inequivalent under local Pauli operations for $(V_G,\phi_G,A_G)$4, and that the set of all real equally weighted states coincides with the set of general hypergraph states,

$(V_G,\phi_G,A_G)$5

Certain states used in Grover’s algorithm require genuinely $(V_G,\phi_G,A_G)$6-body controlled-$(V_G,\phi_G,A_G)$7 operations and therefore cannot be generated using only graph states (Rossi et al., 2012).

Taken together, these results separate two distinct generalizations of graph states. Multigraph states enlarge the class of pairwise constructions by allowing multiple, parameterized edges between the same vertices; hypergraph states enlarge it by raising the interaction order from $(V_G,\phi_G,A_G)$8 to arbitrary $(V_G,\phi_G,A_G)$9.

6. Quantum walks, search, and multipartite exclusivity

Quantum-walk algorithms on multigraphs have been developed in both search and circuit-synthesis settings. For arbitrary bipartite multigraphs, adapted Szegedy quantum walks and adapted staggered quantum walks yield a search algorithm with quadratic speedup over classical Markov-chain search. The query complexity is $V_G$0, where $V_G$1 is the hitting time of the underlying reversible Markov chain, and the same framework extends via line graphs to 2-tessellable graphs (Bezerra et al., 17 Apr 2025).

In coined discrete-time quantum walks, the shift operator can be read as a unitary form of the adjacency matrix, but the transformation generally changes the original graph into a directed multigraph by splitting single edges or arcs into multiple arcs. The shift operator is written as

$V_G$2

and the generalized coin operator is

$V_G$3

The paper states that any quantum circuit acting on a bipartite system is suitable to be the shift operator in a coined quantum walk, and any such circuit is therefore associated to a multigraph in this representation (Wing-Bocanegra et al., 2023).

A different multigraph role appears in quantum non-locality. For an $V_G$4-partite Bell inequality, an edge-coloured multigraph with $V_G$5 colour classes encodes which party is responsible for each exclusivity relation. The relevant invariant is the multigraph Lovász number

$V_G$6

where each projector factorizes across parties according to the coloured factors. It satisfies

$V_G$7

with $V_G$8 the simple exclusivity graph obtained by merging colours, and it yields tighter bounds than the ordinary Lovász number for inequalities such as $V_G$9, $\phi_G$0, and the pentagon examples discussed in the paper (Rabelo et al., 2014).

7. Reconstruction, statistical mechanics, gravity, and positivity

Quantum multigraphs also appear as objects to be reconstructed or quantized in their own right. In graph reconstruction via operator algebras, the boundary crossed product

$\phi_G$1

associated to the universal covering of a multigraph determines only topological information: for graphs with first Betti number $\phi_G$2,

$\phi_G$3

By contrast, after equipping the algebra with a quantum statistical mechanical time evolution based on the Busemann function, the resulting QSM system reconstructs finite multigraphs with minimal degree at least three up to graph isomorphism (Cornelissen et al., 2012).

In causal quantum gravity, effective multigraph ensembles arise by collapsing each spatial slice at distance $\phi_G$4 in a causal triangulation to a single vertex and retaining the edges between levels $\phi_G$5 and $\phi_G$6. For these rooted multigraphs, the spectral and Hausdorff dimensions are related by

$\phi_G$7

where $\phi_G$8 is the exponent governing anomalous resistance to infinity. The equality $\phi_G$9 holds if and only if $V \subseteq B(H)\otimes N$00. The same framework introduces scale-dependent spectral dimension and exhibits flows from $V \subseteq B(H)\otimes N$01 to $V \subseteq B(H)\otimes N$02 in a Galton–Watson-based model and from $V \subseteq B(H)\otimes N$03 to $V \subseteq B(H)\otimes N$04 in a model motivated by four-dimensional CDT (Giasemidis et al., 2012).

A further step is the direct quantization of finite multigraphs as microscopic degrees of freedom. In “Dynamical Quantum Multigraphs,” each unordered edge $V \subseteq B(H)\otimes N$05 carries its own finite-dimensional Hilbert space, and the total Hilbert space for labeled multigraphs is

$V \subseteq B(H)\otimes N$06

For labeled quantum simple graphs, the free theory is exactly the Erdős–Rényi–Gilbert $V \subseteq B(H)\otimes N$07 model and has analytic free energy, hence no thermodynamic phase transition. For unlabeled quantum graphs, both the free and the ferromagnetic Ising models exhibit proper thermodynamic phase transitions, characterized by divergence in the specific heat and by an order parameter given as the fraction of vertices in the largest connected component (Betre et al., 10 Sep 2025).

The graph-density tradition adds an algebraic-positivity perspective. There, Positivstellensätze for quantum multigraphs characterize nonnegativity through approximation by preorders and sums of squares, but also show limitations of exact certification. In particular, Robinson-polynomial-type examples yield nonnegative quantum multigraphs that are not sums of squares, so approximation terms such as $V \subseteq B(H)\otimes N$08 are generally unavoidable (Netzer et al., 2013).