Translator Disclaimer
Paper
16 April 2010 Quantum algorithms for the Jones polynomial
Author Affiliations +
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Louis H. Kauffman and Samuel J. Lomonaco Jr. "Quantum algorithms for the Jones polynomial", Proc. SPIE 7702, Quantum Information and Computation VIII, 770203 (16 April 2010); https://doi.org/10.1117/12.849753
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Spin networks and anyonic topological computing II
Proceedings of SPIE (April 25 2007)
A quantum manual for computing the Jones polynomial
Proceedings of SPIE (March 24 2008)
Quantum algorithms for colored Jones polynomials
Proceedings of SPIE (April 27 2009)
Quantum advantage without entanglement
Proceedings of SPIE (September 14 2005)

Back to Top