Related papers: On quantum symmetries of graphs

A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…

Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint…

Motivated by applications in background-independent quantum gravity, we discuss the quantization of labeled and unlabeled finite multigraphs with a maximum edge count. We provide a unified way to represent quantum multigraphs with labeled…

Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…

We present a general method to characterize the quantum correlations obtained after local measurements on multipartite systems. Sufficient conditions for a quantum system to be fully-nonlocal according to a given partition, as well as being…

In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…

A celebrated theorem due to R. Frucht states that, roughly speaking, each group is isomorphic to the symmetry group of some graph. By "symmetry group" the group of all graph automorphisms is meant. We provide an analogue of this result for…

Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…

We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…

Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…

We propose a novel method using a quantum annealer -- an analog quantum computer based on the principles of quantum adiabatic evolution -- to solve the Graph Isomorphism problem, in which one has to determine whether two graphs are…

We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…

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…

We define quantum automorphisms and isomorphisms of Hadamard matrices. We show that every Hadamard matrix of size $N\ge 4$ has quantum symmetries and that all Hadamard matrices of a fixed size are mutually quantum isomorphic. These results…

We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…

Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…

Let $G$ be a graph of order $n$ and let $k\in \{1,2,\ldots,n-1\}$. The $k$-token graph of $G$ is the graph, whose vertices are all the $k$-subsets of vertices of $G$, where two such $k$-sets are adjacent whenever their symmetric difference…