Share Email Print

Proceedings Paper

Quantum algorithms for the Jones polynomial
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 16 April 2010
PDF: 11 pages
Proc. SPIE 7702, Quantum Information and Computation VIII, 770203 (16 April 2010); doi: 10.1117/12.849753
Show Author Affiliations
Louis H. Kauffman, Univ. of Illinois at Chicago (United States)
Samuel J. Lomonaco, Univ. of Maryland, Baltimore County (United States)

Published in SPIE Proceedings Vol. 7702:
Quantum Information and Computation VIII
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top