Topological quantum computing and the Jones polynomial

Samuel J. Lomonaco Jr.; Louis H. Kauffman

doi:10.1117/12.665361

12 May 2006 Topological quantum computing and the Jones polynomial

Samuel J. Lomonaco Jr., Louis H. Kauffman

Proceedings Volume 6244, Quantum Information and Computation IV; 62440Z (2006) https://doi.org/10.1117/12.665361
Event: Defense and Security Symposium, 2006, Orlando (Kissimmee), Florida, United States

Abstract

In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form e^2πi/k. This description is given with two objectives in mind. The first is to describe the algorithm in such a way as to make explicit the underlying and inherent control structure. The second is to make this algorithm accessible to a larger audience.

Citation Download Citation

Samuel J. Lomonaco Jr. and Louis H. Kauffman "Topological quantum computing and the Jones polynomial", Proc. SPIE 6244, Quantum Information and Computation IV, 62440Z (12 May 2006); https://doi.org/10.1117/12.665361

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