Related papers: Spectral analysis of three-state quantum walks wit…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with…
We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
In this paper, we consider periodicity for space-inhomogeneous quantum walks on the cycle. For isospectral coin cases, we propose a spectral analysis. Based on the analysis, we extend the result for periodicity for Hadamard walk to some…
We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the presence of decoherence. While continuum limits of two state…
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…
In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…
In this paper we study localized states in a monitored evolution on a finite graph and how they are distinguished from the delocalized states in terms of the transition probabilities and the mean transition times. Monitoring is performed by…
We establish the theory for pretty good state transfer in discrete-time quantum walks. For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph; more…
We study a quantum walker on a one-dimensional lattice with a single defect site characterized by a phase. The spread and localization of discrete-time quantum walks starting at the impurity site are affected by the appearance of bound…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant…
We consider a discrete-time 2-state quantum walk on the line. The state of the quantum walker evolves according to a rule which is determined by a coin-flip operator and a position-shift operator. In this paper we take a 3-periodic time…
Existence of the eigenvalues of the discrete-time quantum walks is deeply related to localization of the walks. We revealed the distributions of the eigenvalues given by the splitted generating function method (the SGF method) of the…
Discrete-time quantum walks are well-known for exhibiting localization, a quantum phenomenon where the walker remains at its initial location with high probability. In companion with a joint Letter, we introduce oscillatory localization,…
The time-evolution equation of a one-dimensional quantum walker is exactly mapped to the three-dimensional Weyl equation for a zero-mass particle with spin 1/2, in which each wave number k of walker's wave function is mapped to a point…