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:1312.0230 · Physical Review E

Bethe free-energy approximations for disordered quantum systems

Indaco Biazzo, Abolfazl Ramezanpour

Published Jun 26, 2014• 3 citations
arXivHTMLPDF

Abstract

Given a locally consistent set of reduced density matrices, we construct approximate density matrices which are globally consistent with the local density matrices we started from when the trial density matrix has a tree structure. We employ the cavity method of statistical physics to find the optimal density matrix representation by slowly decreasing the temperature in an annealing algorithm, or by minimizing an approximate Bethe free energy depending on the reduced density matrices and some cavity messages originated from the Bethe approximation of the entropy. We obtain the classical Bethe expression for the entropy within a naive (mean-field) approximation of the cavity messages, which is expected to work well at high temperatures. In the next order of the approximation, we obtain another expression for the Bethe entropy depending only on the diagonal elements of the reduced density matrices. In principle, we can improve the entropy approximation by considering more accurate cavity messages in the Bethe approximation of the entropy. We compare the annealing algorithm and the naive approximation of the Bethe entropy with exact and approximate numerical simulations for small and large samples of the random transverse Ising model on random regular graphs.

DOI
10.1103/physreve.89.062137

Related papers

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

Low-temperature excitations within the Bethe approximation

Indaco Biazzo, Abolfazl Ramezanpour

We propose the variational quantum cavity method to construct a minimal energy subspace of wavevectors that are used to obtain some upper bounds for the energy cost of the low-temperature excitations. Given a trial wavefunction we use the cavity method of statistical physics to estimate the Hamiltonian expectation and to find the optimal variational parameters in the subspace of wavevectors orthogonal to the lower-energy wavefunctions. To this end, we write the overlap between two wavefunctions within the Bethe approximation, which allows us to replace the global orthogonality constraint with some local constraints on the variational parameters. The method is applied to the transverse Ising model and different levels of approximations are compared with the exact numerical solutions for small systems.

arXiv:1301.2924•Journal of Statistical Mechanics Theory and Experiment•Apr 2, 2013•6 citations

Statistical physics of principal minors: Cavity approach

Abolfazl Ramezanpour, M. A. Rajabpour

Determinants are useful to represent the state of an interacting system of (effectively) repulsive and independent elements, like fermions in a quantum system and training samples in a learning problem. A computationally challenging problem is to compute the sum of powers of principal minors of a matrix which is relevant to the study of critical behaviors in quantum fermionic systems and finding a subset of maximally informative training data for a learning algorithm. Specifically, principal minors of positive square matrices can be considered as statistical weights of a random point process on the set of the matrix indices. The probability of each subset of the indices is in general proportional to a positive power of the determinant of the associated submatrix. We use Gaussian representation of the determinants for symmetric and positive matrices to estimate the partition function (or free energy) and the entropy of principal minors within the Bethe approximation. The results are expected to be asymptotically exact for diagonally dominant matrices with locally treelike structures. We consider the Laplacian matrix of random regular graphs of degree K=2,3,4 and exactly characterize the structure of the relevant minors in a mean-field model of such matrices. No (finite-temperature) phase transition is observed in this class of diagonally dominant matrices by increasing the positive power of the principal minors, which here plays the role of an inverse temperature.

arXiv:2405.19904•Physical review. E•Jun 18, 2024•0 citations

Random field Ising model in two dimensions: Bethe approximation, cluster variational method and message passing algorithms

Eduardo Domínguez, Alejandro Lage-Castellanos, Roberto Mulet

Abstract We study two free energy approximations (Bethe and plaquette-CVM) for the Random Field Ising Model in two dimensions. We compare results obtained by these two methods in single instances of the model on the square grid, showing the difficulties arising in defining a robust critical line. We also attempt average case calculations using a replica-symmetric ansatz, and compare the results with single instances. Both, Bethe and plaquette-CVM approximations present a similar panorama in the phase space, predicting long range order at low temperatures and fields. We show that plaquette-CVM is more precise, in the sense that predicts a lower critical line (the truth being no line at all). Furthermore, we give some insight on the non-trivial structure of the fixed points of different message passing algorithms. A study of the Monte Carlo dynamics for an arbitrary sample shows that GBP states are very well correlated with states that are attractors of the stochastic dynamics.

