Quantum algorithms for the Jones polynomial

Louis H. Kauffman; Samuel J. Lomonaco Jr.

doi:10.1117/12.849753

16 April 2010 Quantum algorithms for the Jones polynomial

Louis H. Kauffman, Samuel J. Lomonaco Jr.

Proceedings Volume 7702, Quantum Information and Computation VIII; 770203 (2010) https://doi.org/10.1117/12.849753
Event: SPIE Defense, Security, and Sensing, 2010, Orlando, Florida, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available