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:2510.19504 · Chinese Physics B

Practical algorithm for simulating thermal pure quantum states

Wenhua He, Yun-Tong Yang, Hong‐Gang Luo

Published Nov 6, 2025• 0 citations
arXivHTMLPDF

Abstract

Abstract The development of novel quantum many-body computational algorithms relies on robust benchmarking. However, generating such benchmarks is often hindered by the massive computational resources required for exact diagonalization or quantum Monte Carlo simulations, particularly at finite temperatures. In this work, we propose a new algorithm for obtaining thermal pure quantum states, which allows efficient computation of both mechanical and thermodynamic properties at finite temperatures. We implement this algorithm in our open-source C++ template library, Physica . Combining the improved algorithm with state-of-the-art software engineering, our implementation achieves high performance and numerical stability. As an example, we demonstrate that for the 4 × 4 Hubbard model, our method runs approximately 10 3 times faster than ℋ Φ 3.5.2. Moreover, the accessible temperature range is extended down to β = 32 across arbitrary doping levels. These advances significantly push forward the frontiers of benchmarking for quantum many-body systems.

DOI
10.1088/1674-1056/ae1c21

Related papers

Scalable tensor network algorithm for thermal quantum many-body systems in two dimensions

Meng Zhang, Hao Zhang, Chao Wang +1 more

Simulating strongly correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum many-body systems. We employ the (fermionic) projected entangled pair state to represent the vectorization of the quantum thermal state, and we utilize a stochastic reconfiguration method to cool down the quantum states from infinite temperature. We validate our method by benchmarking it against the two-dimensional antiferromagnetic Heisenberg model, the ${J}_{1}\ensuremath{-}{J}_{2}$ model, and the Fermi-Hubbard model, comparing physical properties such as internal energy, specific heat, and magnetic susceptibility with results obtained from stochastic series expansion, exact diagonalization, and determinant quantum Monte Carlo.

Physical review. B./Physical review. B•Feb 19, 2025•2 citations

Exploring finite temperature properties of materials with quantum computers

Connor Powers, Lindsay Bassman Oftelie, Daan Camps +1 more

Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.

arXiv:2109.01619•Scientific Reports•Feb 3, 2023•20 citations

Numerical validation of an ultracold Hubbard quantum simulator

Ben Currie, John Sturt, Evgeny Kozik

We apply the formally exact Diagrammatic Monte Carlo (DiagMC) method to probe the unprecedentedly low-temperature regime recently achieved in an ultracold-atom quantum simulation of the 2D Hubbard model [Xu et al., Nature 642, 909 (2025)]. Computing the experimentally measured observables directly in the thermodynamic limit with a priori control of systematic errors, we find striking agreement with the experimental data across all accessible temperatures -- including the lowest, where existing numerical benchmarks show significant deviations. This validates the quantum simulator's control over systematic errors in this challenging regime and delivers unbiased benchmarks for future method development. Our results demonstrate that classical algorithms remain competitive with state-of-the-art analogue quantum simulators, and emphasise the importance of controlled numerical methods for continuing the development of these experiments.

arXiv:2508.18041•Aug 25, 2025•0 citations

Scalable tensor network algorithm for thermal quantum many-body systems in two dimension

Meng Zhang, Hao Zhang, Chao Wang +1 more

Simulating strongly-correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum many-body systems. We employ the (fermionic) projected entangled pair state (PEPS) to represent the vectorization of the quantum thermal state and utilize a stochastic reconfiguration method to cool down the quantum states from infinite temperature. We validate our method by benchmarking it against the 2D antiferromagnetic Heisenberg model, the $J_1$-$J_2$ model, and the Fermi-Hubbard model, comparing physical properties such as internal energy, specific heat, and magnetic susceptibility with results obtained from stochastic series expansion (SSE), exact diagonalization, and determinant quantum Monte Carlo (DQMC).

arXiv:2409.05285•Sep 9, 2024•0 citations

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•0 citations

Optimal statistical ensembles for quantum thermal state preparation within the quantum singular value transformation framework

Yasushi Yoneta

Preparing thermal equilibrium states is an essential task for finite-temperature quantum simulations. In statistical mechanics, microstates in thermal equilibrium can be obtained from statistical ensembles. To date, numerous ensembles have been devised, ranging from Gibbs ensembles such as the canonical and microcanonical ensembles to a variety of generalized ensembles. Since these ensembles yield equivalent thermodynamic predictions, one can freely choose an ensemble for computational convenience. In this paper, we exploit this flexibility to develop an efficient quantum algorithm for preparing thermal equilibrium states. We first present a quantum algorithm for implementing generalized ensembles within the framework of quantum singular value transformation. We then perform a detailed analysis of the computational cost and elucidate its dependence on the choice of the ensemble. Our analysis shows that employing an appropriate ensemble can significantly mitigate ensemble-dependent overhead and yield improved scaling of the computational cost with system size compared to existing methods based on the canonical ensemble. We also numerically demonstrate that our approach achieves a significant reduction in the computational cost even for small finite-size systems. Our algorithm applies to arbitrary thermodynamic systems at any temperature and is thus expected to offer a practical and versatile method for computing finite-temperature properties of quantum many-body systems. These results highlight the potential of ensemble design as a powerful tool for enhancing the efficiency of a broad class of quantum algorithms.