arXiv:1501.07545•Journal of Statistical Mechanics Theory and Experiment•Jul 1, 2015•5 citations

On mean-field approximations for estimating correlations and solving the inverse Ising problem

Federico Ricci‐Tersenghi, Piazzale Aldo Moro

The inverse Ising problem consists in inferring the coupling constants of an Ising model given the correlation matrix. The fastest methods for solving this problem are based on mean-field approximations, but which one performs better in the general case is still not completely clear. In the first part of this work, I summarize the formulas for several mean- field approximations and I derive new analytical expressions for the Bethe approximation, which allow to solve the inverse Ising problem without running the Susceptibility Propagation algorithm (thus avoiding the lack of convergence). In the second part, I compare the accuracy of different mean field approximations on several models (diluted ferromagnets and spin glasses) defined on random graphs and regular lattices, showing which one is in general more effective. A simple improvement over these approximations is proposed. Also a fundamental limitation is found in using methods based on TAP and Bethe approximations in presence of an external field.

arXiv:1112.4814•Dec 20, 2011•3 citations

The cavity method for in and out of equilibrium systems on diluted graphs

Stefano Crotti

This work explores the cavity method from statistical physics as applied to systems of variables interacting on diluted graphs.The cavity approximation, originally conceived for studying disordered systems like spin glasses, has evolved into a versatile framework, providing message-passing algorithms such as belief propagation.Here we consider both static (equilibrium) and dynamic (non-equilibrium) scenarios, exploiting the effectiveness of the cavity approach in its analytical as well as algorithmic variations.The first chapter introduces the mathematical formulation of the cavity method as originated in physics and then re-invented in the fields of communications and computer science.In chapter two we study the closest vector problem, a prototypical task in discrete optimization with applications in cryptography and the theory of computational complexity.By means of a mapping to a spin glass model, the cavity method provides semi-analytical results for an infinite-size system.These are then compared with the outcome of approximate optimization on finite instances.Of particular interest is the interplay between phase transitions in the geometry of the space of solutions and the performance of optimization algorithms.In the third chapter, devoted to non-equilibrium dynamics, we introduce and develop the Matrix Product Belief Propagation (MPBP) algorithm for computing observables of Markov processes on graphs.We consider how reweighting a process, an operation which arises naturally when considering inverse problems and atypical trajectories, can lead to major computational challenges.By leveraging the matrix product state approximation from quantum mechanics, MPBP reduces computational complexity while maintaining high accuracy for dynamical models such as epidemic spreading and Glauber dynamics.vi Finally, chapter four contains ongoing work on an extension of MPBP able to describe the steady state of stochastic processes on graphs.This is done by exploiting the Uniform Matrix Product State (UMPS) formalism originally formulated for homogeneous one-dimensional quantum systems.

