Related papers: Open Quantum Random Walks and Quantum Markov chain…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the…
We study Open Quantum Random Walks for which the underlying graph is a lattice, and the generators of the walk are translation-invariant. We consider the quantum trajectory associated with the OQRW, which is described by a position process…
We characterize the spectrum of the transition matrix for simple random walk on graphs consisting of a finite graph with a finite number of infinite Cayley trees attached. We show that there is a continuous spectrum identical to that for a…
Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent…
In this paper, we consider a spectral analysis of the Correlated Random Walk (CRW) on the path. We apply an analytical method for the Quantum Walk to CRW. For the isospectral coin cases, we obtain all of the eigenvalues and the…
The concept of open quantum walks (OQW), quantum walks exclusively driven by the interaction with the external environment, is reviewed. OQWs are formulated as discrete completely positive maps on graphs. The basic properties of OQWs are…
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
In this paper, we define a new type of decoherent quantum random walks with parameter $0\le p\le 1$, which becomes a unitary quantum random walk (UQRW) when $p=0$ and an open quantum random walk (OPRW) when $p=1$ respectively. We call this…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
We lay the foundation for a quantum algorithmic framework to analyse fixed-structure chemical reaction networks (CRNs) using quantum random walks (QRWs) via electrical circuit theory. We model perturbations to CRNs, such as, species…
The main aim of the present paper is to establish the existence of a phase transition for the quantum Ising model with competing XY interactions within the quantum Markov chain (QMC) scheme. In this scheme, we employ the $C^*$-algebraic…
In the present paper, we construct quantum Markov chains (QMC) over the Comb graphs. As an application of this construction, it is proved the existence of the disordered phase for the Ising type models (within QMC scheme) over the Comb…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…
A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of…