arXiv:2505.06216•May 9, 2025•0 citations
Abstract The development of novel quantum many-body computational algorithms relies on robust benchmarking. However, generating such benchmarks is often hindered by the massive computational resources required for exact diagonalization or quantum Monte Carlo simulations, particularly at finite temperatures. In this work, we propose a new algorithm for obtaining thermal pure quantum states, which allows efficient computation of both mechanical and thermodynamic properties at finite temperatures. We implement this algorithm in our open-source C++ template library, Physica . Combining the improved algorithm with state-of-the-art software engineering, our implementation achieves high performance and numerical stability. As an example, we demonstrate that for the 4 × 4 Hubbard model, our method runs approximately 10 3 times faster than ℋ Φ 3.5.2. Moreover, the accessible temperature range is extended down to β = 32 across arbitrary doping levels. These advances significantly push forward the frontiers of benchmarking for quantum many-body systems.
Simulating strongly correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum many-body systems. We employ the (fermionic) projected entangled pair state to represent the vectorization of the quantum thermal state, and we utilize a stochastic reconfiguration method to cool down the quantum states from infinite temperature. We validate our method by benchmarking it against the two-dimensional antiferromagnetic Heisenberg model, the ${J}_{1}\ensuremath{-}{J}_{2}$ model, and the Fermi-Hubbard model, comparing physical properties such as internal energy, specific heat, and magnetic susceptibility with results obtained from stochastic series expansion, exact diagonalization, and determinant quantum Monte Carlo.
Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.
We apply the formally exact Diagrammatic Monte Carlo (DiagMC) method to probe the unprecedentedly low-temperature regime recently achieved in an ultracold-atom quantum simulation of the 2D Hubbard model [Xu et al., Nature 642, 909 (2025)]. Computing the experimentally measured observables directly in the thermodynamic limit with a priori control of systematic errors, we find striking agreement with the experimental data across all accessible temperatures -- including the lowest, where existing numerical benchmarks show significant deviations. This validates the quantum simulator's control over systematic errors in this challenging regime and delivers unbiased benchmarks for future method development. Our results demonstrate that classical algorithms remain competitive with state-of-the-art analogue quantum simulators, and emphasise the importance of controlled numerical methods for continuing the development of these experiments.
Simulating strongly-correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum many-body systems. We employ the (fermionic) projected entangled pair state (PEPS) to represent the vectorization of the quantum thermal state and utilize a stochastic reconfiguration method to cool down the quantum states from infinite temperature. We validate our method by benchmarking it against the 2D antiferromagnetic Heisenberg model, the J1J_1J1​-J2J_2J2​ model, and the Fermi-Hubbard model, comparing physical properties such as internal energy, specific heat, and magnetic susceptibility with results obtained from stochastic series expansion (SSE), exact diagonalization, and determinant quantum Monte Carlo (DQMC).
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.
Preparing thermal equilibrium states is an essential task for finite-temperature quantum simulations. In statistical mechanics, microstates in thermal equilibrium can be obtained from statistical ensembles. To date, numerous ensembles have been devised, ranging from Gibbs ensembles such as the canonical and microcanonical ensembles to a variety of generalized ensembles. Since these ensembles yield equivalent thermodynamic predictions, one can freely choose an ensemble for computational convenience. In this paper, we exploit this flexibility to develop an efficient quantum algorithm for preparing thermal equilibrium states. We first present a quantum algorithm for implementing generalized ensembles within the framework of quantum singular value transformation. We then perform a detailed analysis of the computational cost and elucidate its dependence on the choice of the ensemble. Our analysis shows that employing an appropriate ensemble can significantly mitigate ensemble-dependent overhead and yield improved scaling of the computational cost with system size compared to existing methods based on the canonical ensemble. We also numerically demonstrate that our approach achieves a significant reduction in the computational cost even for small finite-size systems. Our algorithm applies to arbitrary thermodynamic systems at any temperature and is thus expected to offer a practical and versatile method for computing finite-temperature properties of quantum many-body systems. These results highlight the potential of ensemble design as a powerful tool for enhancing the efficiency of a broad class of quantum algorithms.