AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS-Reference-Cited by-同舟云学术

AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS

Published:2008-07 Issue:supp01 Volume:06 Page:773-778
ISSN:0219-7499
Container-title:International Journal of Quantum Information
language:en
Short-container-title:Int. J. Quantum Inform.

Author:

RASETTI MARIO¹²,GARNERONE SILVANO³,MARZUOLI ANNALISA⁴

Affiliation:

1. Dipartimento di Fisica, and Scuola di Dottorato, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy

2. ISI Foundation, Viale Settimio Severo 65, 10133 Torino, Italy

3. Université Pierre et Marie Curie — Paris VI, LPTHE CNRS 7589, 4 Place Jussieu, 75252 Paris Cedex 05, France

4. Dipartimento di Fisica Nucleare e Teorica, Università degli Studi di Pavia, and INFN, Sezione di Pavia, Via A. Bassi 6, 27100 Pavia, Italy

Abstract

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Physics and Astronomy (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219749908004092

Reference13 articles.

1. Quantum geometry and quantum algorithms

2. Spin network quantum simulator

3. Computing spin networks

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Estimating Turaev-Viro three-manifold invariants is universal for quantum computation;Physical Review A;2010-10-08