Related papers: The complexity of approximating the complex-valued…
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…
We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
In this survey, we give a friendly introduction from a graph theory perspective to the q-state Potts model, an important statistical mechanics tool for analyzing complex systems in which nearest neighbor interactions determine the aggregate…
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…
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
The zeros of the partition function of the ferromagnetic q-state Potts model with long-range interactions in the complex-q plane are studied in the mean-field case, while preliminary numerical results are reported for the finite 1d chains…
We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…
The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…
In this paper we take the first step toward a classification of the approximation complexity of the six-vertex model, an object of extensive research in statistical physics. Our complexity results conform to the phase transition phenomenon…
We study the zeros in the complex plane of the partition function for the Ising model coupled to 2d quantum gravity for complex magnetic field and real temperature, and for complex temperature and real magnetic field, respectively. We…
The q-state Potts model is a fundamental framework in statistical physics and graph theory, with its partition function encoding rich information about spin configurations. The multivariate Tutte polynomial (known as the partition function…
Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied…
We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters q>= 2 and gamma. (Relative to the classical (x,y)…
It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed…
The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
We study the complexity of computing the sign of the Tutte polynomial of a graph. As there are only three possible outcomes (positive, negative, and zero), this seems at first sight more like a decision problem than a counting problem.…
We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the…