Related papers: Uniform mixing in continuous-time quantum walks on…

We introduce a family of models for quantum mechanical, one-dimensional random walks, called quantum multibaker maps (QMB). These are Weyl quantizations of the classical multibaker models previously considered by Gaspard, Tasaki and others.…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…

It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…

We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show that a known bound for mixing time of a lazy walk on a Cayley…

In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…

This paper introduces and rigorously analyzes a new class of one-dimensional discrete-time quantum walks whose dynamics are governed by a parametrized family of extended CMV matrices. The model generalizes the unitary almost Mathieu…

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 discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…

Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…

Quantum walks of correlated particles offer the possibility to study large-scale quantum interference, simulate biological, chemical and physical systems, and a route to universal quantum computation. Here we demonstrate quantum walks of…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…

We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk,…

Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…