Partition Function Of Ising Model Research Articles

Calculation of partition function of Ising model on quantum computer

We study the partition function of the Ising model on a graph with the help of quantum computing. The Boltzmann factor is modeled on a quantum computer as a trace of some evolution operator with effective Hamiltonian over ancilla spins (qubits) corresponding to graph links. We propose two methods for this which are based on effective Hamiltonian with three-spin interaction and on two-spin interaction. The limit of small temperatures allows us to find the ground state of the system that is related to the discrete combinatorial optimization problem. The partition function of the Ising model for two-spin clusters is calculated on IBM's quantum computer. The possibility of finding ground state is also demonstrated for two-spin clusters.

Casimir versus Helmholtz forces: Exact results

Recently, attention has turned to the issue of the ensemble dependence of fluctuation induced forces. As a noteworthy example, in O(n) systems the statistical mechanics underlying such forces can be shown to differ in the constant M→ magnetic canonical ensemble (CE) from those in the widely-studied constant h→ grand canonical ensemble (GCE). Here, the counterpart of the Casimir force in the GCE is the Helmholtz force in the CE. Given the difference between the two ensembles for finite systems, it is reasonable to anticipate that these forces will have, in general, different behavior for the same geometry and boundary conditions. Here we present some exact results for both the Casimir and the Helmholtz force in the case of the one-dimensional Ising model subject to periodic and antiperiodic boundary conditions and compare their behavior. We note that the Ising model has recently being solved in Phys.Rev. E 106 L042103 (2022), using a combinatorial approach, for the case of fixed value M of its order parameter. Here we derive exact result for the partition function of the one-dimensional Ising model of N spins and fixed value M using the transfer matrix method (TMM); earlier results obtained via the TMM were limited to M=0 and N even. As a byproduct, we derive several specific integral representations of the hypergeometric function of Gauss. Using those results, we rigorously derive that the free energies of the CE and grand GCE are related to each other via Legendre transformation in the thermodynamic limit, and establish the leading finite-size corrections for the canonical case, which turn out to be much more pronounced than the corresponding ones in the case of the GCE.

Gap labels for zeros of the partition function of the 1D Ising model via the Schwartzman homomorphism

Inspired by the 1995 paper of Baake–Grimm–Pisani, we aim to explain the empirical observation that the distribution of Lee–Yang zeros corresponding to a one-dimensional Ising model appears to follow the gap labelling theorem. This follows by combining two main ingredients: first, the relation between the transfer matrix formalism for the 1D Ising model and an ostensibly unrelated matrix formalism generating the Szegő recursion for orthogonal polynomials on the unit circle, and second, the gap labelling theorem for CMV matrices.

3D quantum gravity from holomorphic blocks

Three-dimensional gravity is a topological field theory, which can be quantized as the Ponzano-Regge state-sum model built from the ${3nj}$ symbols of the recoupling of the SU(2) representations, in which spins are interpreted as quantized edge lengths in Planck units. It describes the flat spacetime as the gluing of three-dimensional cells with a fixed boundary metric encoding length scale. In this paper, we revisit the Ponzano-Regge model formulated in terms of spinors and rewrite the quantum geometry of 3D cells with holomorphic recoupling symbols. These symbols, known as Schwinger's generating function for the ${6j}$ symbols, are simply the squared inverse of the partition function of the 2D Ising model living on the boundary of the 3D cells. They can furthermore be interpreted, in their critical regime, as scale-invariant basic elements of geometry. We show how to glue them together into a discrete topological quantum field theory. This reformulation of the path integral for 3D quantum gravity, with a rich pole structure of the elementary building blocks, opens a new door toward the study of phase transitions and continuum limits in 3D quantum gravity and offers a new twist on the construction of a duality between 3D quantum gravity and a 2D conformal theory.

Exact expressions for the partition function of the one-dimensional Ising model in the fixed-M ensemble.

