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:2402.19030 · Journal of Mathematical Physics

A faster algorithm for the free energy in one-dimensional quantum systems

Samuel O. Scalet

Published Aug 1, 2024• 2 citations
arXivHTMLPDF

Abstract

We consider the problem of approximating the free energy density of a translation-invariant, one-dimensional quantum spin system with finite range. While the complexity of this problem is nontrivial due to its close connection to problems with known hardness results, a classical subpolynomial-time algorithm has recently been proposed [Fawzi et al., 2022]. Combining several algorithmic techniques previously used for related problems, we propose an algorithm outperforming this result asymptotically and give rigorous bounds on its runtime. Our main techniques are the use of Araki expansionals, known from results on the nonexistence of phase transitions, and a matrix product operator construction. We also review a related approach using the Quantum Belief Propagation [Kuwahara et al., 2018], which in combination with our findings yields an equivalent result.

DOI
10.1063/5.0218349

Related papers

A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit

Hamza Fawzi, Omar Fawzi, Samuel O. Scalet

We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at temperature $T = 0$) for these systems is expected to be computationally hard even for quantum computers, our algorithm runs for any fixed temperature $T > 0$ in subpolynomial time, i.e., in time $O((\frac{1}{\varepsilon})^{c})$ for any constant $c > 0$ where $\varepsilon$ is the additive approximation error. Previously, the best known algorithm had a runtime that is polynomial in $\frac{1}{\varepsilon}$. Our algorithm is also particularly simple as it reduces to the computation of the spectral radius of a linear map. This linear map has an interpretation as a noncommutative transfer matrix and has been studied previously to prove results on the analyticity of the free energy and the decay of correlations. We also show that the corresponding eigenvector of this map gives an approximation of the marginal of the Gibbs state and thereby allows for the computation of various thermodynamic properties of the quantum system.

arXiv:2209.14989•Leibniz international proceedings in informatics•Sep 29, 2022•4 citations

A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit

Hamza Fawzi, Omar Fawzi, Samuel O. Scalet

We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at temperature T=0 ) for these systems is expected to be computationally hard even for quantum computers, our algorithm runs for any fixed temperature T>0 in subpolynomial time, i.e., in time O((1ε)c) for any constant c>0 where ε is the additive approximation error. Previously, the best known algorithm had a runtime that is polynomial in 1ε . Our algorithm is also particularly simple as it reduces to the computation of the spectral radius of a linear map. This linear map has an interpretation as a noncommutative transfer matrix and has been studied previously to prove results on the analyticity of the free energy and the decay of correlations. We also show that the corresponding eigenvector of this map gives an approximation of the marginal of the Gibbs state and thereby allows for the computation of various thermodynamic properties of the quantum system.

Quantum•May 22, 2023•8 citations

Computing energy density in one dimension

Yichen Huang

We study the problem of computing energy density in one-dimensional quantum systems. We show that the ground-state energy per site or per bond can be computed in time (i) independent of the system size and subexponential in the desired precision if the ground state satisfies area laws for the Renyi entanglement entropy (this is the first rigorous formulation of the folklore that area laws imply efficient matrix-product-state algorithms); (ii) independent of the system size and polynomial in the desired precision if the system is gapped. As a by-product, we prove that in the presence of area laws (or even an energy gap) the ground state can be approximated by a positive semidefinite matrix product operator of bond dimension independent of the system size and subpolynomial in the desired precision of local properties.

arXiv:1505.00772•May 4, 2015•31 citations

Infinite size density matrix renormalization group, revisited

Ian P. McCulloch

I revisit the infinite-size variant of the Density Matrix Renormalization Group (iDMRG) algorithm for obtaining a fixed-point translationally invariant matrix product wavefunction in the context of one-dimensional quantum systems. A crucial ingredient of this algorithm is an efficient transformation for obtaining the matrix elements of the wavefunction as the lattice size is increased, and I introduce here a versatile transformation that is demonstrated to be much more effective than previous versions. The resulting algorithm has a surprisingly close relationship to Vidal's Time Evolving Block Decimation for infinite systems, but allows much faster convergence. Access to a translationally invariant matrix product state allows the calculation of correlation functions based on the transfer matrix, which directly gives the spectrum of all correlation lengths. I also show some advantages of the Matrix Product Operator (MPO) technique for constructing expectation values of higher moments, such as the exact variance $$.

arXiv:0804.2509•Apr 16, 2008•504 citations

Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians

Thiago Bergamaschi

The ground state energy and the free energy of Quantum Local Hamiltonians are fundamental quantities in quantum many-body physics, however, it is QMA-Hard to estimate them in general. In this paper, we develop new techniques to find classical, additive error product-state approximations for these quantities on certain families of Quantum $k$-Local Hamiltonians. Namely, those which are either dense, have low threshold rank, or are defined on a sparse graph that excludes a fixed minor, building on the methods and the systems studied by Brandão and Harrow, Gharibian and Kempe, and Bansal, Bravyi and Terhal. We present two main technical contributions. First, we discuss a connection between product-state approximations of local Hamiltonians and combinatorial graph property testing. We develop a series of weak Szemerédi regularity lemmas for $k$-local Hamiltonians, built on those of Frieze and Kannan and others. We use them to develop constant time sampling algorithms, and to characterize the `vertex sample complexity' of the Local Hamiltonian problem, in an analog to a classical result by Alon, de la Vega, Kannan and Karpinski. Second, we build on the information-theoretic product-state approximation techniques by Brandão and Harrow, extending their results to the free energy and to an asymmetric graph setting. We leverage this structure to define families of algorithms for the free energy at low temperatures, and new algorithms for certain sparse graph families.

arXiv:2210.08680•Leibniz international proceedings in informatics•Oct 17, 2022•9 citations

Near-Optimal Bounds on the Density of Low-Energy States of $k$-Local Hamiltonians and Faster Quantum Algorithms

Sevag Gharibian, François Le Gall, Ranitha Mataraarachchi +1 more

Low-energy estimation and state preparation for general $k$-local Hamiltonians are fundamental challenges in quantum complexity theory. Buhrman et al.~ [BGLGST, PRL 2025] recently broke the natural Grover bound $O^\ast(2^{n/2})$ for both problems, with the improvement depending on the relative accuracy $\varepsilon$ and the locality $k$. In this work, we present faster exponential quantum algorithms for these problems, where the binary entropy function governs the runtime exponent. For sufficiently small $\varepsilon/k$, our algorithms improve the exponent by a factor of $\log(k/\varepsilon)$ over [BGLGST, PRL 2025]. Our main technical result is an entropy-governed lower bound on the dimension of the Hamiltonian's low-energy subspace, obtained by depolarizing its ground state. For fixed $k$, this bound is optimal up to constant factors in the exponent. The same framework yields tighter bounds for Heisenberg, $XY$, and Ising models on arbitrary interaction graphs.

quant-pharXiv:2609.34532•Sep 29, 2026•0 citations
We consider the problem of approximating the free energy density of a translation-invariant, one-dimensional quantum spin system with finite range. While the complexity of this problem is nontrivial due to its close connection to problems with known hardness results, a classical subpolynomial-time algorithm has recently been proposed [Fawzi et al., 2022]. Combining several algorithmic techniques previously used for related problems, we propose an algorithm outperforming this result asymptotically and give rigorous bounds on its runtime. Our main techniques are the use of Araki expansionals, known from results on the nonexistence of phase transitions, and a matrix product operator construction. We also review a related approach using the Quantum Belief Propagation [Kuwahara et al., 2018], which in combination with our findings yields an equivalent result.
We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at temperature T=0T = 0T=0) for these systems is expected to be computationally hard even for quantum computers, our algorithm runs for any fixed temperature T>0T > 0T>0 in subpolynomial time, i.e., in time O((1ε)c)O((\frac{1}{\varepsilon})^{c})O((ε1​)c) for any constant c>0c > 0c>0 where ε\varepsilonε is the additive approximation error. Previously, the best known algorithm had a runtime that is polynomial in 1ε\frac{1}{\varepsilon}ε1​. Our algorithm is also particularly simple as it reduces to the computation of the spectral radius of a linear map. This linear map has an interpretation as a noncommutative transfer matrix and has been studied previously to prove results on the analyticity of the free energy and the decay of correlations. We also show that the corresponding eigenvector of this map gives an approximation of the marginal of the Gibbs state and thereby allows for the computation of various thermodynamic properties of the quantum system.
We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at temperature T=0 ) for these systems is expected to be computationally hard even for quantum computers, our algorithm runs for any fixed temperature T>0 in subpolynomial time, i.e., in time O((1ε)c) for any constant c>0 where ε is the additive approximation error. Previously, the best known algorithm had a runtime that is polynomial in 1ε . Our algorithm is also particularly simple as it reduces to the computation of the spectral radius of a linear map. This linear map has an interpretation as a noncommutative transfer matrix and has been studied previously to prove results on the analyticity of the free energy and the decay of correlations. We also show that the corresponding eigenvector of this map gives an approximation of the marginal of the Gibbs state and thereby allows for the computation of various thermodynamic properties of the quantum system.
We study the problem of computing energy density in one-dimensional quantum systems. We show that the ground-state energy per site or per bond can be computed in time (i) independent of the system size and subexponential in the desired precision if the ground state satisfies area laws for the Renyi entanglement entropy (this is the first rigorous formulation of the folklore that area laws imply efficient matrix-product-state algorithms); (ii) independent of the system size and polynomial in the desired precision if the system is gapped. As a by-product, we prove that in the presence of area laws (or even an energy gap) the ground state can be approximated by a positive semidefinite matrix product operator of bond dimension independent of the system size and subpolynomial in the desired precision of local properties.
I revisit the infinite-size variant of the Density Matrix Renormalization Group (iDMRG) algorithm for obtaining a fixed-point translationally invariant matrix product wavefunction in the context of one-dimensional quantum systems. A crucial ingredient of this algorithm is an efficient transformation for obtaining the matrix elements of the wavefunction as the lattice size is increased, and I introduce here a versatile transformation that is demonstrated to be much more effective than previous versions. The resulting algorithm has a surprisingly close relationship to Vidal's Time Evolving Block Decimation for infinite systems, but allows much faster convergence. Access to a translationally invariant matrix product state allows the calculation of correlation functions based on the transfer matrix, which directly gives the spectrum of all correlation lengths. I also show some advantages of the Matrix Product Operator (MPO) technique for constructing expectation values of higher moments, such as the exact variance $$.
The ground state energy and the free energy of Quantum Local Hamiltonians are fundamental quantities in quantum many-body physics, however, it is QMA-Hard to estimate them in general. In this paper, we develop new techniques to find classical, additive error product-state approximations for these quantities on certain families of Quantum kkk-Local Hamiltonians. Namely, those which are either dense, have low threshold rank, or are defined on a sparse graph that excludes a fixed minor, building on the methods and the systems studied by Brandão and Harrow, Gharibian and Kempe, and Bansal, Bravyi and Terhal. We present two main technical contributions. First, we discuss a connection between product-state approximations of local Hamiltonians and combinatorial graph property testing. We develop a series of weak Szemerédi regularity lemmas for kkk-local Hamiltonians, built on those of Frieze and Kannan and others. We use them to develop constant time sampling algorithms, and to characterize the `vertex sample complexity' of the Local Hamiltonian problem, in an analog to a classical result by Alon, de la Vega, Kannan and Karpinski. Second, we build on the information-theoretic product-state approximation techniques by Brandão and Harrow, extending their results to the free energy and to an asymmetric graph setting. We leverage this structure to define families of algorithms for the free energy at low temperatures, and new algorithms for certain sparse graph families.
Near-Optimal Bounds on the Density of Low-Energy States of kkk-Local Hamiltonians and Faster Quantum Algorithms
Low-energy estimation and state preparation for general kkk-local Hamiltonians are fundamental challenges in quantum complexity theory. Buhrman et al.~ [BGLGST, PRL 2025] recently broke the natural Grover bound O∗(2n/2)O^\ast(2^{n/2})O∗(2n/2) for both problems, with the improvement depending on the relative accuracy ε\varepsilonε and the locality kkk. In this work, we present faster exponential quantum algorithms for these problems, where the binary entropy function governs the runtime exponent. For sufficiently small ε/k\varepsilon/kε/k, our algorithms improve the exponent by a factor of log⁡(k/ε)\log(k/\varepsilon)log(k/ε) over [BGLGST, PRL 2025]. Our main technical result is an entropy-governed lower bound on the dimension of the Hamiltonian's low-energy subspace, obtained by depolarizing its ground state. For fixed kkk, this bound is optimal up to constant factors in the exponent. The same framework yields tighter bounds for Heisenberg, XYXYXY, and Ising models on arbitrary interaction graphs.