AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
From MaRDI portal
Publication:3528503
DOI10.1142/S0219749908004092zbMath1145.81341arXivquant-ph/0606167MaRDI QIDQ3528503
Annalisa Marzuoli, S. Garnerone, Mario Rasetti
Publication date: 17 October 2008
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0606167
81P68: Quantum computation
Cites Work
- Hecke algebra representations of braid groups and link polynomials
- Quantum field theory and the Jones polynomial
- Chern-Simons theory, coloured-oriented braids and link invariants
- Spin network quantum simulator
- Computing spin networks
- Quantum geometry and quantum algorithms
- Efficient discrete approximations of quantum gates
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Approximate Counting and Quantum Computation
- Quantum invariants of knots and 3-manifolds