Related papers: A route to quantum computing through the theory of…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
Higher rank semigraph algebras are introduced by mixing concepts of ultragraph algebras and higher rank graph algebras. This yields a kind of higher rank generalisation of ultragraph algebras. We prove Cuntz--Krieger uniqueness theorems for…
For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
Let $\mathcal{G}$ be an ultragraph and let $C^*(\mathcal{G})$ be the associated $C^*$-algebra introduced by Mark Tomforde. For any gauge invariant ideal $I_{(H,B)}$ of $C^*(\mathcal{G})$, we analyze the structure of the quotient…
Quantum spheres are among the most studied examples of compact quantum spaces, described by C*-algebras which are Cuntz-Krieger algebras of a directed graph, as proved by Hong and Szyma\'nski in 2002. About five years earlier, in 1997, Sheu…
In this paper we describe a new method of defining C*-algebras from oriented combinatorial data, thereby generalizing the constructions of algebras from directed graphs, higher-rank graphs, and ordered groups. We show that only the most…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
Mathematical tools related to coherence theory and classical-quantum equivalence, due to Wigner and Glauber, are essential to modern, practical and empirical understanding of electromagnetics in areas like quantum optics and…
Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…
We describe a graphical calculus for completely positive maps and in doing so review the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks. In particular we…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
To each graph without loops and multiple edges we assign a family of rings. Categories of projective modules over these rings categorify $U^-_q(\mathfrak{g})$, where $\mathfrak{g}$ is the Kac-Moody Lie algebra associated with the graph.
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…
This paper introduces an efficient quantum computing method for reducing special graphs in the context of the graph coloring problem. The special graphs considered include both symmetric and non-symmetric graphs where the axis passes…
Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…
For a directed graph $E$, we compute the $K$-theory of the $C^*$-algebra $C^*(E)$ from the Cuntz-Krieger generators and relations. First we compute the $K$-theory of the crossed product $C^*(E)\times_\gamma\IT$, and then using duality and…
We define a new mathematical structure ( graph quantum group) which combines the tower of algebras associated with a graph ${\cal G}$ and the structure of a Hopf algebra {\cal A}. In this structure Ocneanu's string operators become Hopf…