Year: 2001
Type: preprint
Abstract: 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 unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.
Source: arXiv (Cornell University)
Author: Kauffman, Louis H.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4394671176