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

• URL: http://arxiv.org/abs/2605.01953v1
• Date: Sun, 03 May 2026 16:31:26 GMT
• Title: Schur States, Average Mixing, and Counting Trees on Line Graphs' CTQW
• Abstract summary: 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 $ellG$.<n>We identify a structural mechanism -- the $-2$ eigenspace of $ellG$ -- providing uniform commutative states beyond the regular case.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Exponential random graph models with soft clique constraints [0.0]
  We consider an exponential random graph model which gives higher probability to $G in mathbfG_n than to $H in mathbfG_n$ if $G$ has fewer $r$-cliques than $H$.<n>The degree to which graphs with fewer $r$-cliques are given higher probability is determined by a positive weight $w$.
  arXiv  Detail & Related papers  (2026-08-31T14:31:57Z)
• Sharp Minimax Regret for Infinite-Memory Logistic Prediction [55.29259818039367]
  Lag $j$ can affect prediction by scale $r_j$ and enters only $n_T,j=T-j+1$ prediction rounds.<n>For every summable envelope, a localized mixture proves $cR_T(r)leq C_T(r)$.<n>For exponential and envelopes, under the stated finite-sample condition, a Toeplitz-design converse proves $cR_T(r)geq c_T(r)$.
  arXiv  Detail & Related papers  (2026-08-27T01:31:46Z)
• Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry [2.6140509675507384]
  We consider the problem of embedding the vertices of an $n$-vertex graph $G$ into the leaves of an $n$-leaf rooted binary tree $mathcalB$.<n>We numerically compare our congestion bounds on different families of graphs with regular structure (hypercubes and lattices), random graphs, and tensor network representations of quantum circuits.
  arXiv  Detail & Related papers  (2025-10-03T04:58:40Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Graph Unfolding and Sampling for Transitory Video Summarization via Gershgorin Disc Alignment [48.137527345353625]
  User-generated videos (UGVs) uploaded from mobile phones to social media sites like YouTube and TikTok are short and non-repetitive. We summarize a transitory UGV into several discs in linear time via fast graph sampling based on Gershgorin disc alignment (GDA) We show that our algorithm achieves comparable or better video summarization performance compared to state-of-the-art methods, at a substantially reduced complexity.
  arXiv  Detail & Related papers  (2024-08-03T20:08:02Z)
• Detection of Dense Subhypergraphs by Low-Degree Polynomials [72.4451045270967]
  Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem. We consider detecting the presence of a planted $Gr(ngamma, n-alpha)$ subhypergraph in a $Gr(n, n-beta) hypergraph. Our results are already new in the graph case $r=2$, as we consider the subtle log-density regime where hardness based on average-case reductions is not known.
  arXiv  Detail & Related papers  (2023-04-17T10:38:08Z)
• Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions [51.19236668224547]
  We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions. For tensor train decomposition, we give a bicriteria $(1 + eps)$-approximation algorithm with a small bicriteria rank and $O(q cdot nnz(A))$ running time. In addition, we extend our algorithm to tensor networks with arbitrary graphs.
  arXiv  Detail & Related papers  (2022-07-15T11:55:09Z)
• Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems [0.0]
  We prove that the continuous-time quantum walk (CTQW) -- with Hamiltonian $H=gamma L$ -- does not depend on the graph $G$. We apply our results to spatial search and quantum transport for single and multiple fully connected marked vertices.
  arXiv  Detail & Related papers  (2022-02-28T14:33:44Z)
• Fast Computation of Generalized Eigenvectors for Manifold Graph Embedding [38.902986549367434]
  We leverage existing fast extreme eigenvector computation algorithms for speedy execution. Our embedding is among the fastest in the literature, while producing the best clustering performance for manifold graphs.
  arXiv  Detail & Related papers  (2021-12-15T03:45:39Z)
• A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs [1.0435741631709405]
  An $soperatorname-t$ minimum cut in a graph corresponds to a minimum weight subset of edges whose removal disconnects $s$ and $t$. In this work we describe a quantum algorithm for the minimum $soperatorname-t$ cut problem on undirected graphs.
  arXiv  Detail & Related papers  (2021-10-29T07:35:46Z)
• Fast Graph Sampling for Short Video Summarization using Gershgorin Disc Alignment [52.577757919003844]
  We study the problem of efficiently summarizing a short video into several paragraphs, leveraging recent progress in fast graph sampling. Experimental results show that our algorithm achieves comparable video summarization as state-of-the-art methods, at a substantially reduced complexity.
  arXiv  Detail & Related papers  (2021-10-21T18:43:00Z)
• On the Self-Penalization Phenomenon in Feature Selection [69.16452769334367]
  We describe an implicit sparsity-inducing mechanism based on over a family of kernels. As an application, we use this sparsity-inducing mechanism to build algorithms consistent for feature selection.
  arXiv  Detail & Related papers  (2021-10-12T09:36:41Z)
• Exact Matching of Random Graphs with Constant Correlation [2.578242050187029]
  This paper deals with the problem of graph matching or network alignment for ErdHos--R'enyi graphs. It can be viewed as a noisy average-case version of the graph isomorphism problem.
  arXiv  Detail & Related papers  (2021-10-11T05:07:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.