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

Some problems of studying model Hamiltonians of statistical physics. I. General theorems for free energy

A. M. Kurbatov, S. S. Lapushkin

Published Oct 1, 1974• 0 citations
OpenAlex

Related papers

A method for studying model hamiltonians : a minimax principle for problems in statistical physics

N. N. Bogolyubov

A Method for Studying Model Hamiltonians: A Minimax Principle for Problems in Statistical Physics centers on methods for solving certain problems in statistical physics which contain four-fermion interaction. Organized into four chapters, this book begins with a presentation of the proof of the asymptotic relations for the many-time correlation functions. Chapter 2 details the construction of a proof of the generalized asymptotic relations for the many-time correlation averages. Chapter 3 explains the correlation functions for systems with four-fermion negative interaction. The last chapter sh

Pergamon Press eBooks•Jan 1, 1972•11 citations

Aspects of the study of model Hamiltonians of statistical physics

A. M. Kurbatov, S. S. Lapushkin

Theoretical and Mathematical Physics•Oct 1, 1974•2 citations

Approaches to the foundation and models of statistical mechanics based on quantum mechanics

Yuho Yokoi

•Mar 25, 2021•0 citations

Learning Generalized Statistical Mechanics with Matrix Product States

Pablo Díez-Valle, Fernando Martínez-García, Juan José García‐Ripoll +1 more

We introduce a variational algorithm based on Matrix Product States that is trained by minimizing a generalized free energy defined using Tsallis entropy instead of the standard Gibbs entropy. As a result, our model can generate the probability distributions associated with generalized statistical mechanics. The resulting model can be efficiently trained, since the resulting free energy and its gradient can be calculated exactly through tensor network contractions, as opposed to standard methods which require estimating the Gibbs entropy by sampling. We devise a variational annealing scheme by ramping up the inverse temperature, which allows us to train the model while avoiding getting trapped in local minima. We show the validity of our approach in Ising spin-glass problems by comparing it to exact numerical results and quasi-exact analytical approximations. Our work opens up new possibilities for studying generalized statistical physics and solving combinatorial optimization problems with tensor networks.

arXiv:2409.08352•Sep 12, 2024•0 citations

Some basic problems in the formulation of a relativistic statistical mechanics of interacting particles

Péter Havas

•Jan 1, 1965•5 citations

When a local Hamiltonian must be frustration-free

Or Sattath, Siddhardh C. Morampudi, Chris R. Laumann +1 more

A broad range of quantum optimization problems can be phrased as the question of whether a specific system has a ground state at zero energy, i.e., whether its Hamiltonian is frustration-free. Frustration-free Hamiltonians, in turn, play a central role for constructing and understanding new phases of matter in quantum many-body physics. Unfortunately, determining whether this is the case is known to be a complexity-theoretically intractable problem. This makes it highly desirable to search for efficient heuristics and algorithms to, at least, partially answer this question. Here we prove a general criterion-a sufficient condition-under which a local Hamiltonian is guaranteed to be frustration-free by lifting Shearer's theorem from classical probability theory to the quantum world. Remarkably, evaluating this condition proceeds via a fully classical analysis of a hardcore lattice gas at negative fugacity on the Hamiltonian's interaction graph, which, as a statistical mechanics problem, is of interest in its own right. We concretely apply this criterion to local Hamiltonians on various regular lattices, while bringing to bear the tools of spin glass physics that permit us to obtain new bounds on the satisfiable to unsatisfiable transition in random quantum satisfiability. We are then led to natural conjectures for when such bounds will be tight, as well as to a novel notion of universality for these computer science problems. Besides providing concrete algorithms leading to detailed and quantitative insights, this work underscores the power of marrying classical statistical mechanics with quantum computation and complexity theory.

arXiv:1509.07766•Proceedings of the National Academy of Sciences•May 19, 2016•22 citations
A Method for Studying Model Hamiltonians: A Minimax Principle for Problems in Statistical Physics centers on methods for solving certain problems in statistical physics which contain four-fermion interaction. Organized into four chapters, this book begins with a presentation of the proof of the asymptotic relations for the many-time correlation functions. Chapter 2 details the construction of a proof of the generalized asymptotic relations for the many-time correlation averages. Chapter 3 explains the correlation functions for systems with four-fermion negative interaction. The last chapter sh
We introduce a variational algorithm based on Matrix Product States that is trained by minimizing a generalized free energy defined using Tsallis entropy instead of the standard Gibbs entropy. As a result, our model can generate the probability distributions associated with generalized statistical mechanics. The resulting model can be efficiently trained, since the resulting free energy and its gradient can be calculated exactly through tensor network contractions, as opposed to standard methods which require estimating the Gibbs entropy by sampling. We devise a variational annealing scheme by ramping up the inverse temperature, which allows us to train the model while avoiding getting trapped in local minima. We show the validity of our approach in Ising spin-glass problems by comparing it to exact numerical results and quasi-exact analytical approximations. Our work opens up new possibilities for studying generalized statistical physics and solving combinatorial optimization problems with tensor networks.
A broad range of quantum optimization problems can be phrased as the question of whether a specific system has a ground state at zero energy, i.e., whether its Hamiltonian is frustration-free. Frustration-free Hamiltonians, in turn, play a central role for constructing and understanding new phases of matter in quantum many-body physics. Unfortunately, determining whether this is the case is known to be a complexity-theoretically intractable problem. This makes it highly desirable to search for efficient heuristics and algorithms to, at least, partially answer this question. Here we prove a general criterion-a sufficient condition-under which a local Hamiltonian is guaranteed to be frustration-free by lifting Shearer's theorem from classical probability theory to the quantum world. Remarkably, evaluating this condition proceeds via a fully classical analysis of a hardcore lattice gas at negative fugacity on the Hamiltonian's interaction graph, which, as a statistical mechanics problem, is of interest in its own right. We concretely apply this criterion to local Hamiltonians on various regular lattices, while bringing to bear the tools of spin glass physics that permit us to obtain new bounds on the satisfiable to unsatisfiable transition in random quantum satisfiability. We are then led to natural conjectures for when such bounds will be tight, as well as to a novel notion of universality for these computer science problems. Besides providing concrete algorithms leading to detailed and quantitative insights, this work underscores the power of marrying classical statistical mechanics with quantum computation and complexity theory.