Related papers: A graph with fractional revival
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
Motivated by the existence of mobile low-energy excitations like domain walls in one dimension or gauge-charged fractionalized particles in higher dimensions, we compare quantum dynamics in the presence of weak Markovian dephasing for a…
We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of…
In this paper, we present a complete proof of the construction of graphs with bounded valency such that the simple random walk has a return probability at time $n$ at the origin of order $exp(-n^{\alpha}),$ for fixed $\alpha \in [0,1[$ and…
We describe a model for $m$ vertex reinforced interacting random walks on complete graphs with $d\geq 2$ vertices. The transition probability of a random walk to a given vertex depends exponentially on the proportion of visits made by all…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular and distance-transitive). The construction is valid for growing graphs and the interacting Fock space is…
We investigate a connection between a property of the distribution and a conserved quantity for the reversible cellular automaton derived from a discrete-time quantum walk in one dimension. As a corollary, we give a detailed information of…
We introduce an elementary quantum system consisting of a set of spins on a graph and a particle hopping between its nodes. The quantum state is build sequentially, applying a unitary transformation that couples neighboring spins and, at a…
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…
We investigate the trends of information backflow associated with the dynamics of a sub-part of a disordered spin-1/2 transverse field Heisenberg chain for different regimes of the Hamiltonian. Towards this aim, the decay profile of…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We study the thermodynamic phase diagram of a one-dimensional quantum spin chain subjected to both mean-field and nearest-neighbor interactions, and to a transverse magnetic field $h$. The purpose is to determine the effect of the quantum…
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shift, which makes it equivalent to Szegedy's quantum Markov…
We study synchronization of random one-dimensional linear maps for which the Lyapunov exponent can be calculated exactly. Certain aspects of the dynamics of these maps are explained using their relation with a random walk. We confirm that…