We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new class of coined quantum walk by a special choice of quantum coins determined by corresponding quantum graph, called quantum graph walk. We show that a stationary state of quantum graph walk describes the eigenfunction of the quantum graph.
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$.
Given two Hilbert spaces, $\mathcal{H}$ and $\mathcal{K}$, we introduce an abstract unitary operator $U$ on $\mathcal{H}$ and its discriminant $T$ on $\mathcal{K}$ induced by a coisometry from $\mathcal{H}$ to $\mathcal{K}$ and a unitary involution on $\mathcal{H}$. In a particular case, these operators $U$ and $T$ become the evolution operator of the Szegedy walk on a graph, possibly infinite, and the transition probability operator thereon. We show the spectral mapping theorem between $U$ and $T$ via the Joukowsky transform. Using this result, we have completely detemined the spectrum of the…
This paper continues the previous work (Quantum Inf. Process (2019)) by two authors of the present paper about a spectral mapping property of chiral symmetric unitary operators. In physics, they treat non-unitary time-evolution operators to consider quantum walks in open systems. In this paper, we generalize the above result to include a chiral symmetric non-unitary operator whose coin operator only has two eigenvalues. As a result, the spectra of such non-unitary operators are included in the (possibly non-unit) circle and the real axis in the complex plane. We also give some examples of our …
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk entropies are strongly related to the walk regularity of graphs and line-graphs. They are not biased by the graph size and have significantly better correlation with the inverse participation ratio of the eigenmodes of the adjacency matrix than other graph entropies. The temperature dependence of the walk entropies is also discussed. In particular, the walk entropy …
We connect the Grover walk with sinks to the Grover walk with tails. The survival probability of the Grover walk with sinks in the long time limit is characterized by the centered generalized eigenspace of the Grover walk with tails. The centered eigenspace of the Grover walk is the attractor eigenspace of the Grover walk with sinks. It is described by the persistent eigenspace of the underlying random walk whose support has no overlap to the boundaries of the graph and combinatorial flow in the graph theory.
In this paper, we consider the quantum walk on $\mathbb{Z}$ with attachment of one-length path periodically. This small modification to $\mathbb{Z}$ provides localization of the quantum walk. The eigenspace causing this localization is generated by finite length round trip paths. We find that the localization is due to the eigenvalues of an underlying random walk. Moreover we find that the transience of the underlying random walk provides a slow down of the pseudo velocity of the induced quantum walk and a different limit distribution from the Konno distribution.
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues of a quaternionic matrix and a notable property derived from the unitarity condition for the quaternionic quantum walk. Our main results determine all the right eigenvalues of the quaternionic quantum walk by using complex eigenvalues of the quaternionic weighted matrix which is easily derivable from the walk. Since our derivation is owing to a quaternionic …
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph Laplacians. As a result, we search for the most appropriate analytical structure on graphs endowed with fixed topologies yielding better search outcomes. We discuss strategies to investigate the optimality of Grover's algorithm and provide a…
Recently, the staggered quantum walk (SQW) on a graph is discussed as a generalization of coined quantum walks on graphs and Szegedy walks. We present a formula for the time evolution matrix of a 2-tessellable SQW on a graph, and so directly give its spectra. Furthermore, we present a formula for the Szegedy matrix of a bipartite graph by the same method, and so give its spectra. As an application, we present a formula for the characteristic polynomial of the modified Szegedy matrix in the quantum search problem on a graph, and give its spectra.
We investigate the local (or occupation) time of a discrete-time random walk on a generic graph, and present a general method for calculating sample-path averages of local time functionals in terms of the resolvent of the transition matrix.
We give a new determinant expression for the characteristic polynomial of the bond scattering matrix of a quantum graph G. Also, we give a decomposition formula for the characteristic polynomial of the bond scattering matrix of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express the characteristic polynomial of the bond scattering matrix of a regular covering of G by means of its L-functions. As an application, we introduce three types of quantum graph walks, and treat their relation.
The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of walks and giving orientation to a finite graph, one can easily count the number of the total signs of each kind of walk from one element to another of a fixed length.
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
For given two unitary and self-adjoint operators on a Hilbert space, a spectral mapping theorem was proved in \cite{HiSeSu}. 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 is no eigenvalues around $\pm 1$ in terms of a discriminant operator. We also provide a criterion for when eigenvalues $\pm 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 a…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the simplest finite graph: the complete graph. We make the elementary observation that the susceptibility of the self-avoiding walk on the complete graph is given exactly in terms of the incomplete gamma function. The known asymptotic behaviour of the incomplete gamma function then yields a complete description of the finite-size scaling of the self-avoiding walk on…
We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of propagation of narrow wave packets on metric graphs.
