Share Email Print

Proceedings Paper

Topological quantum computing and the Jones polynomial
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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 e2π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.

Paper Details

Date Published: 12 May 2006
PDF: 18 pages
Proc. SPIE 6244, Quantum Information and Computation IV, 62440Z (12 May 2006); doi: 10.1117/12.665361
Show Author Affiliations
Samuel J. Lomonaco Jr., Univ. of Maryland, Baltimore County (United States)
Louis H. Kauffman, Univ. of Illinois, Chicago (United States)

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

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?