Quantum Algorithms for the Jones Polynomial
نویسندگان
چکیده
This paper gives a generalization of the AJL algorithm for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle for the Jones parameter. We show that the Kauffman-Lomonaco 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm.
منابع مشابه
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
We analyze relationships between the Jones polynomial and quantum computation. First, we present two polynomial-time quantum algorithms which give additive approximations of the Jones polynomial, in the sense of Bordewich, Freedman, Lovász and Welsh, of any link obtained from a certain general family of closures of braids, evaluated at any primitive root of unity. This family encompasses the we...
متن کاملThe BQP-hardness of approximating the Jones Polynomial
Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficient quantum algorithm for approximating the Jones polynomial of the plat closure of a braid, at the kth root of unity, for constant k. The universality proof of Freedman, Larsen and Wang [2] implies that the problem which these algorithms solve is BQP-hard. The fact that this ...
متن کاملQuantum Knitting
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of ‘knot invariants’, among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of c...
متن کاملTopological Quantum Information Theory
This paper is an introduction to relationships between quantum topology and quantum computing. In this paper we discuss unitary solutions to the Yang-Baxter equation that are universal quantum gates, quantum entanglement and topological entanglement, and we give an exposition of knottheoretic recoupling theory, its relationship with topological quantum field theory and apply these methods to pr...
متن کاملA Permanent Formula for the Jones Polynomial
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a planar diagram of a link L with n crossings, we define a 7n× 7n matrix whose permanent equals to the Jones polynomial of L. This result accompanied with recent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010