Connectivity for quantum graphs via quantum adjacency operators

Kristin Courtney; Mateusz Wasilewski; Priyanga Ganesan

REVIEW 2 major objections 4 minor 8 references

Connectivity for quantum graphs via quantum adjacency operators

T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A real undirected quantum graph is connected precisely when its quantum adjacency operator is an irreducible completely positive map, a condition that unifies the operator-system and homomorphism definitions and extends to non-tracial…

desk verdict A solid unification of quantum graph connectivity notions; the core theorem holds and the needed fixes are minor. read the letter →

arxiv 2505.22519 v1 pith:43HKUESS submitted 2025-05-28 math.OA math-phmath.MP

Kristin Courtney , Priyanga Ganesan , Mateusz Wasilewski This is my paper

classification math.OAmath-phmath.MP MSC 46L1005C5081P45

keywords quantumgraphsadjacencymatricesirreducibilitycompletelypositivemapsKMSinnerproductgraphLaplacianbipartitePerron–Frobeniustheorem

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Connectivity of a quantum graph is a single algebraic property of its adjacency operator, not a separate geometric feature. The paper proves that a real, undirected quantum graph $(M,\psi,A)$ is connected exactly when $A$ is an irreducible completely positive map, and that this same condition is equivalent to the existing operator-system and homomorphism-based notions of connectivity. The proof runs through the KMS inner product, which lets the authors carry the classical Perron\textendash Frobenius and Laplacian arguments from trace states to arbitrary faithful states, so the result covers non-tracial and non-regular quantum graphs for the first time. A sympathetic reader should care because it gives one test \textemdash{} irreducibility of $A$ \textemdash{} that decides connectivity in every model, and it turns connectivity into a spectral question: for GNS-symmetric graphs, the zero eigenvalue of the quantum Laplacian is simple exactly when the graph is connected.

What carries the argument

The load-bearing object is the quantum adjacency matrix $A$ itself, defined as a quantum Schur idempotent $m(A\otimes A)m^*=A$ on a finite-dimensional C*-algebra $(M,\psi)$, together with its KMS implementation $\widetilde A(x)=\rho^{1/4}A(\rho^{-1/4}x\rho^{-1/4})\rho^{1/4}$. The KMS implementation moves the non-tracial weight onto a tracial Hilbert space, so the classical equivalent forms of irreducibility from Lemma 2.7 (invariance of $pMp$, commutation with left and right multiplication, and $\Phi(p)(1-p)=0$) and the quantum Perron\textendash Frobenius theorem apply verbatim. Irreducibility of $A$ is exactly the absence of a non-trivial projection $p\in M$ with $A(pMp)\subset pMp$, and this is what the definition of connectivity checks. The Choi-matrix and bimodule correspondence then translates irreducibility into generation of $B(H)$ by the quantum relation, while the quantum graph Laplacian $\Delta=\nabla_A^*\nabla_A$, identified with a commutator, turns the same condition into simplicity of the zero eigenvalue.

What would settle it

Run an exhaustive search over real, undirected quantum graphs on the smallest non-tracial example, $M=M_2$ with $\psi=\operatorname{Tr}(\rho\,\cdot)$ normalized by $\operatorname{Tr}(\rho^{-1})=1$, and look for an adjacency operator $A$ that is irreducible yet admits a non-trivial projection $P$ outside the left regular representation of $M$ whose range is invariant for the associated relation. One such example would show that the paper's definition of connectivity misses a genuine quantum invariant subspace; an exhaustive negative result would support the restriction to projections in $M$.

Watch

Extended reading notes

Core claim

