An efficient quantum algorithm for colored Jones polynomials
| dc.creator | Garnerone, S. | |
| dc.creator | Marzuoli, A. | |
| dc.creator | Rasetti, M. | |
| dc.date | 2006-06-20 | |
| dc.date.accessioned | 2026-07-07T07:19:05Z | |
| dc.date.available | 2026-07-07T07:19:05Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0606167 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0606167 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114533 | |
| dc.subject | Quantum Physics | |
| dc.title | An efficient quantum algorithm for colored Jones polynomials | |
| dc.type | text |