Related papers: Approximating the partition function of the ferrom…
In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational…
We study the statistical complexity of estimating partition functions given sample access to a proposal distribution and an unnormalized density ratio for a target distribution. While partition function estimation is a classical problem,…
The weakly first-order nature of the two-dimensional 5-state ferromagnetic Potts model poses challenges for numerical study. Using density-matrix and tensor-network renormalization group methods, we investigate these transitions of the…
We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…
We consider the problem of sampling from the ferromagnetic $q$-state Potts model on the random $d$-regular graph with parameter $\beta>0$. A key difficulty that arises in sampling from the model is the existence of a metastability window…
Density functional theory is a successful branch of numerical simulations of quantum systems. While the foundations are rigorously defined, the universal functional must be approximated resulting in a `semi'-ab initio approach. The search…
We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, there is a classification known for the case in which the domain…
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…
The Q-state Potts model can be extended to noninteger and even complex Q in the FK representation. In the FK representation the partition function,Z(Q,a), is a polynomial in Q and v=a-1(a=e^-T) and the coefficients of this…
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…
We study the phase diagram of Q-state Potts models, for Q=4 cos^2(PI/p) a Beraha number (p>2 integer), in the complex-temperature plane. The models are defined on L x N strips of the square or triangular lattice, with boundary conditions on…
This article studies the planar Potts model and its random-cluster representation. We show that the phase transition of the nearest-neighbor ferromagnetic $q$-state Potts model on $\mathbb Z^2$ is continuous for $q\in\{2,3,4\}$, in the…
Free fermions are some of the best studied quantum systems. However, little is known about the complexity of learning free-fermion distributions. In this work we establish the hardness of this task in the particle number non-preserving…
We study the phase diagram of the ferromagnetic $q$-state Potts model on the various three-dimensional lattices for integer and non-integer values of $q>1$. Our approach is based on a thermodynamically self-consistent Ornstein-Zernike…
We initiate a study of the classification of approximation complexity of the eight-vertex model defined over 4-regular graphs. The eight-vertex model, together with its special case the six-vertex model, is one of the most extensively…
We consider MAP estimators for structured prediction with exponential family models. In particular, we concentrate on the case that efficient algorithms for uniform sampling from the output space exist. We show that under this assumption…
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…
We present exact calculations of the $q$-state Potts model partition functions and the equivalent Tutte polynomials for chain graphs comprised of $m$ repeated hammock subgraphs $H_{e_1,...,e_r}$ connected with line graphs of length $e_g$…
We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…