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:2409.02819 · Physical Review Letters

Provably Efficient Simulation of 1D Long-Range Interacting Systems at Any Temperature

Rakesh Achutha, Dong-Hoon Kim, Yusuke Kimura, Tomotaka Kuwahara

Published May 15, 2025• 8 citations
arXivHTMLPDF

Abstract

We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasipolynomial run-time for inverse temperatures up to β=poly(ln(n)). At the core of our approach is the density matrix renormalization group algorithm, which typically does not guarantee efficiency. We have created a new truncation scheme for the matrix product operator of the quantum Gibbs states, which allows us to control the error analytically. Additionally, our method can be applied to simulate the time evolution of systems with long-range interactions, achieving significantly better precision than that offered by the Lieb-Robinson bound.

DOI
10.1103/physrevlett.134.190404

Related papers

Precise evaluation of thermal response functions by optimized density matrix renormalization group schemes

Thomas Barthel

This paper provides a study and discussion of earlier as well as novel more efficient schemes for the precise evaluation of finite-temperature response functions of strongly correlated quantum systems in the framework of the time-dependent density matrix renormalization group (tDMRG). The computational costs and bond dimensions as functions of time and temperature are examined for the example of the spin-1/2 XXZ Heisenberg chain in the critical XY phase and the gapped Néel phase. The matrix product state purifications occurring in the algorithms are in a one-to-one relation with the corresponding matrix product operators. This notational simplification elucidates implications of quasi-locality on the computational costs. Based on the observation that there is considerable freedom in designing efficient tDMRG schemes for the calculation of dynamical correlators at finite temperatures, a new class of optimizable schemes, as recently suggested in Barthel, Schollwöck and Sachdev (2012 arXiv:1212.3570), is explained and analyzed numerically. A specific novel near-optimal scheme that requires no additional optimization reaches maximum times that are typically increased by a factor of 2, when compared against earlier approaches. These increased reachable times make many more physical applications accessible. For each of the described tDMRG schemes, one can devise a corresponding transfer matrix renormalization group variant.

arXiv:1301.2246•New Journal of Physics•Jul 2, 2013•93 citations

Optimal Quantum Algorithm for Gibbs State Preparation

Cambyse Rouzé, Daniel Stilck França, Alvaro Martin Alhambra

It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.

arXiv:2411.04885•Physical Review Letters•Jan 14, 2026•94 citations

Exponential Thermal Tensor Network Approach for Quantum Lattice Models

Bin-Bin Chen, Lei Chen, Ziyu Chen +2 more

We speed up thermal simulations of quantum many-body systems in both one-(1D) and twodimensional (2D) models in an exponential way by iteratively projecting the thermal density matrix ρ ¼ e -β Ĥ onto itself.We refer to this scheme of doubling β in each step of the imaginary time evolution as the exponential tensor renormalization group (XTRG).This approach is in stark contrast to conventional Trotter-Suzuki-type methods which evolve ρ on a linear quasicontinuous grid in inverse temperature β ≡ 1=T.As an aside, the large steps in XTRG allow one to swiftly jump across finite-temperature phase transitions, i.e., without the need to resolve each singularly expensive phase-transition point right away, e.g., when interested in low-energy behavior.A fine temperature resolution can be obtained, nevertheless, by using interleaved temperature grids.In general, XTRG can reach low temperatures exponentially fast and, thus, not only saves computational time but also merits better accuracy due to significantly fewer truncation steps.For similar reasons, we also find that the series expansion thermal tensor network approach benefits in both efficiency and precision, from the logarithmic temperature scale setup.We work in an (effective) 1D setting exploiting matrix product operators (MPOs), which allows us to fully and uniquely implement non-Abelian and Abelian symmetries to greatly enhance numerical performance.We use our XTRG machinery to explore the thermal properties of Heisenberg models on 1D chains and 2D square and triangular lattices down to low temperatures approaching ground-state properties.The entanglement properties, as well as the renormalization-group flow of entanglement spectra in MPOs, are discussed, where logarithmic entropies (approximately ln β) are shown in both spin chains and squarelattice models with gapless towers of states.We also reveal that XTRG can be employed to accurately simulate the Heisenberg XXZ model on the square lattice which undergoes a thermal phase transition.We determine its critical temperature based on thermal physical observables, as well as entanglement measures.Overall, we demonstrate that XTRG provides an elegant, versatile, and highly competitive approach to explore thermal properties, including finite-temperature thermal phase transitions as well as the different ordering tendencies at various temperature scales for frustrated systems.

arXiv:1801.00142•Physical Review X•Sep 26, 2018•108 citations

Efficient Simulation of One-Dimensional Quantum Many-Body Systems

Guifré Vidal

We present a numerical method to simulate the time evolution, according to a generic Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of entanglement involved in the simulated evolution. Numerical analysis indicates that this method can be used, for instance, to efficiently compute time-dependent properties of low-energy dynamics in sufficiently regular but otherwise arbitrary one-dimensional quantum many-body systems. As by-products, we describe two alternatives to the density matrix renormalization group method.

arXiv:quant-ph/0310089•Physical Review Letters•Jul 19, 2004•1,884 citations

One-dimensional quantum systems at finite temperatures can be simulated efficiently on classical computers

Thomas Barthel

It is by now well-known that ground states of gapped one-dimensional (1d) quantum-many body systems with short-range interactions can be studied efficiently using classical computers and matrix product state techniques. A corresponding result for finite temperatures was missing. Using the replica trick in 1+1d quantum field theory, it is shown here that the cost for the classical simulation of 1d systems at finite temperatures grows in fact only polynomially with the inverse temperature and is system-size independent -- even for gapless systems. In particular, we show that the thermofield double state (TDS), a purification of the equilibrium density operator, can be obtained efficiently in matrix-product form. The argument is based on the scaling behavior of Rényi entanglement entropies in the TDS. At finite temperatures, they obey the area law. For gapless systems with central charge $c$, the entanglement is found to grow only logarithmically with inverse temperature, $S_α\sim \frac{c}{6}(1+1/α)\log β$. The field-theoretical results are tested and confirmed by quasi-exact numerical computations for integrable and non-integrable spin systems, and interacting bosons.

