Related papers: Local unitary representations of the braid group a…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
Governed by locality, we explore a connection between unitary braid group representations associated to a unitary $R$-matrix and to a simple object in a unitary braided fusion category. Unitary $R$-matrices, namely unitary solutions to the…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
We review the q-deformed spin network approact to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods produce a concise proof…
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We give a simple topological construction of the Burau representations of the loop braid groups. There are four versions: defined either on the non-extended or extended loop braid groups, and in each case there is an unreduced and a reduced…
We review the q-deformed spin network approach to topological quantum field theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the…
The reduced Burau representation $V_n$ of the braid group $B_n$ is obtained from the action of $B_n$ on the homology of an infinite cyclic cover of the disc with $n$ punctures. The group homology $H_*(B_n;V_n)$ of braid groups with…
We give a formula of the colored Alexander invariant in terms of the homological representation of the braid groups which we call truncated Lawrence's representation. This formula generalizes the famous Burau representation formula of the…
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…
This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our…
We use the relation between the quantum su(2) R-matrix and the Burau representation of the braid group in order to study the structure of the colored Jones polynomial of links. We show that similarly to the case of a knot, the colored Jones…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…
The Burau representation of the braid group can be used to recover the Alexander polynomial of the closure of a braid. We define twisted Burau maps and use them to compute twisted Alexander polynomials.
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form exp(2$\pi$i/k). This description is given with two…
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum…