World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS

    https://doi.org/10.1142/S0219749908004092Cited by:1 (Source: Crossref)

    We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. The construction exploits the q-deformed spin network as computational background. The complexity of such algorithm is bounded above linearly by the number of crossings of the link, and polynomially by the number of link strands.