Related papers: A route to quantum computing through the theory of…
Motivated by the theory of Cuntz-Krieger algebras we define and study $ C^\ast $-algebras associated to directed quantum graphs. For classical graphs the $ C^\ast $-algebras obtained this way can be viewed as free analogues of Cuntz-Krieger…
Given a quantum graph $\mathcal{G}=(B,\psi,A)$, we define a C*-correspondence $E_\mathcal{G}$ over the noncommutative vertex C*-algebra $B$, called the quantum edge correspondence. For a classical graph $\mathcal{G}$, $E_\mathcal{G}$ is the…
Let $\mathcal{G}$ be a quantum graph without quantum sources and $E_\mathcal{G}$ be the quantum edge correspondence for $\mathcal{G}.$ Our main results include sufficient conditions for simplicity of the Cuntz-Pimsner algebra…
This paper is concerned with the structures introduced recently by the authors of the current paper concerning the multiplier Hopf $*$-graph algebras and also the Cuntz-Krieger algebras and their relations with the $C^*$-graph algebras, and…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
We provide inverse semigroup and groupoid models for the Toeplitz and Cuntz-Krieger algebras of finitely aligned higher-rank graphs. Using these models, we prove a uniqueness theorem for the Cuntz-Krieger algebra.
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
We generalise the theory of Cuntz-Krieger families and graph algebras to the class of finitely aligned $k$-graphs. This class contains in particular all row-finite $k$-graphs. The Cuntz-Krieger relations for non-row-finite $k$-graphs look…
Using a graph approach to quantum systems, we prove that descriptions of 3-dim Kochen-Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie lattices that we find in the literature are wrong. Correct lattices…
Categorical quantum mechanics (CQM) and the theory of quantum groups rely heavily on the use of structures that have both an algebraic and co-algebraic component, making them well-suited for manipulation using diagrammatic techniques.…
The usual crossed product construction which associates to the homeomorphism $T$ of the locally compact space $X$ the C$^*$-algebra $C^*(X,T)$ is extended to the case of a partial local homeomorphism $T$. For example, the Cuntz-Krieger…
We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
Adapting a recent work of Brannan et al., on extending graph $C^*$-algebras to Quantum graphs, we introduce "Quantum Quivers" as an analogue of quivers where the edge and vertex set has been replaced by a $C^*$-algebra and the maps between…
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…