Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0606167

An efficient quantum algorithm for colored Jones polynomials

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

Published Jun 20, 2006• 7 citations
arXivHTMLPDF

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. Our construction is based on SU(2) Chern-Simons topological quantum field theory (and associated Wess-Zumino-Witten conformal field theory) and exploits the q-deformed spin network as computational background. As proved in (S. Garnerone, A. Marzuoli, M. Rasetti, quant-ph/0601169), the colored Jones polynomial can be evaluated in a number of elementary steps, bounded from above by a linear function of the number of crossings of the link, and polynomially bounded with respect to the number of link strands. Here we show that the Kaul unitary representation of colored oriented braids used there can be efficiently approximated on a standard quantum circuit.

DOI
10.48550/arxiv.quant-ph/0606167

Related papers

AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS

Mario Rasetti, Silvano Garnerone, Annalisa Marzuoli

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.

International Journal of Quantum Information•Jul 1, 2008•8 citations

Quantum geometry and quantum algorithms

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

Abstract. Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on the complete solution of Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The colored Jones polynomial is expressed as the expectation value of the evolution of the q-deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation. PACS numbers: 03.67.Lx, 02.10.Kn, 04.60.Kz, 04.60.NcQuantum geometry and quantum algorithms 2 1.

•Jul 28, 2006•16 citations

Quantum geometry and quantum algorithms

S Garnerone, A Marzuoli, M Rasetti

Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the coloured Jones polynomial. The construction is based on the complete solution of the Chern–Simons topological quantum field theory and its connection to Wess–Zumino–Witten conformal field theory. The coloured Jones polynomial is expressed as the expectation value of the evolution of the q -deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such an expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.

arXiv:quant-ph/0607203•Journal of Physics A Mathematical and Theoretical•Mar 7, 2007•19 citations

Quantum automata, braid group and link polynomials

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

The spin--network quantum simulator model, which essentially encodes the (quantum deformed) $SU(2)$ Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this combinatorial framework we implement families of finite--states and discrete--time quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are colored Jones polynomials. The automaton calculation of the polynomial of (the plat closure of) a link $L$ on $2N$ strands at any fixed root of unity is shown to be bounded from above by a linear function of the number of crossings of the link, on the one hand, and polynomially bounded in terms of the braid index $2N$, on the other. The growth rate of the time complexity function in terms of the integer $k$ appearing in the root of unity $q$ can be estimated to be (polynomially) bounded by resorting to the field theoretical background given by the Chern--Simons theory.

arXiv:quant-ph/0601169•Quantum Information and Computation•Jul 1, 2007•34 citations

A polynomial quantum algorithm for approximating the Jones polynomial

Dorit Aharonov, Vaughan F. R. Jones, Zeph A. Landau

The Jones polynomial, discovered in 1984 [18], is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten [32]) to be intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang [13, 14] provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e2π i/5, and moreover, that this problem is BQP-complete. Unfortunately, this important algorithm was never explicitly formulated. Moreover, the results in [13, 14] are heavily based on TQFT, which makes the algorithm essentially inaccessible to computer scientists.We provide an explicit and simple polynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e2π i/k, where the running time of the algorithm is polynomial in m,n and k. Our algorithm is based, rather than on TQFT, on well known mathematical results (specifically, the path model representation of the braid group and the uniqueness of the Markov trace for the Temperly Lieb algebra). By the results of [14], our algorithm solves a BQP complete problem.The algorithm we provide exhibits a structure which we hope is generalizable to other quantum algorithmic problems. Candidates of particular interest are the approximations of other downwards self-reducible P-hard problems, most notably, the Potts model.

ACM Symposium on Theory of Computing (STOC)•May 21, 2006•145 citations

Efficient quantum circuits for approximating the Jones polynomial

Yumi Nakajima A, Y. Kawano, Hiroshi Sekigawa