On the paper's own terms, define an undirected quantum graph $G=(M,\psi,A)$ with $M$ a finite-dimensional C*-algebra, $\psi$ a faithful positive functional, and $A$ a real quantum Schur idempotent, and call it connected when no non-trivial projection $p\in M$ commutes with $A$ in the left regular representation (Definitions 3.1 and 4.1). The paper's central discovery is that this condition is equivalent to $A$ being an irreducible completely positive map (Theorem 3.4 and Proposition 4.3), and in the tracial case it is also equivalent to the algebra generated by the associated quantum relation $S$ being the whole of $B(L^2(M,\psi))$, to the absence of a surjective homomorphism onto the two-vertex trivial graph, and \textemdash{} for GNS-symmetric $A$ even in the non-tracial case \textemdash{} to $0$ being a simple eigenvalue of the quantum graph Laplacian (Proposition 4.4). The KMS implementation $\widetilde A(x)=\rho^{1/4}A(\rho^{-1/4}x\rho^{-1/4})\rho^{1/4}$ is the tool that makes the non-tracial extension work, because it converts the action to a tracial Hilbert space where the Perron\textendash Frobenius theorem and the equivalent forms of irreducibility apply unchanged. The same framework characterizes bipartiteness by the spectrum being symmetric about zero, $-\lambda\in\sigma(A)$, and proves that every $d$-regular quantum adjacency operator has operator norm exactly $d$. If these claims are right, connectivity, bipartiteness, and regularity all reduce to spectral and order-theoretic facts about one operator, uniformly in tracial and non-tracial settings.

Load-bearing premise

The load-bearing premise is that connectivity is tested only by projections inside the function algebra $M$ of the quantum space, plus the standing block normalization $\operatorname{Tr}(\rho_a^{-1})=1$, so if a genuinely quantum connected component could use projections outside $M$, or the state failed that normalization, the main equivalences would collapse.

Editorial extensions

If this is right

Connectivity of any real undirected quantum graph can be decided by checking whether its adjacency map is irreducible, a finite algebraic condition rather than a search over homomorphisms.
For GNS-symmetric quantum graphs, a graph is connected exactly when the quantum Laplacian has a simple zero eigenvalue, giving a spectral test in non-tracial and non-regular settings.
The random quantum graph model $QG(n,d)$ produces connected graphs almost surely for $2\le d\le n^2-3$.
Every $d$-regular quantum graph has adjacency operator norm $\|A\|=d$, matching the classical adjacency spectral bound.
The equality of operator-system, homomorphism, Laplacian, and irreducibility characterizations means future work on connectivity can use whichever language is most convenient.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Because the paper's definition deliberately tests only projections in $M$, a natural stress test is to classify quantum graphs whose adjacency operator has an invariant subspace whose projection is not in $M$; such graphs would be almost connected under this definition and might deserve a finer notion of quantum component.
The KMS implementation viewpoint suggests a channel-theoretic corollary the authors do not draw: a connected quantum graph is one whose adjacency channel has no non-trivial invariant corner, so connectivity could be reformulated as ergodicity of the associated quantum channel, connecting to mixing times of quantum walks on the graph.
The bipartite criterion via $-\lambda\in\sigma(A)$ and the support structure of the Perron eigenvector gives a constructive way to extract the two sides of a bipartite quantum graph from spectral data, which a reader could implement numerically.
For non-tracial states, the paper shows the naive GNS-based homomorphism definition must be modified at the adjoint; an untested consequence is that quantum chromatic numbers and other homomorphism invariants in non-tracial settings will need the KMS adjoint to preserve the expected graph-theoretic inequalities.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: the paper is solid. The central equivalence — connected iff the quantum adjacency matrix is irreducible — is proved cleanly in both tracial and non-tracial settings, and the paper genuinely unifies the operator-system notion from [CDS21] with Matsuda's homomorphism-based notion from [Mat24], while extending both beyond the tracial regular case. It also answers Matsuda's open question about the norm of d-regular quantum graphs.

What is new: Definition 3.1, using projections in M, is the right algebraic handle; Lemma 2.7 does the heavy lifting. The KMS inner product treatment of the non-tracial case is a real extension, not a rerun, and the Laplacian nullity criterion (Prop 4.4) is useful. The proofs I checked — 3.7, 3.9, 4.3, 4.6, 4.12, 4.15 — are sound. The paper also cites its sources honestly; the reliance on [Was24] by a co-author is legitimate because those are published, peer-reviewed lemmas used as black boxes, and the Perron-Frobenius import from [EHK78] is standard.

