Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1710.08871 · Physical review. B./Physical review. B

Quantum cluster variational method and message passing algorithms revisited

Eduardo Domínguez, Roberto Mulet

Published Feb 14, 2018• 3 citations
arXivHTMLPDF

Abstract

We present a general framework to study quantum disordered systems in the context of the Kikuchi's cluster variational method (CVM). The method relies in the solution of message passing-like equations for single instances or in the iterative solution of complex population dynamic algorithms for an average case scenario. We first show how a standard application of the Kikuchi's CVM can be easily translated to message passing equations for specific instances of the disordered system. We then present an ``ad hoc'' extension of these equations to a population dynamic algorithm representing an average case scenario. At the Bethe level, these equations are equivalent to the dynamic population equations that can be derived from a proper cavity ansatz. However, at the plaquette approximation, the interpretation is more subtle and we discuss it taking also into account previous results in classical disordered models. Moreover, we develop a formalism to properly deal with the average case scenario using a replica-symmetric ansatz within this CVM for quantum disordered systems. Finally, we present and discuss numerical solutions of the different approximations for the quantum transverse Ising model and the quantum random field Ising model in two-dimensional lattices.

DOI
10.1103/physrevb.97.064202

Related papers

Message passing and Monte Carlo algorithms: Connecting fixed points with metastable states

Alejandro Lage-Castellanos, Roberto Mulet, Federico Ricci‐Tersenghi

Mean field-like approximations (including naive mean field, Bethe and Kikuchi and more general Cluster Variational Methods) are known to stabilize ordered phases at temperatures higher than the thermodynamical transition. For example, in the Edwards-Anderson model in 2-dimensions these approximations predict a spin glass transition at finite $T$. Here we show that the spin glass solutions of the Cluster Variational Method (CVM) at plaquette level do describe well actual metastable states of the system. Moreover, we prove that these states can be used to predict non trivial statistical quantities, like the distribution of the overlap between two replicas. Our results support the idea that message passing algorithms can be helpful to accelerate Monte Carlo simulations in finite dimensional systems.

arXiv:1406.5373•Europhysics Letters (EPL)•Sep 1, 2014•10 citations

Cavity approach to variational quantum mechanics

Abolfazl Ramezanpour

A local and distributive algorithm is proposed to find an optimal trial wave function minimizing the Hamiltonian expectation in a quantum system. To this end, the quantum state of the system is connected to the Gibbs state of a classical system with the set of couplings playing the role of variational parameters. The average energy is written within the replica-symmetric approximation, and the optimal parameters are obtained by a heuristic message-passing algorithm based on the Bethe approximation. The performance of this approximate algorithm depends on the structure and quality of the trial wave functions, starting from a classical system of isolated elements, i.e., mean-field approximation, and improving on that by considering the higher-order many-body interactions. The method is applied to some disordered quantum Ising models in transverse fields, and the results are compared with the exact ones for small systems.

arXiv:1111.3291•Physical Review B•Mar 27, 2012•9 citations

Replica cluster variational method: the replica symmetric solution for the 2D random bond Ising model

Alejandro Lage-Castellanos, Roberto Mulet, Federico Ricci‐Tersenghi +1 more

We present and solve the replica symmetric equations in the context of the replica cluster variational method for the 2D random bond Ising model (including the 2D Edwards–Anderson spin-glass model). First, we solve a linearized version of these equations to obtain the phase diagrams of the model on the square and triangular lattices. In both cases, the spin-glass transition temperatures and the multicritical point estimations improve largely over the Bethe predictions. Moreover, we show that this phase diagram is consistent with the behavior of inference algorithms on single instances of the problem. Finally, we present a method to consistently find approximate solutions to the equations in the glassy phase. The method is applied to the triangular lattice down to T = 0, also in the presence of an external field.

arXiv:1204.0439•Journal of Physics A Mathematical and Theoretical•Mar 13, 2013•19 citations

Coherent-Anomaly Method Calculation on the Cluster Variation Method. I

Koh Wada, Naotosi Watanabe

On the basis of the coherent-anomaly method (CAM) proposed by Suzuki, the static and dynamic critical exponents of the Ising model in the triangle and the square lattice are calculated using the cluster variation method (CVM) and the path probability method (PPM) devised by Kikuchi within analytical tractable approximations. The values of critical temperatures and critical exponents estimated from three approximations with different levels are generally reasonable. The two-dimensional results are also compared with those of the simple cubic lattice.

Journal of the Physical Society of Japan•Dec 15, 1989•11 citations

Simplifying generalized belief propagation on redundant region graphs

Chuang Wang, Hai-Jun Zhou

The cluster variation method has been developed into a general theoretical framework for treating short-range correlations in many-body systems after it was first proposed by Kikuchi in 1951. On the numerical side, a message-passing approach called generalized belief propagation (GBP) was proposed by Yedidia, Freeman and Weiss about a decade ago as a way of computing the minimal value of the cluster variational free energy and the marginal distributions of clusters of variables. However the GBP equations are often redundant, and it is quite a non-trivial task to make the GBP iteration converges to a fixed point. These drawbacks hinder the application of the GBP approach to finite-dimensional frustrated and disordered systems. In this work we report an alternative and simple derivation of the GBP equations starting from the partition function. Based on this derivation we propose a natural and systematic way of removing the redundance of the GBP equations. We apply the simplified generalized belief propagation (SGBP) equations to the two-dimensional and the three-dimensional ferromagnetic Ising model and Edwards-Anderson spin glass model. The numerical results confirm that the SGBP message-passing approach is able to achieve satisfactory performance on these model systems. We also suggest that a subset of the SGBP equations can be neglected in the numerical iteration process without affecting the final results.

