AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
From MaRDI portal
Publication:3528503
DOI10.1142/S0219749908004092zbMATH Open1145.81341arXivquant-ph/0606167MaRDI QIDQ3528503FDOQ3528503
Authors: Silvano Garnerone, Annalisa Marzuoli, M. Rasetti 
Publication date: 17 October 2008
Published in: International Journal of Quantum Information (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0606167
Recommendations
- A polynomial quantum algorithm for approximating the Jones polynomial
- A polynomial quantum algorithm for approximating the Jones polynomial
- Quantum geometry and quantum algorithms
- The Jones polynomial: quantum algorithms and applications in quantum complexity theory
- Unitary representations of the Artin braid groups and quantum algorithms for colored Jones polynomials and the Witten-Reshetikhin invariant
Cites Work
- Hecke algebra representations of braid groups and link polynomials
- Quantum field theory and the Jones polynomial
- Computing spin networks
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Quantum invariants of knots and 3-manifolds
- Chern-Simons theory, coloured-oriented braids and link invariants
- Efficient discrete approximations of quantum gates
- Quantum geometry and quantum algorithms
- Approximate Counting and Quantum Computation
- Spin network quantum simulator
Cited In (6)
- Title not available (Why is that?)
- Quantum geometry and quantum algorithms
- Efficient quantum circuits for approximating the Jones polynomial
- A polynomial quantum algorithm for approximating the Jones polynomial
- Unitary representations of the Artin braid groups and quantum algorithms for colored Jones polynomials and the Witten-Reshetikhin invariant
- A polynomial quantum algorithm for approximating the Jones polynomial
This page was built for publication: AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528503)
