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

Preparing Thermal States of Quantum Systems by Dimension Reduction

Ersen Bilgin, Sergio Boixo

Published Oct 22, 2010• 76 citations
arXivHTMLPDF

Abstract

We present an algorithm that prepares thermal Gibbs states of one dimensional quantum systems on a quantum computer without any memory overhead, and in a time significantly shorter than other known alternatives. Specifically, the time complexity is dominated by the quantity N(‖h‖/T), where N is the size of the system, ‖h‖ is a bound on the operator norm of the local terms of the Hamiltonian (coupling energy), and T is the temperature. Given other results on the complexity of thermalization, this overall scaling is likely optimal. For higher dimensions, our algorithm lowers the known scaling of the time complexity with the dimension of the system by one.

DOI
10.1103/physrevlett.105.170405

Related papers

Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with $Θ(n)$ ancilla qubits

Zhiyan Ding, Bowen Li, Ruizhe Zhang

We prove rapid convergence of a system-bath interaction algorithm for preparing Gibbs states of one-dimensional noncommuting Hamiltonians at every fixed positive temperature. For a chain of $n$ qudits of local dimension $2^q$ with bounded nearest-neighbor interactions, the algorithm prepares the Gibbs state from any initial state to trace-norm error $0<\varepsilon\le1/2$ in expected total Hamiltonian evolution time $\widetilde{O}(n/\varepsilon)$. This improves the previously proved $\widetilde{O}(n^6/\varepsilon)$ bound for single-ancilla system-bath Gibbs samplers, up to logarithmic factors. The proposed algorithm couples $4^q-1$ resettable bath qubits to each site in parallel and randomizes the interaction time. Our analysis bounds both the one-round approximation error and the stationarity defect of an approximate stationary state in Gibbs-weighted $L^2$ norms, with only linear dependence on the system size. It also uses the dephasing induced by randomized evolution to control the extensive Lamb shift without treating it as a small perturbation of the dissipative dynamics.

quant-pharXiv:2611.03422•Nov 3, 2026•0 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

Quantum algorithm for preparing thermal Gibbs states – detailed analysis

Chiang Chen-Fu, Paweł Wocjan

In a recent work [10], POULIN and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grover’s technique for quantum state engineering, and its running time is dominated by the factor (√D/𝒵β), where D and 𝒵βdenote the dimension of the quantum system and its partition function at inverse temperature β, respectively. We present here a modified algorithm and a more detailed analysis of the errors that arise due to imperfect simulation of Hamiltonian time evolutions and limited performance of phase estimation (finite accuracy and nonzero probability of failure). This modification together with the tighter analysis allows us to prove a better running time by the effect of these sources of error on the overall complexity. We think that the ideas underlying of our new analysis could also be used to prove a better performance of quantum Metropolis sampling by TEMME et al. [12].

arXiv:1001.1130•NATO science for peace and security series. D, Information and communication security•Jan 1, 2010•20 citations

Simulating Thermal Properties of Bose-Hubbard Models on a Quantum Computer

Simon Becker, Cambyse Rouzé, Robert Salzmann

While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states, provided that the spectral gap scales favourably with the number of modes. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. For the Gibbs sampler corresponding to the full Bose-Hubbard model, we obtain a spectral-gap lower bound $Ce^{-cn}$, where $n$ is the number of modes. We apply our results to provide a Gibbs-state preparation algorithm on qubit hardware, with runtime polynomial in the number of modes and the inverse spectral gap, and thereby obtain a quantum algorithm to compute thermal properties of the model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise.

quant-pharXiv:2604.06077•Apr 8, 2026•3 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•1 citation

Thermalization in Nature and on a Quantum Computer

Arnau Riera, Christian Gogolin, Jens Eisert

In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath couplings that is applicable even in the thermodynamic limit. We identify conditions under which thermalization happens and discuss the underlying physics. Based on these results, we also present a fully general quantum algorithm for preparing Gibbs states on a quantum computer with a certified runtime and error bound. This complements quantum Metropolis algorithms, which are expected to be efficient but have no known runtime estimates and only work for local Hamiltonians.

