pith. sign in

arxiv: 2605.01953 · v1 · submitted 2026-05-03 · 🪐 quant-ph · math.CO

Schur States, Average Mixing, and Counting Trees on Line Graphs' CTQW

Musung Kang This is my paper

Pith reviewed 2026-05-09 17:14 UTC · model grok-4.3

classification 🪐 quant-ph math.CO
keywords Schur statescontinuous-time quantum walksline graphsspanning treesaverage mixingweighted graph countsvon Neumann entropy
0
0 comments X

The pith

For uniform commutative initial states from continuous-time quantum walks on a graph's line graph, the time-averaged weighted graph has spanning-tree count equal to the original count scaled by 1/m to the power n-1.

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

The paper establishes that a family of complex edge weights arising from quantum walks on the line graph of G, when packaged into a Schur state that is uniform and commutative, induces after time-averaging a weighted version of G whose spanning-tree count satisfies tn(G, 1/m) = tn(G)/m^{n-1}. A sympathetic reader would care because this directly ties the long-time behavior of a quantum process to a classical combinatorial quantity without additional computation. The result holds whenever the initial state lies in a suitable eigenspace of the line graph, and the paper shows such states exist for Eulerian graphs with even edge count as well as regular graphs. A side finding is that precisely the commutative states keep their von Neumann entropy unchanged under the averaging operation.

Core claim

We introduce Schur states as n by n Hermitian matrices that encode the amplitudes of an edge-state continuous-time quantum walk on the line graph ℓG. When the initial edge state is uniform commutative, the entrywise squared moduli produce real weights on the adjacency matrix and Laplacian of G; time-averaging these weights yields a weighted graph whose spanning-tree count is exactly the original count divided by m to the power n-1. This scaling is proven using the structure of the -2 eigenspace of ℓG, which supplies the required uniform commutative states for line graphs of Eulerian graphs having an even number of edges. Commutative states are further characterized as exactly those whose von

What carries the argument

The uniform commutative initial edge state, obtained from the -2 eigenspace of the line graph, which produces weights whose average-mixing Laplacian satisfies the exact scaling relation for spanning-tree counts.

If this is right

  • The spanning-tree count after average mixing is completely determined by the unweighted count of G and the simple factor 1/m^{n-1}.
  • Uniform commutative states exist for every Eulerian graph whose edge set has even cardinality, extending the construction beyond regular graphs.
  • Commutative states are precisely the ones whose von Neumann entropy is invariant under the average-mixing map.
  • The weighted Laplacian induced by any uniform commutative Schur state yields the same scaled tree count regardless of the particular walk evolution time.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The scaling relation may supply an alternative route to bounding or approximating spanning-tree counts in large graphs by simulating the corresponding quantum walk.
  • Because the -2 eigenspace is defined for any line graph, the construction could be tested on non-Eulerian graphs to see whether weaker commutativity conditions still produce related scalings.
  • The entropy-preservation property for commutative states suggests a quantum-information interpretation of the averaging process that could link to other mixing or thermalization questions on graphs.

Load-bearing premise

The initial edge state of the quantum walk must be both uniform and commutative so that the induced weights after averaging produce the precise 1/m^{n-1} scaling.

What would settle it

Take a small cycle graph C_4 (Eulerian with even edges), prepare a uniform commutative state from its line graph's -2 eigenspace, compute the time-averaged weighted Laplacian, count its spanning trees with the 1/m weight, and check whether the number equals the unweighted cycle's tree count divided by m^{n-1}.

Figures

Figures reproduced from arXiv: 2605.01953 by Musung Kang.

Figure 1
Figure 1. Figure 1: The Whitney exception {K1,3, K3}: distinct graphs with isomorphic line graphs. 2.2 Continuous-time quantum walks on line graphs Definition 3 (Quantum walk on a line graph). The continuous-time quantum walk on ℓΓ is the unitary U(t) = exp(it A(ℓΓ)) = X n⩾0 (it) n n! A(ℓΓ)n . We work with edge states |ej ⟩ (the standard basis vector indexed by edge ej ∈ EΓ) and their superpositions |e⟩ = a1|e1⟩ + · · · + am|… view at source ↗
Figure 2
Figure 2. Figure 2: Disorder classification of a Schur state. view at source ↗
Figure 3
Figure 3. Figure 3: Classification of Schur states by behavior under average mixing. view at source ↗
Figure 4
Figure 4. Figure 4: The figure-eight graph H with ±1 edge labeling ψ from Example 31. The sum at every vertex equals 0. Remark 32. In condensed matter physics, the highly degenerate −2 eigenspace of a line graph is known as a flat band [7, 9]. The construction above realizes flat-band states explicitly via the incidence-matrix kernel, exhibiting an infinite family of non-regular line graphs admitting uniform commutative state… view at source ↗
read the original abstract

