On the exact evaluation of certain instances of the potts partition function by quantum computers

Communications in Mathematical Physics

Volumn 279, Issue 3, 2008, Pages 735-768

  Geraci, Joseph ^a,b   Lidar, Daniel A ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41249094096     PISSN: 00103616     EISSN: 14320916     Source Type: Journal    
DOI: 10.1007/s00220-008-0438-0     Document Type: Article

References (46)

1. Shor P.W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. on Comp. 26: 1484
2. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, New York: ACM, 1996, p. 212
3. Lidar D.A. and Biham O. (1997). Simulating Ising spin glasses on a quantum computer. Phys. Rev. E 56: 3661
4. Swendsen R.H. and Wang J.-S. (1987). Phys. Rev. Lett. 58: 86
5. Lidar D.A. (2004). On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants. New J. Phys. 6: 167
6. Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. Volume 1 of London Mathematical Society Lecture Note Series 186. London: Cambridge University Press, 1993
7. Reichl L.E. (1998). A Modern Course in Statistical Physics. John Wiley & Sons, New York
8. Jones V.F.R. (1989). On Knot Invariants Related to Some Statistical Mechanical Models. Pacific J. Math. 137: 311
9. Jones V.F.R. (1985). A Polynomial Invariant for Knots via von Neumann Algebras. Bull. Amer. Math. Soc. 12: 103
10. Jaeger F., Vertigen D. and Welsh D. (1990). On the Computational Complexity of the Jones' and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108: 35
11. Kauffman, L.H.: Knots and Physics. Volume 1 of Knots and Everything. Singapore: World Scientific, 2001
12. Alon, N., Frieze, A.M., Welsh, D.: Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Electronic Colloquium on Computational Complexity, 1(5) (1994), available at http://eccc.hpi-web.de/eccc-reports/1994/TR94-005/index.html, 1994
13. Nechaev, S.: Statistics of knots and entangled random walks. http://arxiv.org/list/cond-mat/9812205, 1998
14. Witten E. (1988). Topological quantum field theory. Commun. Math. Phys. 117: 353
15. Freedman M.H., Kitaev A. and Wang Z. (2002). Simulation of topological field theories by quantum computers. Commun. Math. Phys. 227: 587
16. Freedman, M.H., Kitaev, A., Larsen, M.J., Wang, Z.: Topological Quantum Computation. http://arxiv.org/list/quant-ph/0101025, 2001
17. Aharonov, D., Jones, V., Landau, Z.: A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. http://arxiv.org/list/quant-ph/0511096, 2005
18. Wocjan, P., Yard, J.: The Jones polynomial: quantum algorithms and applications in quantum complexity theory. http://arxiv.org/list/quant-ph/ 0603069, 2006
19. Kauffman L.H. and Lomonaco S.J. (2007). q-Deformed spin networks, knot polynomials and anyonic topological computation. J. of Knot Theory and its Ramifications 16: 267
20. Bonca, J., Gubernatis, J.E.: Real-Time Dynamics from Imaginary-Time Quantum Monte Carlo Simulations: Test on Oscillator Chains. http://arxiv.org/ list/cond-mat/9510098, 1995
21. Aharonov, D., Arad, I., Eban, E., Landau, Z.: Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane. http://arxiv.org/list/quant-ph/0702008, 2007
22. Van den Nest M., Dur W. and Briegel H.J. (2007). Classical spin models and the quantum stabilizer formalism. Phys. Rev. Lett. 98: 117207
23. Hartmann A.K. (2005). Calculation of partition functions by measuring component distributions. Phys. Rev. Lett. 94: 050601
24. ab Curves using Monsky-Washnitzer Cohomology. http://citeseer.ist.psu.edu/denef04counting. html, 2004
25. Kedlaya K. (2006). Quantum Computation of zeta functions of curves. Comput. Complex. 15: 1-19
26. van Dam, W., Seroussi, G.: Efficient Quantum Algorithms for Estimating Gauss Sums. http://arxiv.org/list/quant-ph/0207131, 2002
27. Barg A. (2002). On some polynomials related to Weight Enumerators of Linear Codes. SIAM J. Discrete Math. 15: 155
28. Baumert L. and McEliece R. (1972). Weights of Irreducible Cyclic Codes. Inform. and Control 20: 158
29. Welsh D.J.A. (1976). Matroid Theory. Academic Press Inc, London
30. Gross J. and Yellen J. (1999). Graph theory and its applications. Discrete mathematics and its applications. CRC Press, Boca Raton, FL
31. Lint J.H. (1982). Introduction to Coding Theory. Springer-Verlag, Berlin-Heidelberg-New York
32. Jaeger F. (1998). The Tutte Polynomial and Link Polynomials. Proc. Amer. Math. Soc. 103: 647
33. Evans J., Berndt B.C. and Williams K.S. (1998). Gauss and Jacobi Sums. Wiley-Interscience, New York
34. Moisio, M.: Exponential Sums, Gauss Sums and Cyclic Codes. 1997. Available at http://lipas.uwasa.fi/~mamo/vaitos.pdf, 1997
35. Aubry, Y., Langevin, P.: On the weights of irreducible cyclic codes. 2005. Available at http://iml.univ-mrs.fr/~aubry/LNCS.pdf, 2005
36. Andrews G.E. (1994). Number Theory. Dover Publications Inc., New York
37. Nielsen M.A. and Chuang I.L. (2000). Quantum Computation and Quantum Information. Cambridge University Press, Cambridge
38. van Dam, W., Seroussi, G.: Quantum algorithms for estimating Gauss sums and calculating discrete logarithms. Available at http://www.cs.ucsb.edu/ ~vandam/gausssumdlog.pdf
39. Brassard, G., Hoyer, P., Tapp, A.: Quantum Counting. http://arxiv.org/ list/quant-ph/9805082, 1998
40. van Bussel, F., Geraci, J.: A Note on Cyclotomic Cosets and an Algorithm for finding Coset Representatives and Size and a theorem on the quantum evaluation of weight enumerators for a certain class of cycliccades. http://arxiv.org/list/cs.0703129, 2007
41. Lidl R. and Niederreiter H. (1997). Finite Fields, Volume 20 of Encyclopedia of Mathematics. Cambridge University Press, Cambridge
42. Van Der Glugt M. (1995). Hasse-Davenport Curves, Gauss Sums and Weight Distributions of Irreducible Cyclic Codes. J. Number Theory 55: 145
43. Vyalyi, M.N.: Hardness of approximating the weight enumerator of a binary linear code. http://arxiv.org/list/cs.CC/0304044, 2003
44. Khovanov M. (2000). A categorification of the Jones polynomial. Duke Math. J. 101: 359
45. Martinez-Perez C. and Willems W. (2006). Is the Class of Cyclic Codes Asymptotically Good?. IEEE Trans. Inf. Theory 52(2): 696
46. Shrock R. (2000). Exact Potts model partition functions on ladder graphs. Physica A 283: 388