•Jan 17, 2025•0 citations
Given a locally consistent set of reduced density matrices, we construct approximate density matrices which are globally consistent with the local density matrices we started from when the trial density matrix has a tree structure. We employ the cavity method of statistical physics to find the optimal density matrix representation by slowly decreasing the temperature in an annealing algorithm, or by minimizing an approximate Bethe free energy depending on the reduced density matrices and some cavity messages originated from the Bethe approximation of the entropy. We obtain the classical Bethe expression for the entropy within a naive (mean-field) approximation of the cavity messages, which is expected to work well at high temperatures. In the next order of the approximation, we obtain another expression for the Bethe entropy depending only on the diagonal elements of the reduced density matrices. In principle, we can improve the entropy approximation by considering more accurate cavity messages in the Bethe approximation of the entropy. We compare the annealing algorithm and the naive approximation of the Bethe entropy with exact and approximate numerical simulations for small and large samples of the random transverse Ising model on random regular graphs.
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 propose the variational quantum cavity method to construct a minimal energy subspace of wavevectors that are used to obtain some upper bounds for the energy cost of the low-temperature excitations. Given a trial wavefunction we use the cavity method of statistical physics to estimate the Hamiltonian expectation and to find the optimal variational parameters in the subspace of wavevectors orthogonal to the lower-energy wavefunctions. To this end, we write the overlap between two wavefunctions within the Bethe approximation, which allows us to replace the global orthogonality constraint with some local constraints on the variational parameters. The method is applied to the transverse Ising model and different levels of approximations are compared with the exact numerical solutions for small systems.
Determinants are useful to represent the state of an interacting system of (effectively) repulsive and independent elements, like fermions in a quantum system and training samples in a learning problem. A computationally challenging problem is to compute the sum of powers of principal minors of a matrix which is relevant to the study of critical behaviors in quantum fermionic systems and finding a subset of maximally informative training data for a learning algorithm. Specifically, principal minors of positive square matrices can be considered as statistical weights of a random point process on the set of the matrix indices. The probability of each subset of the indices is in general proportional to a positive power of the determinant of the associated submatrix. We use Gaussian representation of the determinants for symmetric and positive matrices to estimate the partition function (or free energy) and the entropy of principal minors within the Bethe approximation. The results are expected to be asymptotically exact for diagonally dominant matrices with locally treelike structures. We consider the Laplacian matrix of random regular graphs of degree K=2,3,4 and exactly characterize the structure of the relevant minors in a mean-field model of such matrices. No (finite-temperature) phase transition is observed in this class of diagonally dominant matrices by increasing the positive power of the principal minors, which here plays the role of an inverse temperature.
Abstract We study two free energy approximations (Bethe and plaquette-CVM) for the Random Field Ising Model in two dimensions. We compare results obtained by these two methods in single instances of the model on the square grid, showing the difficulties arising in defining a robust critical line. We also attempt average case calculations using a replica-symmetric ansatz, and compare the results with single instances. Both, Bethe and plaquette-CVM approximations present a similar panorama in the phase space, predicting long range order at low temperatures and fields. We show that plaquette-CVM is more precise, in the sense that predicts a lower critical line (the truth being no line at all). Furthermore, we give some insight on the non-trivial structure of the fixed points of different message passing algorithms. A study of the Monte Carlo dynamics for an arbitrary sample shows that GBP states are very well correlated with states that are attractors of the stochastic dynamics.
The inverse Ising problem consists in inferring the coupling constants of an Ising model given the correlation matrix. The fastest methods for solving this problem are based on mean-field approximations, but which one performs better in the general case is still not completely clear. In the first part of this work, I summarize the formulas for several mean- field approximations and I derive new analytical expressions for the Bethe approximation, which allow to solve the inverse Ising problem without running the Susceptibility Propagation algorithm (thus avoiding the lack of convergence). In the second part, I compare the accuracy of different mean field approximations on several models (diluted ferromagnets and spin glasses) defined on random graphs and regular lattices, showing which one is in general more effective. A simple improvement over these approximations is proposed. Also a fundamental limitation is found in using methods based on TAP and Bethe approximations in presence of an external field.
This work explores the cavity method from statistical physics as applied to systems of variables interacting on diluted graphs.The cavity approximation, originally conceived for studying disordered systems like spin glasses, has evolved into a versatile framework, providing message-passing algorithms such as belief propagation.Here we consider both static (equilibrium) and dynamic (non-equilibrium) scenarios, exploiting the effectiveness of the cavity approach in its analytical as well as algorithmic variations.The first chapter introduces the mathematical formulation of the cavity method as originated in physics and then re-invented in the fields of communications and computer science.In chapter two we study the closest vector problem, a prototypical task in discrete optimization with applications in cryptography and the theory of computational complexity.By means of a mapping to a spin glass model, the cavity method provides semi-analytical results for an infinite-size system.These are then compared with the outcome of approximate optimization on finite instances.Of particular interest is the interplay between phase transitions in the geometry of the space of solutions and the performance of optimization algorithms.In the third chapter, devoted to non-equilibrium dynamics, we introduce and develop the Matrix Product Belief Propagation (MPBP) algorithm for computing observables of Markov processes on graphs.We consider how reweighting a process, an operation which arises naturally when considering inverse problems and atypical trajectories, can lead to major computational challenges.By leveraging the matrix product state approximation from quantum mechanics, MPBP reduces computational complexity while maintaining high accuracy for dynamical models such as epidemic spreading and Glauber dynamics.vi Finally, chapter four contains ongoing work on an extension of MPBP able to describe the steady state of stochastic processes on graphs.This is done by exploiting the Uniform Matrix Product State (UMPS) formalism originally formulated for homogeneous one-dimensional quantum systems.