Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1506.02855

Spectral properties of weighted line digraphs

Etsuo Segawa

Published Jun 9, 2015• 2 citations
arXivHTMLPDF

Abstract

In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based space to a vertex-based space. We see that depending on the boundary operator and the Hilbert spaces, $W$ has different kind of an underlying stochastic transition operator. As an application, we obtain the spectrum of the positive support of cube of the Grover matrix in a large girth of the graph.

DOI
10.48550/arxiv.1506.02855

Related papers

Line digraphs and coined quantum random walks

Simone Severini B

Abstract. In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph − → LD of a digraph ( D = (V, A) is the

•Oct 8, 2002•3 citations

A note on the discrete-time evolutions of quantum walk on a graph

Yusuke Higuchi, Norio Konno, Iwao Sato +1 more

For a quantum walk on a graph, there exist many kinds of operators for the discrete-time evolution. We give a general relation between the characteristic polynomial of the evolution matrix of a quantum walk on edges and that of a kind of transition matrix of a classical random walk on vertices. Furthermore we determine the structure of the positive support of the cube of some evolution matrix, which is said to be useful for isospectral problem in graphs, under a certain condition.

arXiv:1207.4987•Jul 20, 2012•13 citations

A Characteristic Polynomial for the Transition Probability Matrix of Correlated Random Walks on a Graph

Takashi Komatsu, Norio Konno, Iwao Sato

We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of $G$. As an application, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.

The Electronic Journal of Combinatorics•Nov 5, 2021•3 citations

The underlying digraph of a coined quantum random walk

Simone Severini B

We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.

arXiv:quant-ph/0210055•Oct 8, 2002•3 citations

A Characteristic Polynomial for The Transition Probability Matrix of A Correlated Random Walk on A Graph

Komatsu, Takashi, Norio Konno, Iwao Sato

We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of $G$. As applications, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.

arXiv:2012.09619•Dec 17, 2020•0 citations

Spectral characterization of the uniform theta graph $Θ(t,2)$ and classification of 6-periodic Grover walks

Sho Kubota

We characterize the uniform theta graph $Θ(t,2)$ by the spectrum of its normalized adjacency matrix, or equivalently, by the spectrum of its normalized Laplacian matrix. We also investigate the periodicity of Grover walks on nonregular graphs, which is closely related to the eigenvalues of the normalized adjacency matrix and those of the time evolution matrix of the Grover walk. We show that the Dutch windmill graph $D_n^{(t)}$ is $2n$-periodic and that the uniform theta graph $Θ(t,n)$ is $(2n+2)$-periodic. Furthermore, we completely determine the connected $6$-periodic graphs and prove that they are precisely $D_3^{(t)}$ with $t \geq 2$ and $Θ(t,2)$ with $t \geq 1$.

math.COCross-listedarXiv:2609.08315•Sep 9, 2026
In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph GGG, the adjacency matrix of the weighted line digraph WWW is determined by a boundary operator from an arc-based space to a vertex-based space. We see that depending on the boundary operator and the Hilbert spaces, WWW has different kind of an underlying stochastic transition operator. As an application, we obtain the spectrum of the positive support of cube of the Grover matrix in a large girth of the graph.
Abstract. In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph − → LD of a digraph ( D = (V, A) is the
We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph GGG, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of GGG. As an application, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.
We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph GGG, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of GGG. As applications, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.
Spectral characterization of the uniform theta graph Θ(t,2)Θ(t,2)Θ(t,2) and classification of 6-periodic Grover walks
We characterize the uniform theta graph Θ(t,2)Θ(t,2)Θ(t,2) by the spectrum of its normalized adjacency matrix, or equivalently, by the spectrum of its normalized Laplacian matrix. We also investigate the periodicity of Grover walks on nonregular graphs, which is closely related to the eigenvalues of the normalized adjacency matrix and those of the time evolution matrix of the Grover walk. We show that the Dutch windmill graph Dn(t)D_n^{(t)}Dn(t)​ is 2n2n2n-periodic and that the uniform theta graph Θ(t,n)Θ(t,n)Θ(t,n) is (2n+2)(2n+2)(2n+2)-periodic. Furthermore, we completely determine the connected 666-periodic graphs and prove that they are precisely D3(t)D_3^{(t)}D3(t)​ with t≥2t \geq 2t≥2 and Θ(t,2)Θ(t,2)Θ(t,2) with t≥1t \geq 1t≥1.