Classical Estimation of the Free Energy and Quantum Gibbs Sampling from the Markov Entropy Decomposition
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We revisit the Markov Entropy Decomposition, a classical convex relaxation algorithm introduced by Poulin and Hastings to approximate the free energy in quantum spin lattices. We identify a sufficient condition for its convergence, namely the decay of the effective interaction. The effective interaction, also known as Hamiltonians of mean force, is a widely established correlation measure, and we show our decay condition in 1D at any temperature as well as in the high-temperature regime under a certain commutativity condition on the Hamiltonian building on existing results. This yields polynomial and quasi-polynomial time approximation algorithms in these settings, respectively. Furthermore, the decay of the effective interaction implies the decay of the conditional mutual information for the Gibbs state of the system. We then use this fact to devise a rounding scheme that maps the solution of the convex relaxation to a global state and show that the scheme can be efficiently implemented on a quantum computer, thus proving efficiency of quantum Gibbs sampling under our assumption of decay of the effective interaction.