arXiv · 1003.5426
Quantum Algorithms for the Jones Polynomial
Abstract
This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm. The present paper uses diagrammatic techniques to prove these results. The techniques of this paper have been used and will be used in the future in work with R. Marx, A. Fahmy, L. H. Kauffman, S. J. Lomonaco Jr.,A. Sporl, N. Pomplun, T. Schulte Herbruggen, J. M. Meyers, and S. J. Glaser on NMR quantum computation of the Jones polynomial.
Explore related subjects
Keep this discovery
Louis H. Kauffman, Samuel J. Lomonaco Jr. 2010-03-29. Quantum Algorithms for the Jones Polynomial. https://doi.org/10.1117/12.849753
Cite the original work for its findings. Save a collection to share your selection of sources.