Related papers: From quantum master equation to random walk
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
Exact and nonperturbative quantum master equation can be constructed via the calculus on path integral. It results in hierarchical equations of motion for the reduced density operator. Involved are also a set of well--defined auxiliary…
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…
We study discrete-time quantum walks on a half line by means of spectral analysis. Cantero et al. [1] showed that the CMV matrix, which gives a recurrence relation for the orthogonal Laurent polynomials on the unit circle [2], expresses the…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…
Motivated by studies on the recurrent properties of animal and human mobility, we introduce a path-dependent random walk model with long range memory for which not only the mean square displacement (MSD) can be obtained exactly in the…
We consider quantum random walks (QRW) on the integers, a subject that has been considered in the last few years in the framework of quantum computation. We show how the theory of CMV matrices gives a natural tool to study these processes…
In this issue we demonstrate the very inspiring role of the continuous-time random walk (CTRW) formalism and its numerous modifications thanks to their flexibility and various applications as well its promising perspectives in different…
An intense research on financial market microstructure is presently in progress. Continuous time random walks (CTRWs) are general models capable to capture the small-scale properties that high frequency data series show. The use of CTRW…
We characterize the pointer states generated by the master equation of quantum Brownian motion and derive stochastic equations for the dynamics of their trajectories in phase space. Our method is based on a Poissonian unraveling of the…
Quantum walks are not only algorithmic tools for quantum computation but also not trivial models which describe various physical processes. The paper compares one-dimensional version of the free particle Dirac equation with discrete time…
We consider crossovers with respect to the weak convergence theorems from a discrete-time quantum walk (DTQW). We show that a continuous-time quantum walk (CTQW) and discrete- and continuous-time random walks can be expressed as DTQWs in…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
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…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
In this paper, we introduce the elephant random walk (ERW) with memory consisting of randomly selected steps from its history. It is a time-changed variant of the standard elephant random walk with memory consisting of its full history. At…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
How fast a state of a system converges to a stationary state is one of the fundamental questions in science. Some Markov chains and random walks on finite groups are known to exhibit the non-asymptotic convergence to a stationary…
We study financial distributions within the framework of the continuous time random walk (CTRW). We review earlier approaches and present new results related to overnight effects as well as the generalization of the formalism which embodies…