相关论文: On the Exact Evaluation of Certain Instances of th…
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…
This note is a stripped down version of a published paper on the Potts partition function, where we concentrate solely on the linear coding aspect of our approach. It is meant as a resource for people interested in coding theory but who do…
We present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, the random cluster model, for arbitrary temperature on $n$-vertex ladder graphs with free, cyclic, and M\"obius…
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 algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…
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…
We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability…
A new algorithm is presented, which allows to calculate numerically the partition function Z_q of the d-dimensional q-state Potts models for arbitrary real values q>0 at any given temperature T with high precision. The basic idea is to…
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…
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…
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…
Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
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…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of…
The Tutte polynomial of a graph, or equivalently the $q$-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this…
The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature expansion. Computing this dominant diagram…
An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…