Related papers: Categorical (Co)Limits of Quantum Graphs
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
In this survey, we discuss the description of Vaksman-Soibelman quantum spheres using graph C*-algebras, following the seminal work of Hong and Szyma\'nski. We give a slightly different proof of the isomorphism with a graph C*-algebra,…
In this paper, we propose a new way to represent graphs in quantum space. In that approach, we replace the rows of the adjacency matrix of the graph by state vectors in the occupation number representation. Unlike the traditional definition…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
Quantum graphity is a background independent model for emergent geometry, in which space is represented as a complete graph. The high-energy pre-geometric starting point of the model is usually considered to be the complete graph, however…
The notion of a quantum family of maps has been introduced in the framework of C*-algebras. As in the classical case, one may consider a quantum family of maps preserving additional structures (e.g. quantum family of maps preserving a…
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…
Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
We discuss the notion about physical quantities as having values represented by real numbers, and its limiting to describe nature to be understood in relation to our appreciation that the quantum theory is a better theory of natural…
We introduce the Hierarchical Unified Graph Representation (HUGR): a novel graph based intermediate representation for mixed quantum-classical programs. HUGR's design features high expressivity and extensibility to capture the capabilities…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a "quantum-classical game"--that is, a non-local game of two…