We introduce a family of complex-valued edge weights on a finite simple graph $\G$ arising from a continuous-time quantum walk on the line graph $\ell\G$, packaged as the \emph{Schur state}: an $n \times n$ Hermitian matrix encoding the amplitudes of an edge-state walk. The entrywise modulus square induces a real-weighted adjacency matrix $A(e)$ and Laplacian $L(e)$, and time-averaging yields a weighted graph whose spanning-tree count we relate to that of $\G$. Our main result is \[ tn\!\left(\G, \tfrac{1}{m}\right) = \frac{1}{m^{n-1}}\, tn(\G), \] valid whenever the initial edge state is \emph{uniform commutative}, where $n=|V\G|$, $m=|E\G|$, and $tn(\G, w)$ denotes the weighted spanning-tree count. We further identify a structural mechanism -- the $-2$ eigenspace of $\ell\G$ -- providing uniform commutative states beyond the regular case, in particular for line graphs of Eulerian graphs with an even number of edges. As a side result, we establish that commutative states are precisely the states whose von Neumann entropy is preserved under average mixing.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript introduces Schur states as n×n Hermitian matrices encoding amplitudes of continuous-time quantum walks on the line graph ℓG of a finite simple graph G. Entrywise modulus-squared yields a real-weighted adjacency matrix and Laplacian; time-averaging then produces a weighted graph whose spanning-tree enumerator tn(G,w) is related to the unweighted tn(G). The central claim is the scaling tn(G,1/m)=1/m^{n-1} tn(G) that holds precisely when the initial edge state is uniform commutative (n=|V(G)|, m=|E(G)|). The paper supplies an explicit construction of such states from the −2 eigenspace of ℓG (valid for line graphs of Eulerian graphs with even edge count) and proves as a side result that commutative states are exactly those whose von Neumann entropy is invariant under average mixing.

Significance. If the scaling identity holds, the work supplies a parameter-free bridge between continuous-time quantum walk dynamics on line graphs and the classical matrix-tree theorem, together with an explicit eigenspace construction that extends beyond regular graphs and a clean characterization of entropy-preserving states. These elements are genuine strengths: the derivation is presented as following directly from the walk evolution and the definition of uniform commutativity, with no free parameters or ad-hoc fitting.

minor comments (2)
  1. [Abstract] Abstract: the main equality is stated cleanly, but a single sentence outlining why the modulus-square and time-averaging operations preserve the claimed scaling (under the uniform-commutative hypothesis) would make the abstract self-contained and address the low-confidence concern about missing derivation steps.
  2. [Main result section] The manuscript should explicitly verify, perhaps in a short remark or appendix, that the weighted Laplacian obtained after |·|^2 and averaging remains positive-semidefinite with the correct kernel for the matrix-tree theorem to apply without further restrictions.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the accurate and positive summary of the manuscript, which correctly captures the definition of Schur states, the central scaling identity tn(G,1/m)=1/m^{n-1} tn(G) for uniform commutative edge states, the explicit construction from the -2 eigenspace of the line graph, and the characterization of von Neumann entropy invariance. We appreciate the recognition of the parameter-free link to the matrix-tree theorem and the extension beyond regular graphs. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The central identity tn(G, 1/m) = 1/m^{n-1} tn(G) is derived conditionally from the definition of uniform commutative edge states (constructed explicitly via the -2 eigenspace of the line graph ℓG) and the time-averaged weighted spanning-tree count under continuous-time quantum walk dynamics on ℓG. The side characterization that commutative states preserve von Neumann entropy under average mixing is an independent equivalence proved from the walk operator, not a redefinition of the tree-counting result. No step reduces a prediction to a fitted input, renames a known result, or relies on a load-bearing self-citation; the argument remains independent of the target identity.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on the existence and properties of uniform commutative states derived from the line-graph spectrum and the standard framework of continuous-time quantum walks; no numerical fitting parameters are introduced.

