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:1604.00581 · Interdisciplinary Information Sciences

A Note on the Spectral Mapping Theorem of Quantum Walk Models

Kaname Matsue, Osamu Ogurisu, Etsuo Segawa

Published Jan 1, 2017• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.4036/iis.2017.a.13

Related papers

A block-encoding approach to the Segawa-Suzuki spectral mapping theorem

Yohei Tanaka

We revisit the Segawa--Suzuki spectral mapping theorem for abstract Szegedy-type quantum walks from a block-encoding viewpoint. Retaining both eigenspaces of the involution underlying the chiral symmetry yields a natural two-by-two block representation in which the usual discriminant operator and its counterpart form the diagonal blocks. The non-endpoint spectral mapping theorem then follows from an elementary Schur decomposition, substantially simplifying the original proof by avoiding its invariant-subspace decomposition and approximate-eigenvector arguments. The same framework establishes the result for the spectrum, point spectrum, and Fredholm essential spectrum and gives a direct block-theoretic description of the endpoint inherited and birth eigenspaces. We illustrate the construction with a one-dimensional split-step quantum walk.

arXiv:2611.00498•Oct 31, 2026•0 citations

Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations

Toru Fuda, Daiju Funakawa, Akito Suzuki

For given two unitary and self-adjoint operators on a Hilbert space, a spectral mapping theorem was proved in the work of Higuchi et al. (e-print arXiv:1506.06457) [see also E. Segawa and A. Suzuki, Quantum Stud.: Math. Found. 3, 11 (2016)]. In this paper, as an application of the spectral mapping theorem, we investigate the spectrum of a one-dimensional split-step quantum walk. We give a criterion for when there are no eigenvalues around ±1 in terms of a discriminant operator. We also provide a criterion for when eigenvalues ±1 exist in terms of birth eigenspaces. Moreover, we prove that eigenvectors from the birth eigenspaces decay exponentially at spatial infinity and that the birth eigenspaces are robust against perturbations.

arXiv:1804.05127•Journal of Mathematical Physics•Aug 1, 2018•22 citations

Application of Segawa-Suzuki Spectral Mapping Theorem

Hong Ji, Caishi Wang, Nan Fan

In this paper, we consider a class of unitary operators associated with the evolution operators of the quantum walk .By using Segawa and Suzuki's spectral mapping theorem, we obtain their spectra.

International Journal of Engineering and Applied Sciences (IJEAS)•Jul 31, 2021•0 citations

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

Sho Kubota, Kei Saito, Yusuke Yoshie

arXiv:2103.05235•Quantum Information Processing•Apr 27, 2022•4 citations

Quantum walks on regular uniform hypergraphs

Ying Liu, Jiabin Yuan, Bojia Duan +1 more

Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs. In this paper, by presenting the one-to-one correspondence between regular uniform hypergraphs and bipartite graphs, we construct a model for quantum walks on bipartite graphs of regular uniform hypergraphs with Szegedy's quantum walks, which gives rise to a quadratic speed-up. Furthermore, we deliver spectral properties of the transition matrix, given that the cardinalities of the two disjoint sets are different in the bipartite graph. Our model provides the foundation for building quantum algorithms on the strength of quantum walks on hypergraphs, such as quantum walks search, quantized Google's PageRank, and quantum machine learning.

arXiv:1709.05015•Scientific Reports•Jun 18, 2018•18 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
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.
We revisit the Segawa--Suzuki spectral mapping theorem for abstract Szegedy-type quantum walks from a block-encoding viewpoint. Retaining both eigenspaces of the involution underlying the chiral symmetry yields a natural two-by-two block representation in which the usual discriminant operator and its counterpart form the diagonal blocks. The non-endpoint spectral mapping theorem then follows from an elementary Schur decomposition, substantially simplifying the original proof by avoiding its invariant-subspace decomposition and approximate-eigenvector arguments. The same framework establishes the result for the spectrum, point spectrum, and Fredholm essential spectrum and gives a direct block-theoretic description of the endpoint inherited and birth eigenspaces. We illustrate the construction with a one-dimensional split-step quantum walk.
For given two unitary and self-adjoint operators on a Hilbert space, a spectral mapping theorem was proved in the work of Higuchi et al. (e-print arXiv:1506.06457) [see also E. Segawa and A. Suzuki, Quantum Stud.: Math. Found. 3, 11 (2016)]. In this paper, as an application of the spectral mapping theorem, we investigate the spectrum of a one-dimensional split-step quantum walk. We give a criterion for when there are no eigenvalues around ±1 in terms of a discriminant operator. We also provide a criterion for when eigenvalues ±1 exist in terms of birth eigenspaces. Moreover, we prove that eigenvectors from the birth eigenspaces decay exponentially at spatial infinity and that the birth eigenspaces are robust against perturbations.
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs. In this paper, by presenting the one-to-one correspondence between regular uniform hypergraphs and bipartite graphs, we construct a model for quantum walks on bipartite graphs of regular uniform hypergraphs with Szegedy's quantum walks, which gives rise to a quadratic speed-up. Furthermore, we deliver spectral properties of the transition matrix, given that the cardinalities of the two disjoint sets are different in the bipartite graph. Our model provides the foundation for building quantum algorithms on the strength of quantum walks on hypergraphs, such as quantum walks search, quantized Google's PageRank, and quantum machine learning.
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.