We obtain exact closed-form expressions for the partition function of the one-dimensional Ising model in the fixed-M ensemble, for three commonly used boundary conditions: periodic, antiperiodic, and Dirichlet. These expressions allow for the determination of fluctuation-induced forces in the canonical ensemble, which we term Helmholtz forces. The thermodynamic expressions and the calculations flowing from them should provide insights into the nature and behavior of fluctuation-induced forces in interesting and as-yet unexplored regimes.

Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Abstract We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda $ on the unit circle in the complex plane. Complex-valued parameters for the Ising model are relevant for quantum circuit computations and phase transitions in statistical physics but have also been key in the recent deterministic approximation scheme for all $|\lambda |\neq 1$ by Liu, Sinclair and Srivastava. Here, we focus on the unresolved complexity picture on the unit circle and on the tantalising question of what happens around $\lambda =1$ , where, on one hand, the classical algorithm of Jerrum and Sinclair gives a randomised approximation scheme on the real axis suggesting tractability and, on the other hand, the presence of Lee–Yang zeros alludes to computational hardness. Our main result establishes a sharp computational transition at the point $\lambda =1$ and, more generally, on the entire unit circle. For an integer $\Delta \geq 3$ and edge interaction parameter $b\in (0,1)$ , we show $\mathsf {\#P}$ -hardness for approximating the partition function on graphs of maximum degree $\Delta $ on the arc of the unit circle where the Lee–Yang zeros are dense. This result contrasts with known approximation algorithms when $|\lambda |\neq 1$ or when $\lambda $ is in the complementary arc around $1$ of the unit circle. Our work thus gives a direct connection between the presence/absence of Lee–Yang zeros and the tractability of efficiently approximating the partition function on bounded-degree graphs.

Fluctuations for the partition function of Ising models on Erdös–Rényi random graphs

Nous analysons les modéles d’Ising/Curie–Weiss sur le graphe Erdős–Rényi avec N sommets et probabilité d’arête p=p(N) introduits par Bovier et Gayrard (J. Stat. Phys. 72 (3–4) (1993) 643–664) et étudié dans (J. Stat. Phys. 177 (1) (2019) 78–94) et (Kabluchko, Löwe and Schubert (2019)). Nous montrons des théorèmes limite central pour la fonction de partition du modèle et – à autres régimes de p(N) – pour la fonction de partition logarithmique. Nous trouvons des régimes critiques pour p(N) en lequels le comportement des fluctuations de la fonction de partition change.

Some Applications of Wagner's Weighted Subgraph Counting Polynomial

We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roots of the edge cover polynomial have absolute value at most $4$. We more generally show that roots of the edge cover polynomial of a $k$-uniform hypergraph have absolute value at most $2^k$, and discuss applications of this to the roots of domination polynomials of graphs. We moreover discuss how our results relate to efficient algorithms for approximately computing evaluations of these polynomials.

Phase transitions in a three-dimensional Ising model with cluster weight studied by Monte Carlo simulations.

The loop model is an important model of statistical mechanics and has been extensively studied in two-dimensional lattices. However, it is still difficult to simulate the loop model directly in three-dimensional lattices, especially in lattices with coordination numbers larger than 3. In this paper, a cluster weight Ising model is proposed by introducing an additional cluster weight n in the partition function of the traditional Ising model. This model is equivalent to the loop model on the two-dimensional lattice, but on the three-dimensional lattice, it is still not very clear whether or not these models have the same universality. By using a Monte Carlo method with cluster updates and color assignment, we obtain the global phase diagram containing the paramagnetic and ferromagnetic phases. The phase transition between the two phases is second order at 1≤n<n_{cri} and first order at n≥n_{cri}, where n_{cri}≈2. The thermal exponent y_{t} is equal to the system dimension d when the first-order transition occurs. For the second-order transitions, the numerical estimation of y_{t} and the magnetic exponent y_{m}, shows that the universalities of the two models on the three-dimensional lattice are different. Our results are helpful in the understanding of some traditional statistical mechanics models.

The double hypergeometric series for the partition function of the 2D anisotropic Ising model

In 1944 Lars Onsager published the exact partition function of the ferromagnetic Ising model on the infinite square lattice in terms of a definite integral. Only in the literature of the last decade, however, has it been recast in terms of special functions. Until now all known formulas for the partition function in terms of special functions have been restricted to the important special case of the isotropic Ising model with symmetric couplings. Indeed, the anisotropic model is more challenging because there are two couplings and hence two reduced temperatures, one for each of the two axes of the square lattice. Hence, standard special functions of one variable are inadequate to the task. Here, we reformulate the partition function of the anisotropic Ising model in terms of the Kampé de Fériet function, which is a double hypergeometric function in two variables that is more general than the Appell hypergeometric functions. Finally, we present hypergeometric formulas for the generating function of multipolygons of given length on the infinite square lattice, for isotropic as well as anisotropic edge weights. For the isotropic case, the results allow easy calculation, to arbitrary order, of the celebrated series found by Cyril Domb.

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

AbstractWe 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 McQuillan [CoRR abs/1301.2880 (2013)] and developed by Huang, Lu and Zhang [Proc. 27th Symp. on Disc. Algorithms (SODA16), 514–527]. We show that exact computation of the partition function is #P-hard, even for line graphs, indicating that an approximation algorithm is the best that can be expected. We also show that Glauber dynamics for the Ising model is rapidly mixing on line graphs, an example being the kagome lattice.

Lee-Yang zeros of the antiferromagnetic Ising model

AbstractWe investigate the location of zeros for the partition function of the anti-ferromagnetic Ising model, focusing on the zeros lying on the unit circle. We give a precise characterization for the class of rooted Cayley trees, showing that the zeros are nowhere dense on the most interesting circular arcs. In contrast, we prove that when considering all graphs with a given degree bound, the zeros are dense in a circular sub-arc, implying that Cayley trees are in this sense not extremal. The proofs rely on describing the rational dynamical systems arising when considering ratios of partition functions on recursively defined trees.

A Method of Riemann–Hilbert Problem for Zhang’s Conjecture 1 in a Ferromagnetic 3D Ising Model: Trivialization of Topological Structure

A method of the Riemann–Hilbert problem is applied for Zhang’s conjecture 1 proposed in Philo. Mag. 87 (2007) 5309 for a ferromagnetic three-dimensional (3D) Ising model in the zero external field and the solution to the Zhang’s conjecture 1 is constructed by use of the monoidal transform. At first, the knot structure of the ferromagnetic 3D Ising model in the zero external field is determined and the non-local behavior of the ferromagnetic 3D Ising model can be described by the non-trivial knot structure. A representation from the knot space to the Clifford algebra of exponential type is constructed, and the partition function of the ferromagnetic 3D Ising model in the zero external field can be obtained by this representation (Theorem I). After a realization of the knots on a Riemann surface of hyperelliptic type, the monodromy representation is realized from the representation. The Riemann–Hilbert problem is formulated and the solution is obtained (Theorem II). Finally, the monoidal transformation is introduced for the solution and the trivialization of the representation is constructed (Theorem III). By this, we can obtain the desired solution to the Zhang’s conjecture 1 (Main Theorem). The present work not only proves the Zhang’s conjecture 1, but also shows that the 3D Ising model is a good platform for studying in deep the mathematical structure of a physical many-body interacting spin system and the connections between algebra, topology, and geometry.

Thermodynamical Averages For The Ising Model And Spectral Invariants Of Toeplitz Matrices

We derive a general formula giving a representation of the partition function of the one-dimensional Ising model of a system of N particles in the form of an explicitly defined functional of the spectral invariants of finite submatrices of a certain infinite Toeplitz matrix. We obtain an asymptotic representation of the partition function for large N, which can be a base for explicitly calculating some thermodynamic averages, for example, the specific free energy, in the case of a general translation-invariant spin interaction (not necessarily only between nearest neighbors). We estimate the partition function from above and below in the plane of the complex variable β (β is the inverse temperature) and consider the conditions under which these estimates are asymptotically equivalent as N → ∞

Location of zeros for the partition function of the Ising model on bounded degree graphs

The seminal Lee-Yang theorem states that for any graph the zeros of the partition function of the ferromagnetic Ising model lie on the unit circle in $\mathbb C$. In fact the union of the zeros of all graphs is dense on the unit circle. In this paper we study the location of the zeros for the class of graphs of bounded maximum degree $d\geq 3$, both in the ferromagnetic and the anti-ferromagnetic case. We determine the location exactly as a function of the inverse temperature and the degree $d$. An important step in our approach is to translate to the setting of complex dynamics and analyze a dynamical system that is naturally associated to the partition function.

Algorithms for estimating the partition function of restricted Boltzmann machines

Accurate estimates of the normalization constants (partition functions) of energy-based probabilistic models (Markov random fields) are highly important, for example, for assessing the performance of models, monitoring training progress, and conducting likelihood ratio tests. Several algorithms for estimating the partition function (in relation to a reference distribution) have been introduced, including Annealed Importance Sampling (AIS) and Bennett's Acceptance Ratio method (BAR). However, their conceptual similarities and differences have not been worked out so far and systematic comparisons of their behavior in practice have been missing. We devise a unifying theoretical framework for these algorithms, which comprises existing variants and suggests new approaches. It is based on a generalized form of Crooks' equality linking the expectation over a distribution of samples generated by a transition operator to the expectation over the distribution induced by the reversed operator. The framework covers different ways of generating samples, such as parallel tempering and path sampling. An empirical comparison revealed the differences between the methods when estimating the partition function of restricted Boltzmann machines and Ising models. In our experiments, BAR using parallel tempering worked well with a small number of bridging distributions, while path sampling based AIS performed best when many bridging distributions were available. Because BAR gave the overall best results, we favor it over AIS. Furthermore, the experiments showed the importance of choosing a proper reference distribution.

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs

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 and external fields are absolutely bounded close to zero. Furthermore, we prove that for this class of Ising models the partition function does not vanish. Our algorithm is based on an approach due to Barvinok for approximating evaluations of a polynomial based on the location of the complex zeros and a technique due to Patel and Regts for efficiently computing the leading coefficients of graph polynomials on bounded degree graphs. Finally, we show how our algorithm can be extended to approximate certain output probability amplitudes of quantum circuits.

Exact Spectral Form Factor in a Minimal Model of Many-Body Quantum Chaos.

The most general and versatile defining feature of quantum chaotic systems is that they possess an energy spectrum with correlations universally described by random matrix theory (RMT). This feature can be exhibited by systems with a well-defined classical limit as well as by systems with no classical correspondence, such as locally interacting spins or fermions. Despite great phenomenological success, a general mechanism explaining the emergence of RMT without reference to semiclassical concepts is still missing. Here we provide the example of a quantum many-body system with no semiclassical limit (no large parameter) where the emergence of RMT spectral correlations is proven exactly. Specifically, we consider a periodically driven Ising model and write the Fourier transform of spectral density's two-point function, the spectral form factor, in terms of a partition function of a two-dimensional classical Ising model featuring a space-time duality. We show that the self-dual cases provide a minimal model of many-body quantum chaos, where the spectral form factor is demonstrated to match RMT for all values of the integer time variable t in the thermodynamic limit. In particular, we rigorously prove RMT form factor for an odd t, while we formulate a precise conjecture for an even t. The results imply ergodicity for any finite amount of disorder in the longitudinal field, rigorously excluding the possibility of many-body localization. Our method provides a novel route for obtaining exact nonperturbative results in nonintegrable systems.

The Ising Partition Function: Zeros and Deterministic Approximation

We study the problem of approximating the partition function of the ferromagnetic Ising model with both pairwise as well as higher order interactions (equivalently, in graphs as well as hypergraphs). Our approach is based on the classical Lee–Yang theory of phase transitions, along with a new Lee–Yang theorem for the Ising model with higher order interactions, and on an extension of ideas developed recently by Barvinok, and Patel and Regts that can be seen as an algorithmic realization of the Lee–Yang theory. Our first result is a deterministic polynomial time approximation scheme (an FPTAS) for the partition function in bounded degree graphs that is valid over the entire range of parameters \(\beta \) (the interaction) and \(\lambda \) (the external field), except for the case \(\left| \lambda \right| =1\) (the “zero-field” case). A polynomial time randomized approximation scheme (FPRAS) for all graphs and all \(\beta ,\lambda \), based on Markov chain Monte Carlo simulation, has long been known. Unlike most other deterministic approximation algorithms for problems in statistical physics and counting, our algorithm does not rely on the “decay of correlations” property, but, as pointed out above, on Lee–Yang theory. This approach extends to the more general setting of the Ising model on hypergraphs of bounded degree and edge size, where no previous algorithms (even randomized) were known for a wide range of parameters. In order to achieve this latter extension, we establish a tight version of the Lee–Yang theorem for the Ising model on hypergraphs, improving a classical result of Suzuki and Fisher.

Monte Carlo Methods for the Ferromagnetic Potts Model Using Factor Graph Duality

Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo methods, which are known to work well at high temperatures but to fail at low temperatures. We propose Monte Carlo methods (uniform sampling and importance sampling) in the dual normal factor graph and demonstrate that they behave differently: they work particularly well at low temperatures. By comparing the relative error in estimating the partition function, we show that the proposed importance sampling algorithm significantly outperforms the state-of-the-art deterministic and Monte Carlo methods. For the ferromagnetic Ising model in an external field, we show the equivalence between the valid configurations in the dual normal factor graph and the terms that appear in the high-temperature series expansion of the partition function. Following this result, we discuss connections with Jerrum–Sinclair’s polynomial randomized approximation scheme (the subgraphs-world process) for evaluating the partition function of ferromagnetic Ising models.