ﻻ يوجد ملخص باللغة العربية
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 consider the discrete-time quantum walk whose local dynamics is denoted by $C$ at the perturbed region ${0,1,dots,M-1}$ and free at the other positions. We obtain the stationary state with a bounded initial state. The initial state is set so that
The spectrum of a semi-infinite quantum graph tube with square period cells is analyzed. The structure is obtained by rolling up a doubly periodic quantum graph into a tube along a period vector and then retaining only a semi-infinite half of the tub
Max-plus algebra is a kind of idempotent semiring over $mathbb{R}_{max}:=mathbb{R}cup{-infty}$ with two operations $oplus := max$ and $otimes := +$.In this paper, we introduce a new model of a walk on one dimensional lattice on $mathbb{Z}$, as an ana
Birkhoffs theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices. Unitary matr
In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk (SSRW) only wh