Soft spots, in order: (1) The abstract claims a Laplacian characterization without the GNS-symmetry hypothesis that Prop 4.4 needs. Fix the abstract. (2) Remark 4.2 has a wrong displayed substitution — y should be ρ^{-1/4}xρ^{-1/4}, not ρ^{1/4}. It is a typo. (3) Prop 4.3 states 'A is irreducible iff eA is irreducible' without proof; the KMS implementation is not an algebra isomorphism, so this deserves a sentence or two. It is true, as the stress-test note says, via spectral data, but the proof should be written. (4) The restriction of separating projections to M is a choice, not a flaw; Remark 3.2(3) justifies it. That said, if a future notion of quantum connected component needed projections in B(H), the equivalences would need revisiting.

Bottom line: this is a paper for the quantum graphs/operator algebras community. It deserves a serious referee; I would recommend conditional acceptance after the abstract and Remark 4.2 are fixed and the irreducibility invariance in Prop 4.3 is spelled out.

Referee Report

2 major / 4 minor

Summary. This paper develops an algebraic characterization of connectivity for quantum graphs in the quantum adjacency matrix model, based on the non-commutation of the quantum adjacency operator A with the regular representations of non-trivial projections in the quantum set M. The main results are: (i) for real undirected quantum graphs, connectivity is equivalent to irreducibility of A (Propositions 3.7 and 4.3, Theorem 3.4); (ii) under GNS symmetry, connectivity is equivalent to simplicity of the eigenvalue 0 of the quantum graph Laplacian (Proposition 4.4); (iii) connectivity is characterized by the algebra generated by the associated quantum relation being B(H) and by absence of surjective homomorphisms to the trivial two-vertex graph (Propositions 3.9 and 4.6); (iv) bipartiteness has a spectral characterization (Theorem 4.12); and (v) d-regular quantum graphs have operator norm d (Proposition 4.15). The proofs use a KMS inner product and a finite-dimensional Perron-Frobenius theorem, extending results from the tracial, regular setting to non-tracial and non-regular quantum graphs.

Significance. The paper offers a useful unification of operator-system connectivity (CDS21) with homomorphism-based connectivity (Mat24), and it extends both to non-tracial and non-regular quantum graphs. Its main strengths are the explicit multi-way equivalences, the clean use of the KMS inner product to handle non-tracial functionals, and the resolution of a case left open in Mat24 concerning operator norms of regular quantum graphs. The proofs are mostly detailed, imported results are clearly identified, and the finite-dimensional non-commutative Perron-Frobenius theorem is applied in a natural way. The definitional choice to test connectivity only against projections in M is explicit and defended in Remarks 3.2(3); with that convention, the equivalences are coherent. The central claim is sound, but one load-bearing proof step in Proposition 4.3 needs to be supplied, and the abstract overstates the Laplacian characterization.

major comments (2)

[§4, Proposition 4.3 (also used in Proposition 4.8)] The proof of Proposition 4.3 contains the unproved assertion 'It is easy to verify that A is irreducible if and only if eA is irreducible.' This is load-bearing: the intertwining map ι(x)=ρ^{1/4}xρ^{1/4} is a positive linear isomorphism but not an algebra homomorphism, so Lemma 2.7 does not directly transfer the reducibility condition Φ(pMp)⊂pMp. Please replace this sentence with a proof. One route is to use Theorem 2.8 and Remark 2.9: since A is KMS-symmetric, eA is self-adjoint for the trace, and for such a map irreducibility is equivalent to simplicity of the Perron root together with strict positivity of the Perron eigenvector; because eA = ιAι^{-1} and ι maps the positive cone onto itself, these spectral data coincide for A and eA. The same argument is needed in Proposition 4.8, where the equivalence is invoked again.
[Abstract and §4, Proposition 4.4] The abstract states without qualification that connectivity is characterized by 'the nullity of the associated graph Laplacian.' In the body, Proposition 4.4 proves this only under the additional hypothesis that A is self-adjoint with respect to the GNS inner product, which is stronger than the general KMS-symmetric (undirected) hypothesis used elsewhere in Section 4. Please add this hypothesis to the abstract and to any other unqualified summary statements. Theorem 3.4 is unaffected because its tracial hypothesis makes the GNS and KMS inner products coincide.

