Related papers: Subfactors from regular graphs induced by associat…
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…
Starting from an association scheme induced by a finite group and the corresponding Bose-Mesner algebra we construct quantum Markov chains (QMC), their entangled versions, and interacting Fock spaces (IFS) using the quantum probabilistic…
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 introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
Large scale complex systems, such as social networks, electrical power grid, database structure, consumption pattern or brain connectivity, are often modeled using network graphs. Valuable insight can be gained by measuring the similarity…
The anyonic quantum walk is a dynamical model describing a single anyon propagating along a chain of stationary anyons and interacting via mutual braiding statistics. We review the recent results on the effects of braiding statistics in…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
We start with the consideration of fusion rules of anyonic particles evolving on a 2D surface and the a hypergroup comes with it to construct entangled quantum Markov chains. The fusion rules induce an association scheme with Krein…
In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…
The one dimensional quantum walk of anyonic systems is presented. The anyonic walker performs braiding operations with stationary anyons of the same type ordered canonically on the line of the walk. Abelian as well as non-Abelian anyons are…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine quantum and classical reasoning, keeping a classical structure…
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…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…