axioms (2)
  • domain assumption Continuous-time quantum walk dynamics on the line graph ℓG generate Hermitian Schur states whose entrywise squared moduli define valid weighted adjacency and Laplacian matrices.
    Invoked to induce the real-weighted graph from the quantum amplitudes.
  • domain assumption Uniform commutative initial states exist in the -2 eigenspace of ℓG for line graphs of Eulerian graphs with even edge count.
    Required for the main equality to hold beyond the regular-graph case.
invented entities (1)
  • Schur state no independent evidence
    purpose: n x n Hermitian matrix encoding amplitudes of an edge-state continuous-time quantum walk on the line graph
    Newly defined object that packages the quantum walk into a matrix whose modulus-square yields the weighted graph.

pith-pipeline@v0.9.0 · 5527 in / 1744 out tokens · 43802 ms · 2026-05-09T17:14:42.456901+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages

  1. [1]

    R. H. Villarreal,Cohen–Macaulay graphs.Manuscripta Math.66(3): 277–293, 1990

    work page 1990

  2. [2]

    R. E. Tarjan,Data Structures and Network Algorithms. CBMS-NSF Regional Con- ference Series in Applied Mathematics, Vol. 44, SIAM, 1983

    work page 1983

  3. [3]

    Godsil and G

    C. Godsil and G. Royle,Algebraic Graph Theory. Graduate Texts in Mathematics 207, Springer, 2001

    work page 2001

  4. [4]

    Godsil,Average mixing of continuous quantum walks.arXiv:1103.2578, 2011

    C. Godsil,Average mixing of continuous quantum walks.arXiv:1103.2578, 2011

    work page arXiv 2011

  5. [5]

    Coutinho et al.,A new perspective on the average mixing matrix

    G. Coutinho et al.,A new perspective on the average mixing matrix. arXiv:1709.03591, 2018

    work page arXiv 2018

  6. [6]

    A. M. Duval, C. Klivans, and J. Martin,Simplicial matrix-tree theorems.Trans. Amer. Math. Soc., 361: 6073–6114, 2009

    work page 2009

  7. [7]

    Mielke,Ferromagnetic ground states for the Hubbard model on line graphs.J

    A. Mielke,Ferromagnetic ground states for the Hubbard model on line graphs.J. Phys. A: Math. Gen., 24: L73–L77, 1991. AlsoFerromagnetism in the Hubbard model on line graphs and further considerations,J. Phys. A, 24: 3311–3321, 1991

    work page 1991

  8. [8]

    Tasaki,Ferromagnetism in Hubbard models with degenerate single-electron ground states.Phys

    H. Tasaki,Ferromagnetism in Hubbard models with degenerate single-electron ground states.Phys. Rev. Lett., 69: 1608, 1992

    work page 1992

  9. [9]

    A. J. Koll´ ar, M. Fitzpatrick, P. Sarnak, and A. A. Houck,Line-graph lattices: Eu- clidean and non-Euclidean flat bands, and implementations in circuit quantum elec- trodynamics.Comm. Math. Phys., 376: 1909–1956, 2020.arXiv:1902.02794

    work page arXiv 1909

  10. [10]

    Lindblad,Entropy, information and quantum measurements.Comm

    G. Lindblad,Entropy, information and quantum measurements.Comm. Math. Phys., 33: 305–322, 1973

    work page 1973

  11. [11]

    J. A. Bondy and U. S. R. Murty,Graph Theory. Graduate Texts in Mathematics 244, Springer, 2008

    work page 2008

  12. [12]

    Christandl, N

    M. Christandl, N. Datta, A. Ekert, and A. J. Landahl,Perfect state transfer in quantum spin networks.Phys. Rev. Lett., 92: 187902, 2004

    work page 2004

  13. [13]

    Hammack, W

    R. Hammack, W. Imrich, and S. Klavˇ zar,Handbook of Product Graphs. 2nd edition, CRC Press, 2011. the electronic journal of combinatorics00(2023), #P00 16

    work page 2011