Related papers: Partition-based discrete-time quantum walks
We analyze the properties of a two and three dimensional quantum walk that are inspired by the idea of a brane-world model put forward by Rubakov and Shaposhnikov [1]. In that model, particles are dynamically confined on the brane due to…
Discrete-time quantum walks can be regarded as quantum dynamical simulators since they can simulate spatially discretized Schr\"{o}dinger, massive Dirac, and Klein-Gordon equations. Here, two different types of Fibonacci discrete-time…
The time evolutions of discrete-time quantum walks on graphs are determined by the local adjacency relations of the graphs. In this paper, first, we construct a discrete-time quantum walk model that reflects the embedding on the surface so…
Consider two ancestral lineages sampled from a system of two-dimensional branching random walks with logistic regulation in the stationary regime. We study the asymptotics of their coalescence time for large initial separation and find that…
Szegedy's quantization of a reversible Markov chain provides a quantum walk whose spectral gap is quadratically larger than that of the classical walk. Quantum computers are therefore expected to provide a speedup of Metropolis-Hastings…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
The Grover walk, which is related to the Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is striking…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and…
In this paper, we consider an extended coined Szegedy model and discuss the existence of the point spectrum of induced quantum walks in terms of recurrence properties of the underlying birth and death process. We obtain that if the…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
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…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
We study a discrete-time quantum walk (QW) on the line with a single phase at the origin which was introduced and studied by Wojcik et al.[1]. We call the model "Wojcik model" here. Konno et al.[2] investigated other types of QWs with one…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
We consider a decentralized learning setting in which data is distributed over nodes in a graph. The goal is to learn a global model on the distributed data without involving any central entity that needs to be trusted. While gossip-based…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…