Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version

In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial, at any point in the Tutte plane, for any planar graph. This includes as special cases the AJL algorithm for the Jones polynomial, the partition function of the Potts model for any weighted planer graph at any temperature, and many other combinatorial graph properties. In the second part of the paper we prove the quantum universality of many of the problems for which we provide an algorithm, thus providing a large set of new quantum-complete problems. Unfortunately, we do not know that this holds for the Potts model case; this is left as an important open problem. The main progress in this work is in our ability to handle non-unitary representations of the Temperley Lieb algebra, both when applying them in the algorithm, and, more importantly, in the proof of universality, when encoding quantum circuits using non-unitary operators. To this end we develop many new tools, that allow proving density and applying the Solovay Kitaev theorem in the case of non-unitary matrices. We hope that these tools will open up new possibilities of using non-unitary reps in other quantum computation contexts.

[1]  E. Ising.  Beitrag zur Theorie des Ferromagnetismus , 1925 .

[2]  William T. Tutte.  A Ring in Graph Theory , 1947 .

[3]  R. B. Potts.  Some generalized order-disorder transformations , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  C. Fortuin,et al.  Phase transitions in lattice systems with random local properties , 1969 .

[5]  F. W. Warner.  Foundations of Differentiable Manifolds and Lie Groups , 1971 .

[6]  Elliott H Lieb,et al.  Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem , 1971, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[7]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[8]  T. Jørgensen.  On Discrete Groups of Mobius Transformations , 1976 .

[9]  R. Baxter.  Exactly solved models in statistical mechanics , 1982 .

[10]  F. Y. Wu.  The Potts model , 1982 .

[11]  D. Sullivan.  Quasiconformal homeomorphisms and dynamics II: Structural stability implies hyperbolicity for Kleinian groups , 1985 .

[12]  Louis H. Kauffman,et al.  State Models and the Jones Polynomial , 1987 .

[13]  Edward Witten,et al.  Quantum field theory and the Jones polynomial , 1989 .

[14]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[15]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[16]  John G. Ratcliffe,et al.  Geometry of Discrete Groups , 2019, Foundations of Hyperbolic Manifolds.

[17]  A. Beardon.  The Geometry of Discrete Groups , 1995 .

[18]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[19]  M H Freedman,et al.  P/NP, and the quantum field computer , 1998, Proc. Natl. Acad. Sci. USA.

[20]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[21]  Michael Larsen,et al.  A Modular Functor Which is Universal¶for Quantum Computation , 2000, quant-ph/0001108.

[22]  T. Ransford,et al.  On the set of discrete two-generator groups , 2000, Mathematical Proceedings of the Cambridge Philosophical Society.

[23]  L. Grove,et al.  Classical Groups and Geometric Algebra , 2001 .

[24]  M. Freedman,et al.  Topological Quantum Computation , 2001, quant-ph/0101025.

[25]  D. Landau,et al.  Efficient, multiple-range random walk algorithm to calculate the density of states. , 2000, Physical review letters.

[26]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[27]  Oded Regev,et al.  Quantum computation and lattice problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[28]  M. Freedman,et al.  Simulation of Topological Field Theories¶by Quantum Computers , 2000, quant-ph/0001071.

[29]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[30]  A. Hartmann,et al.  Calculation of partition functions by measuring component distributions. , 2005, Physical review letters.

[31]  László Lovász,et al.  Approximate Counting and Quantum Computation , 2005, Combinatorics, Probability and Computing.

[32]  Martin Rötteler,et al.  Limitations of quantum coset states for graph isomorphism , 2006, STOC '06.

[33]  Dorit Aharonov,et al.  The BQP-hardness of approximating the Jones polynomial , 2006, ArXiv.

[34]  Michael A. Nielsen,et al.  The Solovay-Kitaev algorithm , 2006, Quantum Inf. Comput..

[35]  D. Aharonov,et al.  The quantum FFT can be classically simulated , 2006, quant-ph/0611156.

[36]  Attila B. Nagy.  On an implementation of the Solovay-Kitaev algorithm , 2006 .

[37]  Inapproximability of the Tutte polynomial , 2007, STOC '07.

[38]  Mario Rasetti,et al.  Quantum automata, braid group and link polynomials , 2006, Quantum Inf. Comput..

[39]  Pawel Wocjan,et al.  The Jones polynomial: quantum algorithms and applications in quantum complexity theory , 2008, Quantum Inf. Comput..

[40]  Dorit Aharonov,et al.  Fault-tolerant Quantum Computation with Constant Error Rate * , 1999 .

[41]  Dorit Aharonov,et al.  A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.