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:2103.05235 · Quantum Information Processing

A new type of spectral mapping theorem for quantum walks with a moving shift on graphs

Sho Kubota, Kei Saito, Yusuke Yoshie

Published Apr 27, 2022• 4 citations
arXivHTMLPDF
DOI
10.1007/s11128-022-03493-x

Related papers

Spectral mapping theorem of an abstract quantum walk

Etsuo Segawa, Akito Suzuki

arXiv:1506.06457•Quantum Information Processing•Sep 11, 2019•34 citations

Spectral mapping theorem of an abstract non-unitary quantum walk

Keisuke Asahara, Daiju Funakawa, Etsuo Segawa +2 more

arXiv:2209.13213•Linear Algebra and its Applications•Jul 10, 2023•5 citations

A Note on the Spectral Mapping Theorem of Quantum Walk Models

Kaname Matsue, Osamu Ogurisu, Etsuo Segawa

We discuss the description of eigenspace of a quantum walk model U with an associating linear operator T in abstract settings of quantum walk including the Szegedy walk on graphs. In particular, we provide the spectral mapping theorem of U without the spectral decomposition of T. Arguments in this direction reveal the eigenspaces of U characterized by the generalized kernels of linear operators given by T.

arXiv:1604.00581•Interdisciplinary Information Sciences•Jan 1, 2017•16 citations

Quaternionic quantum walks of Szegedy type and zeta functions of graphs

Norio Konno, Kaname Matsue, Hideo Mitsuhashi +1 more

We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to derive the spectral mapping theorem for the quaternionic Szegedy walk, we derive a quaternionic extension of the determinant expression of the second weighted zeta function of a graph. Our main results determine explicitly all the right eigenvalues of the quaternionic Szegedy walk by using complex right eigenvalues of the corresponding doubly weighted matrix. We also show the way to obtain eigenvectors corresponding to right eigenvalues derived from those of doubly weighted matrix.

arXiv:1703.04969•Quantum Information and Computation•Dec 1, 2017•1 citation

Interpolating walk between discrete-time quantum walk and its intrinsic random walk on graph

Yusuke Higuchi, Etsuo Segawa, Honoka Shiratori +1 more

We consider an interpolation with the parameter $p\in [0,1]$ between the discrete-time quantum ($p=0$) and its intrinsic random ($p=1$) walks on a finite connected graph. Its time evolution is defined by the convex combination of the Kraus (CPTP) maps of the quantum and random walks. The Kraus map of the random walk is represented by taking a kind of projection of that of the quantum walk. The time evolution of the interpolation is interpreted as the combination of the following two dynamics of $2$ walkers on the same graph correlated with each other: $2$ walkers move independently of each other (no-correlation) with probability $1-p$, while $2$ walkers always move into the same position (the maximal correlation) with probability $p$ at each time step. In this paper, we generalize the random walk to a new walk, namely, the correlated walk, which preserves the intrinsic property and relaxes the maximal correlation of the random walk. This correlation is determined by a partition of the arc sets in the underlying graph. We show that the eigenvalues of the interpolating walk between the correlated and quantum walks live in $\{ z\in \mathbb{C}\;|\;1-p\leq |z|\leq 1 \}$ and that the absorption state coincides with that of the correlated walk, which is characterized by the underlying graph structures.

arXiv:2609.30931•Sep 25, 2026•0 citations

Quantum Walks on Finite Graphs

Renato Portugal

Springer eBooks•Jan 1, 2013•0 citations
We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to derive the spectral mapping theorem for the quaternionic Szegedy walk, we derive a quaternionic extension of the determinant expression of the second weighted zeta function of a graph. Our main results determine explicitly all the right eigenvalues of the quaternionic Szegedy walk by using complex right eigenvalues of the corresponding doubly weighted matrix. We also show the way to obtain eigenvectors corresponding to right eigenvalues derived from those of doubly weighted matrix.
We consider an interpolation with the parameter p∈[0,1]p\in [0,1]p∈[0,1] between the discrete-time quantum (p=0p=0p=0) and its intrinsic random (p=1p=1p=1) walks on a finite connected graph. Its time evolution is defined by the convex combination of the Kraus (CPTP) maps of the quantum and random walks. The Kraus map of the random walk is represented by taking a kind of projection of that of the quantum walk. The time evolution of the interpolation is interpreted as the combination of the following two dynamics of 222 walkers on the same graph correlated with each other: 222 walkers move independently of each other (no-correlation) with probability 1−p1-p1−p, while 222 walkers always move into the same position (the maximal correlation) with probability ppp at each time step. In this paper, we generalize the random walk to a new walk, namely, the correlated walk, which preserves the intrinsic property and relaxes the maximal correlation of the random walk. This correlation is determined by a partition of the arc sets in the underlying graph. We show that the eigenvalues of the interpolating walk between the correlated and quantum walks live in {z∈C  ∣  1−p≤∣z∣≤1}\{ z\in \mathbb{C}\;|\;1-p\leq |z|\leq 1 \}{z∈C∣1−p≤∣z∣≤1} and that the absorption state coincides with that of the correlated walk, which is characterized by the underlying graph structures.