Related papers: Non-abelian anyons on graphs from presentations of…
A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
We discuss how to construct models of interacting anyons by generalizing quantum spin Hamiltonians to anyonic degrees of freedom. The simplest interactions energetically favor pairs of anyons to fuse into the trivial ("identity") channel,…
The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is desirable to…
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with…
In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…
Using the formalism of discrete quantum group gauge theory, one can construct the quantum algebras of observables for the Hamiltonian Chern-Simons model. The resulting moduli algebras provide quantizations of the algebra of functions on the…
We discuss the connection between anyons (particles with fractional statistics) and deformed Lie algebras (quantum groups). After a brief review of the main properties of anyons, we present the details of the anyonic realization of all…
We investigate braid group representations associated with unitary braided vector spaces, focusing on a conjecture that such representations should have virtually abelian images in general and finite image provided the braiding has finite…
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…
We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion.…
We consider the task of representing signals supported on graph bundles, which are generalizations of product graphs that allow for "twists" in the product structure. Leveraging the localized product structure of a graph bundle, we…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…
Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
We show that the holonomy of a connection defined on a principal composite bundle is related by a non-abelian Stokes theorem to the composition of the holonomies associated with the connections of the component bundles of the composite. We…
We consider the problem of learning a graph from a finite set of noisy graph signal observations, the goal of which is to find a smooth representation of the graph signal. Such a problem is motivated by the desire to infer relational…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…