Freedman, Kitaev, and Wang proved the equivalence between quantum field theory and quantum computation, and consequently showed that the problem of approximating the Jones polynomial (a knot invariant) at the fifth root of unity is BQP-complete. Recently, Aharonov, Jones, and Landau proposed a concrete quantum algorithm, called the AJL algorithm, that approximates the Jones polynomial at the $k$th root of unity in polynomial time. In this paper, we propose a new method for implementing the AJL algorithm, which improves the performance from $O(mn\log^2k)$ to $O(mn)$. Here, $n$ is the number of strands, $m$ is the number of the crossings in a braid. Since, in the AJL algorithm, $m$ and $k$ are assumed to be given as polynomials in $n$, the difference in the performance between the original implementation and our design is significant if $k$ is a large-degree polynomial.

Quantum Information and Computation•May 1, 2008•1 citation
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. Our construction is based on SU(2) Chern-Simons topological quantum field theory (and associated Wess-Zumino-Witten conformal field theory) and exploits the q-deformed spin network as computational background. As proved in (S. Garnerone, A. Marzuoli, M. Rasetti, quant-ph/0601169), the colored Jones polynomial can be evaluated in a number of elementary steps, bounded from above by a linear function of the number of crossings of the link, and polynomially bounded with respect to the number of link strands. Here we show that the Kaul unitary representation of colored oriented braids used there can be efficiently approximated on a standard quantum circuit.
Abstract. Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on the complete solution of Chern-Simons topological quantum field theory and its connection to Wess-Zumino-Witten conformal field theory. The colored Jones polynomial is expressed as the expectation value of the evolution of the q-deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation. PACS numbers: 03.67.Lx, 02.10.Kn, 04.60.Kz, 04.60.NcQuantum geometry and quantum algorithms 2 1.
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the coloured Jones polynomial. The construction is based on the complete solution of the Chern–Simons topological quantum field theory and its connection to Wess–Zumino–Witten conformal field theory. The coloured Jones polynomial is expressed as the expectation value of the evolution of the q -deformed spin-network quantum automaton. A quantum circuit is constructed capable of simulating the automaton and hence of computing such an expectation value. The latter is efficiently approximated using a standard sampling procedure in quantum computation.
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2)SU(2)SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this combinatorial framework we implement families of finite--states and discrete--time quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are colored Jones polynomials. The automaton calculation of the polynomial of (the plat closure of) a link LLL on 2N2N2N strands at any fixed root of unity is shown to be bounded from above by a linear function of the number of crossings of the link, on the one hand, and polynomially bounded in terms of the braid index 2N2N2N, on the other. The growth rate of the time complexity function in terms of the integer kkk appearing in the root of unity qqq can be estimated to be (polynomially) bounded by resorting to the field theoretical background given by the Chern--Simons theory.
The Jones polynomial, discovered in 1984 [18], is an important knot invariant in topology. Among its many connections to various mathematical and physical areas, it is known (due to Witten [32]) to be intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang [13, 14] provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, e2π i/5, and moreover, that this problem is BQP-complete. Unfortunately, this important algorithm was never explicitly formulated. Moreover, the results in [13, 14] are heavily based on TQFT, which makes the algorithm essentially inaccessible to computer scientists.We provide an explicit and simple polynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e2π i/k, where the running time of the algorithm is polynomial in m,n and k. Our algorithm is based, rather than on TQFT, on well known mathematical results (specifically, the path model representation of the braid group and the uniqueness of the Markov trace for the Temperly Lieb algebra). By the results of [14], our algorithm solves a BQP complete problem.The algorithm we provide exhibits a structure which we hope is generalizable to other quantum algorithmic problems. Candidates of particular interest are the approximations of other downwards self-reducible P-hard problems, most notably, the Potts model.
Freedman, Kitaev, and Wang proved the equivalence between quantum field theory and quantum computation, and consequently showed that the problem of approximating the Jones polynomial (a knot invariant) at the fifth root of unity is BQP-complete. Recently, Aharonov, Jones, and Landau proposed a concrete quantum algorithm, called the AJL algorithm, that approximates the Jones polynomial at the kkkth root of unity in polynomial time. In this paper, we propose a new method for implementing the AJL algorithm, which improves the performance from O(mnlog⁡2k)O(mn\log^2k)O(mnlog2k) to O(mn)O(mn)O(mn). Here, nnn is the number of strands, mmm is the number of the crossings in a braid. Since, in the AJL algorithm, mmm and kkk are assumed to be given as polynomials in nnn, the difference in the performance between the original implementation and our design is significant if kkk is a large-degree polynomial.