Related papers: Categorical (Co)Limits of Quantum Graphs
We study C*-algebras associated to right LCM semigroups, that is, semigroups which are left cancellative and for which any two principal right ideals are either disjoint or intersect in another principal right ideal. If $P$ is such a…
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…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
Quantum graph neural networks offer a powerful paradigm for learning on graph-structured data, yet their explainability is complicated by measurement-induced stochasticity and the combinatorial nature of graph structure. In this paper, we…
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labelled graph $C^*$-algebra by taking a weakly left--resolving labelled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Motivated by string diagrammatic approach to undirected tracial quantum graphs by Musto, Reutter, Verdon (2018), in the former part of this paper we diagrammatically formulate directed nontracial quantum graphs by Brannan, Chirvasitu,…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…
Given a quantum graph $ \Gamma $, a finite symmetry group $ G $ acting on it and a representation $ R $ of $ G $, the quotient quantum graph $ \Gamma /R $ is described and constructed in the literature [1, 2, 18]. In particular, it was…
The problem of introducing a dependence of elements of quantum group on classical parameters is considered. It is suggested to interpret a homomorphism from the algebra of functions on quantum group to the algebra of sections of a sheaf of…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
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 give a criterion that is sufficient for controllability of multipartite quantum systems. We generalize the graph infection criterion to the quantum systems that cannot be described with the use of a graph theory. We introduce the…
It is natural to consider a quantum system in the continuum limit of space-time configuration. Incorporating also, Einstein's special relativity, leads to the quantum theory of fields. Non-relativistic quantum mechanics and classical…
We establish a description of the maximal C*-algebra of quotients of a unital C*-algebra $A$ as a direct limit of spaces of completely bounded bimodule homomorphisms from certain operator submodules of the Haagerup tensor product…
We describe proper actors from the underlying groupoid of a graph C*-algebra to another \'etale groupoid in terms of bisections. This allows to understand graph morphisms and the *-homomorphisms that they induce more conceptually. More…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
By using highly entangled states, quantum metrology guarantees precision impossible with classical measurements. Unfortunately such states can be very susceptible to noise, and it is a great challenge of the field to maintain quantum…