We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and Jones polynomial and their application to anyonic quantum computation. Finally we outline the approximation of the Jones polynomial by a quantum computer and explicit localizations of braid group representations
Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and ...
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and L...
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these m...
We analyze relationships between the Jones polynomial and quantum computation. Our first result is a...
We analyze relationships between quantum computation and a family of generalizations of the Jones po...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
We describe a combinatorial framework for topological quantum computation, and illustrate a number ...
We describe a combinatorial framework for topological quantum computation, and illustrate a number ...
It is one of the challenging problems to construct an efficient quantum algorithm which can compute ...
This paper is dedicated to new progress in the relationship of topology and quantum physics. Abstrac...
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topolog...
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Ra...
A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary rep...
Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and ...
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and L...
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these m...
We analyze relationships between the Jones polynomial and quantum computation. Our first result is a...
We analyze relationships between quantum computation and a family of generalizations of the Jones po...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
analyze relationships between quantum computation and a family of generalizations of the Jones polyn...
We describe a combinatorial framework for topological quantum computation, and illustrate a number ...
We describe a combinatorial framework for topological quantum computation, and illustrate a number ...
It is one of the challenging problems to construct an efficient quantum algorithm which can compute ...
This paper is dedicated to new progress in the relationship of topology and quantum physics. Abstrac...
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topolog...
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Ra...
A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary rep...
Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and ...
In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and L...
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these m...