Quantum algorithms for the Jones polynomial

Louis Hirsch Kauffman, Samuel J. Lomonaco · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2010

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.

Read the paper · More papers on PaperTik