minor comments (4)

[§4, Remark 4.2] The displayed substitution should be y = ρ^{-1/4} x ρ^{-1/4}, not y = ρ^{1/4} x ρ^{1/4}; with the displayed substitution the subsequent equality does not follow. The intended equivalence is correct and should be restored with the corrected substitution.
[§3, Proposition 3.10] The phrase 'two independent Hermitian matrices' should be 'two linearly independent Hermitian matrices' to avoid ambiguity.
[§3, Theorem 3.4] In condition (5), the notation '(p1,p2,p3,...) ∈ M⊗Mop' is imprecise; the sequence (p_k) lies in M⊗Mop, not the tuple as a single element. Also, the operator system S in the statement G=(M,ψ,A,S) should be defined explicitly in the statement.
[§2, Conventions] The standing assumption that ψ is a 1-form (i.e., mm*=id, equivalently Tr(ρ_a^{-1})=1 for each block) is introduced in Section 2 and used throughout; it would help to state explicitly in Definition 2.1 or at the start of Section 3 that all subsequent results assume this condition.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: connectivity is characterized by proved equivalence with irreducibility and Laplacian nullity; cited background results do not assume the target theorems.

full rationale

The derivation chain is self-contained rather than circular. Definition 3.1 and Definition 4.1 define connectivity as a commutation condition, and the paper proves rather than assumes the equivalence with irreducibility of the quantum adjacency matrix through Lemma 2.7, the external Perron-Frobenius theorem of EHK78, and the KMS-implementation reduction in Section 4. Theorem 3.4 and Propositions 4.3, 4.4, and 4.6 connect the operator-system, homomorphism, and Laplacian formulations to this same condition by explicit proofs (Lemmas 3.5, 3.6, and 3.9; Propositions 3.7, 3.8, 4.6, and 4.4). The self-citations, mainly to [Was24] for Choi-matrix and M'-bimodule formulas and to [CW22] for random graphs, supply technical lemmas whose stated assumptions do not include connectivity and are not the target results of this paper, so they are independent support rather than load-bearing self-reference. The only flagged presentation issues are the terse assertion in Proposition 4.3 that 'It is easy to verify that A is irreducible if and only if eA is irreducible' and a substitution typo in Remark 4.2; these are omitted-proof and readability defects, not reductions of the theorem to its own inputs.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters appear: the paper proves theorems and fits no constants to data. The axioms are the standing framework assumptions plus one modeling choice (projections in M) and the imported Perron-Frobenius theorem. There are no invented entities.

assumptions (5)

domain assumption (M, ψ) is a 1-form quantum space: mm* = id, equivalently Tr(ρ_a^{-1}) = 1 for each block
Standing assumption inherited from [Was24]; used for the quantum Schur product, Choi matrix calculus (Definition 2.2, Proposition 2.3), and the bimodule correspondence (Proposition 2.5).
domain assumption Quantum graphs are real (*-preserving) and undirected (KMS-symmetric)
The main theorems assume these; Lemma 2.7 and the connectivity definitions rely on self-adjointness, and the non-tracial proofs use KMS symmetry.
domain assumption M is a finite-dimensional C*-algebra with a faithful positive functional
The Perron-Frobenius theorem (Theorem 2.8) is stated and used only in finite dimensions, and several arguments use trace-like properties available there.
standard math Quantum Perron-Frobenius theorem (Theorem 2.8) imported from [EHK78, Theorems 2.3, 2.5]
Gives existence of a positive eigenvector at spectral radius, simplicity and strict positivity for irreducible maps, and uniqueness of the positive eigenvector.
ad hoc to paper Connectivity is tested only against projections p in the quantum set M
Definition 3.1 and Remarks 3.2(3) restrict separating projections to M; this modeling choice is load-bearing for every equivalence in the paper.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Connectivity for quantum graphs via quantum adjacency operators." pith.science (2026). https://pith.science/paper/43HKUESS

