Related papers: Complexity of Ising Polynomials
We consider the Potts model in a magnetic field on an arbitrary graph $G$. Using a formula of F. Y. Wu for the partition function $Z$ of this model as a sum over spanning subgraphs of $G$, we prove some properties of $Z$ concerning…
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…
Today, the Ising model is an archetype describing collective ordering processes. And, as such, it is widely known in physics and far beyond. Less known is the fact that the thesis defended by Ernst Ising 100 years ago (in 1924) contained…
While the Ising model remains essential to understand physical phenomena, its natural connection to combinatorial reasoning makes it also one of the best models to probe complex systems in science and engineering. We bring a computational…
We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…
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…
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…
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…
We propose an importance sampling scheme to estimate the partition function of the two-dimensional ferromagnetic Ising model and the two-dimensional ferromagnetic $q$-state Potts model, both in the presence of an external magnetic field.…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
We study the complexity of approximating the partition function of the $q$-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum…
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Markov chain Monte Carlo methods for this problem have been…
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 describe an approach to the study of phase transitions in Potts models based on an estimate of the complexity of the locus of real zeros of the partition function, computed in terms of the classes in the Grothendieck ring of the affine…
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we…
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by…
We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum…