Related papers: Open Quantum Random Walks and the Mean Hitting Tim…
In this work, we study open quantum random walks, as described by S. Attal et al. These objects are given in terms of completely positive maps acting on trace-class operators, leading to one of the simplest open quantum versions of the…
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks on Cay($Z_N,\{\pm1,\pm2\}$) was given by Y. Doi et al. [Discrete Applied Mathematics,313 (2022) 18-28]. Y. Doi et al. give a simple formula for…
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random…
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however,…
Quantum computers are susceptible to noises from the outside world. We investigate the effect of perturbation on the hitting time of a quantum walk and the stationary distribution prepared by a quantum walk based algorithm. The perturbation…
Random walk models, such as the trap model, continuous time random walks, and comb models exhibit weak ergodicity breaking, when the average waiting time is infinite. The open question is: what statistical mechanical theory replaces the…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
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 apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…
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…