Related papers: From quantum master equation to random walk
A perturbative quantum master equation is derived for a system interacting with its environment, which is more general than the ones derived before. Our master equation takes into account the effect of the energy exchanges between the…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
A new model maps a quantum random walk described by a Hadamard operator to a particular case of a birth and death process. The model is represented by a 2D Markov chain with a stochastic matrix, i.e., all the transition rates are positive,…
The generalized master equation or the equivalent continuous time random walk equations can be used to compute the macroscopic first passage time distribution (FPTD) of a complex stochastic system from short-term microscopic simulation…
A continuous-time quantum walk (CTQW) is sedentary if the return probability in the starting vertex is close to one at all times. Recent results imply that, when starting from a maximal degree vertex, the CTQW dynamics generated by the…
In the present paper, we construct QMCs associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution…
We present a detailed analysis of continuous time quantum walks (CTQW) with both position and transition defects defined at a single point in the line. Analytical solutions of both traveling waves or bound states are obtained, which provide…
In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…
We examine a new path transform on 1-dimensional simple random walks and Brownian motion, the quantile transform. This transformation relates to identities in fluctuation theory due to Wendel, Port, Dassios and others, and to discrete and…
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. The quantum Markov chain, like the classical Markov chain, is a fundamental tool for the investigation of the basic properties such…
Based on the Langevin description of the Continuous Time Random Walk (CTRW), we consider a generalization of CTRW in which the waiting times between the subsequent jumps are correlated. We discuss the cases of exponential and slowly…
We consider a model of open quantum random walk and together with a quantum trajectory approach we are able to examine a notion of hitting time. We see that many constructions, such as minimal solutions to hitting time problems, are…
Non-Markovian quantum effects are typically observed in systems interacting with structured reservoirs. Discrete-time quantum walks are prime example of such systems in which, quantum memory arises due to the controlled interaction between…
The continuous time random walks (CTRWs) are typically defned in the way that their trajectories are discontinuous step fuctions. This may be a unwellcome feature from the point of view of application of theese processes to model certain…
We consider a discrete-time random walk where the random increment at time step $t$ depends on the full history of the process. We calculate exactly the mean and variance of the position and discuss its dependence on the initial condition…
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…
We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weightings for the numbers of steps of the quantum walk. This…