@misc{pith2026250522519,
  author       = {Pith},
  title        = {Pith review of: Connectivity for quantum graphs via quantum adjacency operators},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/43HKUESS}},
  note         = {Machine review of arXiv:2505.22519}
}

read the original abstract

Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic characterization of connectivity for general quantum graphs within the quantum adjacency matrix framework. Our approach extends earlier results to the non-tracial setting and beyond regular quantum graphs. We utilize a quantum Perron-Frobenius theorem that provides a spectral characterization of connectivity, and we further characterize connectivity in terms of the irreducibility of the quantum adjacency matrix and the nullity of the associated graph Laplacian. These results are obtained using the KMS inner product, which unifies and generalizes existing formulations.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

[1]

3, 1777–1809

[BCE+20] Michael Brannan, Alexandru Chirvasitu, Kari Eifler, Samuel Harris, Vern Paulsen, Xiaoyu Su, and Ma- teusz Wasilewski, Bigalois extensions and the graph isomorphism game , Communications in Mathematical Physics 375 (2020), no. 3, 1777–1809. ↑ [BEVW22] Michael Brannan, Kari Eifler, Christian Voigt, and Moritz Weber, Quantum cuntz-krieger algebras, ...

work page 2020
[8]

↑ [Sta15] Dan Stahlke, Quantum zero-error source-channel coding and non-commutative graph theory, IEEE Trans- actions on Information Theory 62 (2015), no

↑ [MR V19] , The morita theory of quantum graph isomorphisms , Communications in Mathematical Physics 365 (2019), 797–845. ↑ [Sta15] Dan Stahlke, Quantum zero-error source-channel coding and non-commutative graph theory, IEEE Trans- actions on Information Theory 62 (2015), no. 1, 554–577. ↑ [TT24] Ivan G Todorov and Lyudmila Turowska, Quantum no-signallin...

work page 2019
[9]

↑ [Mat24] , Algebraic connectedness and bipartiteness of quantum graphs , Communications in Mathematical Physics 405 (2024), no. 8,

work page 2024
[34]

3, 886–913

MR4505911 ↑ [BHI+23] Michael Brannan, Mitch Hamidi, Lara Ismert, Brent Nelson, and Mateusz Wasilewski, Quantum edge correspondences and quantum cuntz–krieger algebras , Journal of the London Mathematical Society 107 (2023), no. 3, 886–913. ↑ [BHTT23] Michael Brannan, Samuel J Harris, Ivan G Todorov, and Lyudmila Turowska, Synchronicity for quantum non-loc...

work page arXiv 2023
[122]

↑ [HIN25] Mitch Hamidi, Lara Ismert, and Brent Nelson, Simplicity of cuntz-pimsner algebras of quantum graphs , arXiv preprint arXiv:2504.00980 (2025). ↑ 16 K. COURTNEY, P. GANESAN, AND M. W ASILEWSKI [KW12] Greg Kuperberg and Nik Weaver, A von neumann algebra approach to quantum metrics , Vol. 215, Amer- ican Mathematical Society,

work page Pith review arXiv 2025
[141]

↑ [Was24] Mateusz Wasilewski, On quantum Cayley graphs , Doc. Math. 29 (2024), no. 6, 1281–1317. MR4831258 ↑ [Wea12] Nik Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), no. 1010, v–vi, 81–140. MR2908249 ↑ [Wea21] , Quantum graphs as quantum relations , The Journal of Geometric Analysis 31 (2021), no. 9, 9090–9112. ↑ [Wir24] Melchior Wirth, Ch...

