The Complexity of Approximating complex-valued Ising and Tutte partition functions
- 108 Downloads
We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum computations as evaluations of classical partition functions. These results rely on interesting and deep results about quantum computation in order to obtain hardness results about the difficulty in (classically) evaluating the partition functions for certain fixed parameters.
The motivation for this paper is to study more comprehensively the complexity of (classically) approximating the Ising and Tutte partition functions with complex parameters. Partition functions are combinatorial in nature, and quantifying their approximation complexity does not require a detailed understanding of quantum computation. Using combinatorial arguments, we give the first full classification of the complexity of multiplicatively approximating the norm and additively approximating the argument of the Ising partition function for complex edge interactions (as well as of approximating the partition function according to a natural complex metric). We also study the norm approximation problem in the presence of external fields, for which we give a complete dichotomy when the parameters are roots of unity. Previous results were known just for a few such points, and we strengthen these results from BQP-hardness to #P-hardness. Moreover, we show that computing the sign of the Tutte polynomial is #P-hard at certain points related to the simulation of BQP. Using our classifications, we then revisit the connections to quantum computation, drawing conclusions that are a little different from (and incomparable to) ones in the quantum literature, but along similar lines.
KeywordsCounting Complexity Ising model Tutte polynomial Approximate Counting
Subject classification68Q17 Computational difficulty of problems
Unable to display preview. Download preview PDF.
- Dorit Aharonov & Itai Arad (2011). The BQP-hardness of approximating the Jones polynomial. New Journal of Physics 13(3), 035 019.Google Scholar
- Michael J. Bremner, Richard Jozsa & Dan J. Shepherd (2011). Classical Simulation of Commuting Quantum Computations implies Collapse of the Polynomial Hierarchy. Proc. R. Soc. A 467(2126), 459–472.Google Scholar
- Y. Bugeaud (2004). Approximation by Algebraic Numbers. Cambridge Tracts in Mathematics. Cambridge University Press. ISBN 9781139455671.Google Scholar
- G. De las Cuevas, W. Dür, M. Van den Nest & M. A. Martin-Delgado (2011). Quantum algorithms for classical lattice models. New Journal of Physics 13(9), 093 021.Google Scholar
- Michael H. Freedman, Alexei Kitaev, Michael J. Larsen & Zhenghan Wang (2003). Topological quantum computation. Bull. Amer. Math. Soc. (N.S.) 40(1), 31–38.Google Scholar
- Keisuke Fujii & Tomoyuki Morimae (2013). Quantum Commuting Circuits and Complexity of Ising Partition Functions. CoRR arXiv:1311.2128.
- Joseph Geraci & Daniel A Lidar (2010). Classical Ising model test for quantum circuits. New Journal of Physics 12(7), 075 026.Google Scholar
- A. Matsuo, K. Fujii & N. Imoto (2014). A quantum algorithm for additive approximation of Ising partition functions. Phys. Rev. A 90, 022 304.Google Scholar
- Michael A. Nielsen & Isaac L. Chuang (2004). Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences). Cambridge University Press, 1st edition. ISBN 0521635039.Google Scholar
- Dan Shepherd (2010). Binary Matroids and Quantum Probability Distributions. CoRR arXiv:1005.1744.
- Dan J. Shepherd & Michael J. Bremner (2009). Temporally Unstructured Quantum Computation. Proc. R. Soc. A 465(2105), 1413–1439.Google Scholar
- Alan D. Sokal (2005). The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in combinatorics 2005, volume 327 of London Math. Soc. Lecture Note Ser., 173–226. Cambridge Univ. Press, Cambridge.Google Scholar