Topological quantum computing and the Jones polynomial

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 6244, Issue , 2006, Pages

  Lomonaco Jr , Samuel J ^a   Kauffman, Louis H ^b  

^a Baltimore County   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Braid group; Hadamard test; Jones polynomial; Knot theory; Quantum algorithms; Quantum computation; Quantum topological computing; Quantum topology; Temperley Lieb algebra

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; OPTICAL COMMUNICATION; POLYNOMIAL APPROXIMATION; TOPOLOGY;

BRAID GROUP; HADAMARD TEST; JONES POLYNOMIAL; KNOT THEORY; QUANTUM ALGORITHMS; QUANTUM COMPUTATION; QUANTUM TOPOLOGY; TEMPERLEY-LIEB ALGEBRA;

QUANTUM THEORY;

EID: 33747366377     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.665361     Document Type: Conference Paper

References (35)

1. Aharonov, Dorit, Vaughan Jones, and Zeph Landau, A polynomial quantum algorithm for approximating the Jones polynomial, http://arxiv.org/abs/quant-ph/0511096
2. Artin, E., Theory of braids, Annals of Mathematics, 48, (1947), 101-126.
3. Bernstein, E., and U. Vazirani, Quantum complexity theory, SIAM Journal of Computation, 26, 5, (1997), 1411-1473.
4. Birman, J., "Braids, links and mapping class groups," Annals of Mathematical Studies, vol. 82, (1974).
5. Crowell, Richard H., and Ralph H. Fox. "Inroduction to Knot Theory," Springer-Verlag, (1977).
6. Ewing, B. and K.C. Millett. A load balanced algorithm for the calculation of the polynomial knot and link invariants in "The mathematical heritage of C. F. Gauss," 225-266, World Sci. Publishing, River Edge, NJ, (1991).
7. Fox, R.H., A quick trip through knot theory, in "Topology of 3-Manifolds and Related Topics," M.K. Fort, Jr., (Ed.), Printice-Hall. (1962).
8. Freedman, M., P/NP and the quantum field computer. Proc. Natl. Acad. Sci., USA, 95, (1998), 98-101
9. Freedman, M., A.Kitaev, M. Larsen, and Z. Wang, Topological quantum computation in "Mathematical challenges of the 21st century (Los Angeles, CA, 2000)," Bull. Amer. Math. Soc., 40, no. 1, (2003), 31-38
10. Freedman, M.H., A. Kitaev. and Z. Wang, Simulation of topological field theories by quantum computers, Commun. Math. Phys., 227, (2002) 587-603.
11. Freedman, M.H., M. Larsen, and Z. Wang, A modular Functor which is universal for quantum computation, Commun. Math. Phys., 227 no. 3, (2002), 605-622.
12. Goodman, F.M., P. de la Harpe, and V.F.R. Jones, Coxeter graphs and towers of algebras, SpringerVerlag, (1989).
13. Garnerone, Silvano, Annalisa Marzuoli. and Mario Rasetti, Quantum automata, braid group and link polynomials, http://arxiv.org/abs/quant-ph/0601169
14. Jaeger, F., D.L. Vertigan, D.J.A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc., 108, no. 1, (1990), 35-53.
15. Jones, V.F.R., A polynomial invariant for knots via von Neumann algebras, Bull. Amer. Math. Soc., 12, no. 1, (1985), 103-111.
16. Jones, V.F.R., Index for subfactors, Invent. Math 72 (1983), 1-25.
17. Jones, V.F.R., Braid groups, Hecke Algebras and type II factors, in "Geometric methods in Operator Algebras," Pitman Research Notes in Math., 123 (1986), 242-273.
18. Kauffman, L., State models and the Jones polynomial, Topology 26, (1987),395-407.
19. Kauffman, Louis H., and Sostenes L. Lins, "Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds," Princeton University Press, (1994).
20. Kauffman, Louis H., "Knots and Physics," (second edition), World Scientific, (1993)
21. Kauffman, Louis H., Quantum computing and the Jones polynomial in "Quantum computation and information," edited by S.J. Lomonaco, Jr., AMS CONM/305, (2000), 101-137.
22. Kuperberg, G., A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, http://arxiv.org/abs/quant-ph/0302112.
23. Lickorish, W.B. Raymond, "An Introduction to Knot Theory," Springer-Verlag, (1997).
24. Lomonaco, Samuel J., Jr., "Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium," AMS PSAPM 58, (2000).
25. Lomonaco, Samuel J., Jr., (ed.), "Low Dimensional Topology," AMS CONM/20, (1981).
26. Markov, A., Uber de freie Aquivalenz geschlossener Zopfe, Rossiiskaya Akademiya Nauk, Matematicheskii Sbornik, 1, (1935), 73-78.
27. Murasugi, Kunio, "Knot Theory and Its Applications," Birkhauser, (1996).
28. Neilsen, Michael A., and Isaac L. Chuang, "Quantum Computation and Quantum Information," Cambridge University Press, (2000).
29. Roldsen, Dale, "Knots and Links," Publish or Perish, Inc., (1976).
30. Vogel, P., Representation of links by braids: A new algorithm, Comment, math. Helvetici, 65 (1) (1990), 104-113.
31. Welsh, D.J.A., The Computational Complexity of Some Classical Problems from Statistical Physics, in "Disorder in Physical Systems," G.R. Grimmett and D.J.A. Welsh, eds., Clarendon Press, Oxford, (1990), 307-321.
32. Welsh, D.J.A., "Complexity: Knots, Colourings and Counting," Cambridge University Press, (2000).
33. Witten, Edward, Quantum field theory and the Jones polynomial, Comm. Math. Phys., 121, no. 3, (1989), 351-399.
34. Wu, F.Y., Knot Theory and statistical mechanics, Rev. Mod. Phys. 64, No. 4., (1992).
35. Wocjan, Pawel, and Jon Yard, The Jones polynomial: quantum algorithms and applications in quantum complexity theory, http://arxiv.org/abs/quant-ph/0603069