arXiv:1708.09349•Aug 30, 2017•41 citations

Variational optimization algorithms for uniform matrix product states

Valentin Zauner-Stauber, Laurens Vanderstraeten, Matthew Fishman +2 more

We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.

arXiv:1701.07035•Physical review. B./Physical review. B•Jan 25, 2018•302 citations
We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasipolynomial run-time for inverse temperatures up to β=poly(ln(n)). At the core of our approach is the density matrix renormalization group algorithm, which typically does not guarantee efficiency. We have created a new truncation scheme for the matrix product operator of the quantum Gibbs states, which allows us to control the error analytically. Additionally, our method can be applied to simulate the time evolution of systems with long-range interactions, achieving significantly better precision than that offered by the Lieb-Robinson bound.
This paper provides a study and discussion of earlier as well as novel more efficient schemes for the precise evaluation of finite-temperature response functions of strongly correlated quantum systems in the framework of the time-dependent density matrix renormalization group (tDMRG). The computational costs and bond dimensions as functions of time and temperature are examined for the example of the spin-1/2 XXZ Heisenberg chain in the critical XY phase and the gapped Néel phase. The matrix product state purifications occurring in the algorithms are in a one-to-one relation with the corresponding matrix product operators. This notational simplification elucidates implications of quasi-locality on the computational costs. Based on the observation that there is considerable freedom in designing efficient tDMRG schemes for the calculation of dynamical correlators at finite temperatures, a new class of optimizable schemes, as recently suggested in Barthel, Schollwöck and Sachdev (2012 arXiv:1212.3570), is explained and analyzed numerically. A specific novel near-optimal scheme that requires no additional optimization reaches maximum times that are typically increased by a factor of 2, when compared against earlier approaches. These increased reachable times make many more physical applications accessible. For each of the described tDMRG schemes, one can devise a corresponding transfer matrix renormalization group variant.
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.
We speed up thermal simulations of quantum many-body systems in both one-(1D) and twodimensional (2D) models in an exponential way by iteratively projecting the thermal density matrix ρ ¼ e -β Ĥ onto itself.We refer to this scheme of doubling β in each step of the imaginary time evolution as the exponential tensor renormalization group (XTRG).This approach is in stark contrast to conventional Trotter-Suzuki-type methods which evolve ρ on a linear quasicontinuous grid in inverse temperature β ≡ 1=T.As an aside, the large steps in XTRG allow one to swiftly jump across finite-temperature phase transitions, i.e., without the need to resolve each singularly expensive phase-transition point right away, e.g., when interested in low-energy behavior.A fine temperature resolution can be obtained, nevertheless, by using interleaved temperature grids.In general, XTRG can reach low temperatures exponentially fast and, thus, not only saves computational time but also merits better accuracy due to significantly fewer truncation steps.For similar reasons, we also find that the series expansion thermal tensor network approach benefits in both efficiency and precision, from the logarithmic temperature scale setup.We work in an (effective) 1D setting exploiting matrix product operators (MPOs), which allows us to fully and uniquely implement non-Abelian and Abelian symmetries to greatly enhance numerical performance.We use our XTRG machinery to explore the thermal properties of Heisenberg models on 1D chains and 2D square and triangular lattices down to low temperatures approaching ground-state properties.The entanglement properties, as well as the renormalization-group flow of entanglement spectra in MPOs, are discussed, where logarithmic entropies (approximately ln β) are shown in both spin chains and squarelattice models with gapless towers of states.We also reveal that XTRG can be employed to accurately simulate the Heisenberg XXZ model on the square lattice which undergoes a thermal phase transition.We determine its critical temperature based on thermal physical observables, as well as entanglement measures.Overall, we demonstrate that XTRG provides an elegant, versatile, and highly competitive approach to explore thermal properties, including finite-temperature thermal phase transitions as well as the different ordering tendencies at various temperature scales for frustrated systems.
We present a numerical method to simulate the time evolution, according to a generic Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of entanglement involved in the simulated evolution. Numerical analysis indicates that this method can be used, for instance, to efficiently compute time-dependent properties of low-energy dynamics in sufficiently regular but otherwise arbitrary one-dimensional quantum many-body systems. As by-products, we describe two alternatives to the density matrix renormalization group method.
It is by now well-known that ground states of gapped one-dimensional (1d) quantum-many body systems with short-range interactions can be studied efficiently using classical computers and matrix product state techniques. A corresponding result for finite temperatures was missing. Using the replica trick in 1+1d quantum field theory, it is shown here that the cost for the classical simulation of 1d systems at finite temperatures grows in fact only polynomially with the inverse temperature and is system-size independent -- even for gapless systems. In particular, we show that the thermofield double state (TDS), a purification of the equilibrium density operator, can be obtained efficiently in matrix-product form. The argument is based on the scaling behavior of Rényi entanglement entropies in the TDS. At finite temperatures, they obey the area law. For gapless systems with central charge ccc, the entanglement is found to grow only logarithmically with inverse temperature, Sα∼c6(1+1/α)log⁡βS_α\sim \frac{c}{6}(1+1/α)\log βSα​∼6c​(1+1/α)logβ. The field-theoretical results are tested and confirmed by quasi-exact numerical computations for integrable and non-integrable spin systems, and interacting bosons.
We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.