arXiv:1304.5112•Journal of Physics Conference Series•Dec 16, 2013•5 citations

Cluster variation method and disorder varieties of two-dimensional Ising-like models

Alessandro Pelizzola

I show that the cluster variation method, long used as a powerful hierarchy of approximations for discrete (Ising-like) two-dimensional lattice models, yields exact results on the disorder varieties which appear when competitive interactions are put into these models. I consider, as an example, the plaquette approximation of the cluster variation method for the square lattice Ising model with nearest-neighbor, next-nearest-neighbor, and plaquette interactions, and, after rederiving known results, report simple closed-form expressions for the pair and plaquette correlation functions.

arXiv:cond-mat/9909361•Physical review. B, Condensed matter•May 1, 2000•9 citations
We present a general framework to study quantum disordered systems in the context of the Kikuchi's cluster variational method (CVM). The method relies in the solution of message passing-like equations for single instances or in the iterative solution of complex population dynamic algorithms for an average case scenario. We first show how a standard application of the Kikuchi's CVM can be easily translated to message passing equations for specific instances of the disordered system. We then present an ``ad hoc'' extension of these equations to a population dynamic algorithm representing an average case scenario. At the Bethe level, these equations are equivalent to the dynamic population equations that can be derived from a proper cavity ansatz. However, at the plaquette approximation, the interpretation is more subtle and we discuss it taking also into account previous results in classical disordered models. Moreover, we develop a formalism to properly deal with the average case scenario using a replica-symmetric ansatz within this CVM for quantum disordered systems. Finally, we present and discuss numerical solutions of the different approximations for the quantum transverse Ising model and the quantum random field Ising model in two-dimensional lattices.
Mean field-like approximations (including naive mean field, Bethe and Kikuchi and more general Cluster Variational Methods) are known to stabilize ordered phases at temperatures higher than the thermodynamical transition. For example, in the Edwards-Anderson model in 2-dimensions these approximations predict a spin glass transition at finite TTT. Here we show that the spin glass solutions of the Cluster Variational Method (CVM) at plaquette level do describe well actual metastable states of the system. Moreover, we prove that these states can be used to predict non trivial statistical quantities, like the distribution of the overlap between two replicas. Our results support the idea that message passing algorithms can be helpful to accelerate Monte Carlo simulations in finite dimensional systems.
A local and distributive algorithm is proposed to find an optimal trial wave function minimizing the Hamiltonian expectation in a quantum system. To this end, the quantum state of the system is connected to the Gibbs state of a classical system with the set of couplings playing the role of variational parameters. The average energy is written within the replica-symmetric approximation, and the optimal parameters are obtained by a heuristic message-passing algorithm based on the Bethe approximation. The performance of this approximate algorithm depends on the structure and quality of the trial wave functions, starting from a classical system of isolated elements, i.e., mean-field approximation, and improving on that by considering the higher-order many-body interactions. The method is applied to some disordered quantum Ising models in transverse fields, and the results are compared with the exact ones for small systems.
We present and solve the replica symmetric equations in the context of the replica cluster variational method for the 2D random bond Ising model (including the 2D Edwards–Anderson spin-glass model). First, we solve a linearized version of these equations to obtain the phase diagrams of the model on the square and triangular lattices. In both cases, the spin-glass transition temperatures and the multicritical point estimations improve largely over the Bethe predictions. Moreover, we show that this phase diagram is consistent with the behavior of inference algorithms on single instances of the problem. Finally, we present a method to consistently find approximate solutions to the equations in the glassy phase. The method is applied to the triangular lattice down to T = 0, also in the presence of an external field.
On the basis of the coherent-anomaly method (CAM) proposed by Suzuki, the static and dynamic critical exponents of the Ising model in the triangle and the square lattice are calculated using the cluster variation method (CVM) and the path probability method (PPM) devised by Kikuchi within analytical tractable approximations. The values of critical temperatures and critical exponents estimated from three approximations with different levels are generally reasonable. The two-dimensional results are also compared with those of the simple cubic lattice.
The cluster variation method has been developed into a general theoretical framework for treating short-range correlations in many-body systems after it was first proposed by Kikuchi in 1951. On the numerical side, a message-passing approach called generalized belief propagation (GBP) was proposed by Yedidia, Freeman and Weiss about a decade ago as a way of computing the minimal value of the cluster variational free energy and the marginal distributions of clusters of variables. However the GBP equations are often redundant, and it is quite a non-trivial task to make the GBP iteration converges to a fixed point. These drawbacks hinder the application of the GBP approach to finite-dimensional frustrated and disordered systems. In this work we report an alternative and simple derivation of the GBP equations starting from the partition function. Based on this derivation we propose a natural and systematic way of removing the redundance of the GBP equations. We apply the simplified generalized belief propagation (SGBP) equations to the two-dimensional and the three-dimensional ferromagnetic Ising model and Edwards-Anderson spin glass model. The numerical results confirm that the SGBP message-passing approach is able to achieve satisfactory performance on these model systems. We also suggest that a subset of the SGBP equations can be neglected in the numerical iteration process without affecting the final results.
I show that the cluster variation method, long used as a powerful hierarchy of approximations for discrete (Ising-like) two-dimensional lattice models, yields exact results on the disorder varieties which appear when competitive interactions are put into these models. I consider, as an example, the plaquette approximation of the cluster variation method for the square lattice Ising model with nearest-neighbor, next-nearest-neighbor, and plaquette interactions, and, after rederiving known results, report simple closed-form expressions for the pair and plaquette correlation functions.