arXiv:1102.2389•Physical Review Letters•Feb 23, 2012•201 citations
We present an algorithm that prepares thermal Gibbs states of one dimensional quantum systems on a quantum computer without any memory overhead, and in a time significantly shorter than other known alternatives. Specifically, the time complexity is dominated by the quantity N(‖h‖/T), where N is the size of the system, ‖h‖ is a bound on the operator norm of the local terms of the Hamiltonian (coupling energy), and T is the temperature. Given other results on the complexity of thermalization, this overall scaling is likely optimal. For higher dimensions, our algorithm lowers the known scaling of the time complexity with the dimension of the system by one.
Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with Θ(n)Θ(n)Θ(n) ancilla qubits
We prove rapid convergence of a system-bath interaction algorithm for preparing Gibbs states of one-dimensional noncommuting Hamiltonians at every fixed positive temperature. For a chain of nnn qudits of local dimension 2q2^q2q with bounded nearest-neighbor interactions, the algorithm prepares the Gibbs state from any initial state to trace-norm error 0<ε≤1/20<\varepsilon\le1/20<ε≤1/2 in expected total Hamiltonian evolution time O~(n/ε)\widetilde{O}(n/\varepsilon)O(n/ε). This improves the previously proved O~(n6/ε)\widetilde{O}(n^6/\varepsilon)O(n6/ε) bound for single-ancilla system-bath Gibbs samplers, up to logarithmic factors. The proposed algorithm couples 4q−14^q-14q−1 resettable bath qubits to each site in parallel and randomizes the interaction time. Our analysis bounds both the one-round approximation error and the stationarity defect of an approximate stationary state in Gibbs-weighted L2L^2L2 norms, with only linear dependence on the system size. It also uses the dephasing induced by randomized evolution to control the extensive Lamb shift without treating it as a small perturbation of the dissipative dynamics.
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.
In a recent work [10], POULIN and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grover’s technique for quantum state engineering, and its running time is dominated by the factor (√D/𝒵β), where D and 𝒵βdenote the dimension of the quantum system and its partition function at inverse temperature β, respectively. We present here a modified algorithm and a more detailed analysis of the errors that arise due to imperfect simulation of Hamiltonian time evolutions and limited performance of phase estimation (finite accuracy and nonzero probability of failure). This modification together with the tighter analysis allows us to prove a better running time by the effect of these sources of error on the overall complexity. We think that the ideas underlying of our new analysis could also be used to prove a better performance of quantum Metropolis sampling by TEMME et al. [12].
While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce the first general rigorous Gibbs sampling framework for bosonic many-body systems, showing that physically relevant bosonic models admit gapped dissipative generators, enabling efficient preparation of thermal states, provided that the spectral gap scales favourably with the number of modes. Although our results hold for broad classes of models, we illustrate them using Bose-Hubbard Hamiltonians, both within and beyond the mean-field regime. In both cases, we show that the associated dissipative generators maintain a positive spectral gap, thereby implying exponential convergence to the thermal state. For the Gibbs sampler corresponding to the full Bose-Hubbard model, we obtain a spectral-gap lower bound Ce−cnCe^{-cn}Ce−cn, where nnn is the number of modes. We apply our results to provide a Gibbs-state preparation algorithm on qubit hardware, with runtime polynomial in the number of modes and the inverse spectral gap, and thereby obtain a quantum algorithm to compute thermal properties of the model. This provides the first mathematically controlled route to Gibbs sampling in infinite-dimensional systems, with implications for quantum simulation, thermalization, and many-body complexity, where quantum advantages may arise.
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.
In this work, we show how Gibbs or thermal states appear dynamically in closed quantum many-body systems, building on the program of dynamical typicality. We introduce a novel perturbation theorem for physically relevant weak system-bath couplings that is applicable even in the thermodynamic limit. We identify conditions under which thermalization happens and discuss the underlying physics. Based on these results, we also present a fully general quantum algorithm for preparing Gibbs states on a quantum computer with a certified runtime and error bound. This complements quantum Metropolis algorithms, which are expected to be efficient but have no known runtime estimates and only work for local Hamiltonians.