Translator Disclaimer
12 May 2006 Topological quantum computing and the Jones polynomial
Author Affiliations +
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
18 PAGES


SHARE
Advertisement
Advertisement
Back to Top