AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
2008 ◽
Vol 06
(supp01)
◽
pp. 773-778
◽
Keyword(s):
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.
2016 ◽
Vol 100
(3)
◽
pp. 303-337
◽
2008 ◽
Vol 17
(08)
◽
pp. 925-937
2007 ◽
Vol 16
(03)
◽
pp. 267-332
◽
2010 ◽
Vol 19
(11)
◽
pp. 1401-1421
◽
2005 ◽
Vol 14
(06)
◽
pp. 751-771
◽
2010 ◽
Vol 19
(12)
◽
pp. 1571-1595
◽
2017 ◽
Vol 26
(05)
◽
pp. 1750029
◽
Keyword(s):
2008 ◽
Vol 10
(supp01)
◽
pp. 815-834
◽
Keyword(s):