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

Bulletin of the American Physical Society

Typical 1d quantum systems at finite temperatures can be simulated efficiently on classical computers

Thomas Barthel

Published Mar 8, 2018• 0 citations
OpenAlex

Related papers

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

Finite Temperature Simulation Based on Lanczos Algorithm for Low-Dimensional Quantum Systems

Tôru Sakai

Springer proceedings in physics•Jan 1, 2004•0 citations

Efficient Dynamical Simulation of Strongly Correlated One-Dimensional Quantum Systems

Stephen R. L. Clark, Dieter Jaksch

Lecture notes in computer science•Jan 1, 2006•1 citation

Quantum Finite Temperature Lanczos Method

Gian Gentinetta, Friederike Metz, William Kirby +1 more

The computation of thermal properties of quantum many-body systems is a central challenge in our understanding of quantum mechanics. We introduce the Quantum Finite Temperature Lanczos Method (QFTLM), which extends the finite-temperature Lanczos method to quantum computers by combining real-time quantum Krylov methods with efficient preparation of typical states for trace estimation. This approach enables the computation of thermal expectation values while avoiding the exponential scaling inherent to classical exact simulation techniques. Numerical experiments on the transverse-field Ising model show that QFTLM can reproduce thermal observables over a wide temperature range. We further analyze the influence of Krylov dimension, number of trace-estimator states, and Trotter error, and show that suitable regularization is essential for robustness in noisy settings. These results establish QFTLM as a promising framework for finite-temperature quantum simulation.

quant-pharXiv:2603.25394•Physical Review Research•Mar 27, 2026•3 citations

Efficient simulation of low-temperature physics in one-dimensional gapless systems

Yuya Kusuki, Kotaro Tamaoka, Zixia Wei +1 more

We discuss the computational efficiency of the finite-temperature simulation with minimally entangled typical thermal states (METTS). To argue that METTS can be efficiently represented as matrix product states, we present an analytic upper bound for the average entanglement R\'enyi entropy of METTS for a R\'enyi index $0<q\ensuremath{\le}1$. In particular, for one-dimensional (1D) gapless systems described by conformal field theories, the upper bound scales as $O(c{N}^{0}log\ensuremath{\beta})$ where $c$ is the central charge and $N$ is the system size. Furthermore, we numerically find that the average R\'enyi entropy exhibits a universal behavior characterized by the central charge and is roughly given by half of the analytic upper bound. Based on these results, we show that METTS can provide a speedup compared to employing the purification method to analyze thermal equilibrium states at low temperatures in 1D gapless systems.

arXiv:2309.02519•Physical review. B./Physical review. B•Jul 29, 2024•10 citations

Optimal quantum algorithms to simulate strongly correlated fermionic systems

Jiang Zhang, Kevin J. Sung, Kostyantyn Kechedzhi +2 more

Bulletin of the American Physical Society•Mar 7, 2018•0 citations
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.
The computation of thermal properties of quantum many-body systems is a central challenge in our understanding of quantum mechanics. We introduce the Quantum Finite Temperature Lanczos Method (QFTLM), which extends the finite-temperature Lanczos method to quantum computers by combining real-time quantum Krylov methods with efficient preparation of typical states for trace estimation. This approach enables the computation of thermal expectation values while avoiding the exponential scaling inherent to classical exact simulation techniques. Numerical experiments on the transverse-field Ising model show that QFTLM can reproduce thermal observables over a wide temperature range. We further analyze the influence of Krylov dimension, number of trace-estimator states, and Trotter error, and show that suitable regularization is essential for robustness in noisy settings. These results establish QFTLM as a promising framework for finite-temperature quantum simulation.
We discuss the computational efficiency of the finite-temperature simulation with minimally entangled typical thermal states (METTS). To argue that METTS can be efficiently represented as matrix product states, we present an analytic upper bound for the average entanglement R\'enyi entropy of METTS for a R\'enyi index $0<q\ensuremath{\le}1$. In particular, for one-dimensional (1D) gapless systems described by conformal field theories, the upper bound scales as $O(c{N}^{0}log\ensuremath{\beta})$ where ccc is the central charge and NNN is the system size. Furthermore, we numerically find that the average R\'enyi entropy exhibits a universal behavior characterized by the central charge and is roughly given by half of the analytic upper bound. Based on these results, we show that METTS can provide a speedup compared to employing the purification method to analyze thermal equilibrium states at low temperatures in 1D gapless systems.