work page 2024
[185]

↑ [MR V18] Benjamin Musto, David Reutter, and Dominic Verdon, A compositional approach to quantum functions , Journal of Mathematical Physics 59 (2018), no

work page 2018
[2012]

↑ [Mat22] Junichiro Matsuda, Classification of quantum graphs on m2 and their quantum automorphism groups , Journal of Mathematical Physics 63 (2022), no

work page 2022

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [1]

3, 1777–1809

[BCE+20] Michael Brannan, Alexandru Chirvasitu, Kari Eifler, Samuel Harris, Vern Paulsen, Xiaoyu Su, and Ma- teusz Wasilewski, Bigalois extensions and the graph isomorphism game , Communications in Mathematical Physics 375 (2020), no. 3, 1777–1809. ↑ [BEVW22] Michael Brannan, Kari Eifler, Christian Voigt, and Moritz Weber, Quantum cuntz-krieger algebras, ...

work page 2020

[2] [8]

↑ [Sta15] Dan Stahlke, Quantum zero-error source-channel coding and non-commutative graph theory, IEEE Trans- actions on Information Theory 62 (2015), no

↑ [MR V19] , The morita theory of quantum graph isomorphisms , Communications in Mathematical Physics 365 (2019), 797–845. ↑ [Sta15] Dan Stahlke, Quantum zero-error source-channel coding and non-commutative graph theory, IEEE Trans- actions on Information Theory 62 (2015), no. 1, 554–577. ↑ [TT24] Ivan G Todorov and Lyudmila Turowska, Quantum no-signallin...

work page 2019

[3] [9]

↑ [Mat24] , Algebraic connectedness and bipartiteness of quantum graphs , Communications in Mathematical Physics 405 (2024), no. 8,

work page 2024

[4] [34]

3, 886–913

MR4505911 ↑ [BHI+23] Michael Brannan, Mitch Hamidi, Lara Ismert, Brent Nelson, and Mateusz Wasilewski, Quantum edge correspondences and quantum cuntz–krieger algebras , Journal of the London Mathematical Society 107 (2023), no. 3, 886–913. ↑ [BHTT23] Michael Brannan, Samuel J Harris, Ivan G Todorov, and Lyudmila Turowska, Synchronicity for quantum non-loc...

work page arXiv 2023

[5] [122]

↑ [HIN25] Mitch Hamidi, Lara Ismert, and Brent Nelson, Simplicity of cuntz-pimsner algebras of quantum graphs , arXiv preprint arXiv:2504.00980 (2025). ↑ 16 K. COURTNEY, P. GANESAN, AND M. W ASILEWSKI [KW12] Greg Kuperberg and Nik Weaver, A von neumann algebra approach to quantum metrics , Vol. 215, Amer- ican Mathematical Society,

work page Pith review arXiv 2025

[6] [141]

↑ [Was24] Mateusz Wasilewski, On quantum Cayley graphs , Doc. Math. 29 (2024), no. 6, 1281–1317. MR4831258 ↑ [Wea12] Nik Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), no. 1010, v–vi, 81–140. MR2908249 ↑ [Wea21] , Quantum graphs as quantum relations , The Journal of Geometric Analysis 31 (2021), no. 9, 9090–9112. ↑ [Wir24] Melchior Wirth, Ch...

work page 2024

[7] [185]

↑ [MR V18] Benjamin Musto, David Reutter, and Dominic Verdon, A compositional approach to quantum functions , Journal of Mathematical Physics 59 (2018), no

work page 2018

[8] [2012]

↑ [Mat22] Junichiro Matsuda, Classification of quantum graphs on m2 and their quantum automorphism groups , Journal of Mathematical Physics 63 (2022), no

work page 2022