Related papers: Generalized open quantum walks on Apollonian netwo…
We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…
Dynamical phase transitions in the relaxation behavior of stochastic quantum walks are investigated, focusing on systems where coherent unitary evolution is periodically interrupted by dephasing. This interplay leads to a classicalization…
In this paper we address the problem of the calculation of the mean first passage time (MFPT) on generic graphs. We focus in particular on the mean first passage time on a node 's' for a random walker starting from a generic, unknown, node…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
In this Chapter, we present some interesting properties of quantum walks on the line. We concentrate our attention in the emergence of invariance and provide some insights into the ultimate origin of the observed behavior. In the first part…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
We study the problem of site recurrence of discrete time nearest neighbor open quantum random walks (OQWs) on the integer line, proving basic properties and some of its relations with the corresponding problem for unitary (coined) quantum…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
We propose an intermediate walk continuously connecting an open quantum random walk and a quantum walk with parameters $M\in \mathbb{N}$ controlling a decoherence effect; if $M=1$, the walk coincides with an open quantum random walk, while…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
This paper presents a new approach to phase space trajectories in quantum mechanics. A Moyal description of quantum theory is used, where observables and states are treated as classical functions on a classical phase space. A quantum…
The inherent properties of specific physical systems can be used as metaphors for investigation of the behavior of complex networks. This insight has already been put into practice in previous work, e.g., studying the network evolution in…
We introduce quantum walks on Cayley graphs of non-Abelian groups. We focus on the easiest case of virtually Abelian groups, and introduce a technique to reduce the quantum walk to an equivalent one on an Abelian group with coin system…
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…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking…