Related papers: Some examples of quantum graphs
We discuss the meaning of geometrical constructions associated to loop quantum gravity states on a graph. In particular, we discuss the "twisted geometries" and derive a simple relation between these and Regge geometries.
We define and study graphs associated to hexagon decompositions of surfaces by curves and arcs. One of the variants is shown to be quasi-isometric to the pants graph, whereas the other variant is quasi-isometric to (a Cayley graph of) the…
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…
The consistent histories approach to quantum mechanics is traditionally based on linearly ordered sequences of events. We extend the histories formalism to sets of events whose causal ordering is described by directed acyclic graphs. The…
In 2019, investigation of the so-called factor-invariant cubic graphs was initiated by Alspach, Khodadadpour and Kreher. For a cubic graph $\Gamma$ and a vertex-transitive subgroup $G$ of $\mathrm{Aut}(\Gamma)$, a $2$-factor $\mathcal{C}$…
We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.
In this paper, we numerically study quantum walks on two kinds of two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of graphs are typical two-dimensional topological graph. We study the crossing property of quantum…
We solve $\mathcal{N}=1$ supersymmetric $A_{2}$ type $U(N)\times U(N)$ matrix models obtained by deforming $\mathcal{N}=2$ with symmetric tree level superpotentials of any degree exactly in the planar limit. These theories can be…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
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…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
It is well known that correlations predicted by quantum mechanics cannot be explained by any classical (local-realistic) theory. The relative strength of quantum and classical correlations is usually studied in the context of Bell…
Quantum algebras (also called quantum groups) are deformed versions of the usual Lie algebras, to which they reduce when the deformation parameter q is set equal to unity. From the mathematical point of view they are Hopf algebras. Their…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
We describe quantum theories for massless (p,q)-forms living on Kaehler spaces. In particular we consider four different types of quantum theories: two types involve gauge symmetries and two types are simpler theories without gauge…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to…
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…
Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computation models, while annealing plays within a specific subset of…