The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define discrete-time quantum walks on arbitrary oriented graphs by partitioning a graph into tessellations, which is a collection of disjoint cliques that cover the vertex set. By using the adjacency matrices associated with the tessellations, we define local unitary operators, whose product is the evolution operator of our quantum walk model. We introduce a parameter, called alpha, that quantifies the amount of orientation. We show that the parameter alpha can be tuned in order to increase the amount of quantum walk-based transport on oriented graphs.
A discrete-time staggered quantum walk was recently introduced as a generalization that allows the unification of other versions, such as the coined and Szegedy's walk. However, it also produces forms of quantum walks not covered by previous versions. To explore their properties, we study here the staggered walk on a hexagonal lattice. Such a walk is defined using a set of overlapping tessellations that cover the graph edges, and each tessellation is a partition of the node set into cliques. The hexagonal lattice requires at least three tessellations. Each tessellation is associated with a local unitary operator and the product of the local operators defines the evolution operator of the staggered walk on the graph. After defining the evolution operator on the hexagonal lattice, we analyze the quantum walk dynamics with the focus on the position standard deviation and localization. We also obtain analytic results for the time complexity of spatial search algorithms with one marked node using cyclic boundary conditions.
Due to recent technological advances, quantum computing has gained notoriety. In this paradigm, the concept of quantum walk is fundamental for the development of algorithms for quantum computers. Among the existing quantum walk models, the staggered model, proposed by Portugal et al. stands out, since it includes the Szegedy model as a particular case, and part of the coined model. The staggered model uses the concept of tessellations on graphs to generate the quantum evolution operators that perform the walker's movements on the graph. Tessellations on graphs also have an interesting value for graph theory, since the parameter \textit{tessellation cover number}
T(G) is related to several other parameters present in the literature such as \textit{chromatic number}, \textit{chromatic index}, \textit{total chromatic number}, \textit{independent set number}, and \textit{clique number}. In addition, problems related to
T(G), such as \textsc{
t-tessellability}, \textsc{good tesellable recognition}, and \textsc{total good tessellable recognition} have deep relations with classic problems in graph theory involving graph coloring. In this work we present results in graph theory for the problems related to tessellations on graphs mentioned above, such as computational complexity, lower and upper bounds for
T(G), and the value of
T(G) for several graph classes. Furthermore, we present a quantum walk model based on \textit{total tessellation cover}, being pioneer in the use of vertices and edges as possible locations for the walker, simultaneously.
In this paper, we consider a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the graph’s edges, where a scattering process at the vertices is governed by the scattering matrices assigned to each vertex. We show the Scattering Quantum Walks encompass several known Quantum Walks. We further introduce two classes of Scattering Open Quantum Walks on arbitrary graphs, also parameterized by scattering matrices: one defined on the edges, the other on the vertices of the graph. We show these walks give rise to proper quantum channels and describe their main spectral and dynamical properties, relating them to naturally associated classical Markov chains.
A new approach to quantum walks is presented. Considering a quantum system undergoing some unitary discrete-time evolution in a directed graph G, we think of the vertices of G as sites that are occupied by the quantum system, whose internal state is described by density operators. To formulate the unitary evolution, we define reflections in the tensor product of an internal Hilbert space and a spatial Hilbert space. We then construct unitary channels that govern the evolution of the system in the graph. The discrete dynamics of the system (called quantum walks) is obtained by iterating the unitary channel on the density operator of the quantum system. It turns out that in this framework, the action of the unitary channel on a density operator is described by the usual matrix multiplication.
This article presents a new quantum PageRank algorithm on graphs using discrete-time open quantum walks. Google's PageRank is a widely used algorithm for ranking the web pages on the world wide web in classical computation. From a broader perspective, it is also a fundamental measure for quantifying the importance of vertices in a network. Similarly, the new quantum PageRank also serves to quantify the significance of a network's vertices. In this work, we extend the concept of discrete-time open quantum walk on arbitrary directed and undirected graphs by utilizing the Weyl operators as Kraus operators. This new model of quantum walk is useful for building up the quantum PageRank algorithm, discussed in this article. We compare the classical PageRank and the newly defined quantum PageRank for different types of complex networks, such as the scale-free network, Erdős-Rényi random network, Watts-Strogatz network, spatial network, Zachary Karate club network, GNC, GN, GNR networks, Barabási and Albert network, etc. In addition, we study the convergence of the quantum PageRank process and its dependency on the damping factor α. We observe that this quantum PageRank procedure is faster than many other proposals reported in the literature.
We present an alternative definition of discrete-time coined quantum walks convenient for capturing a rather broad spectrum of a walker's behavior on arbitrary graphs. It includes and covers both the geometry of possible walker's positions with interconnecting links and the prescribed rule in which directions the walker will move at each vertex. While the former allows for the analysis of inhomogeneous quantum walks on graphs with vertices of varying degree, the latter offers us to choose, investigate, and compare quantum walks with different shift operators. The synthesis of both key ingredients constitutes a well-suited playground for analyzing percolated quantum walks on a quite general class of graphs. Analytical treatment of the asymptotic behavior of percolated quantum walks is presented and worked out in details for the Grover walk on graphs with maximal degree 3. We find that for these walks with cyclic shift operators, the existence of an edge-3 coloring of the graph allows for nonstationary asymptotic behavior of the walk. For different shift operators, the general structure of localized attractors is investigated, which determines the overall efficiency of a source-to-sink quantum transport across a dynamically changing medium. As a simple nontrivial example of the theory, we treat a single-excitation transport on a percolated cube.