Preparing thermal states of quantum systems by dimension reduction

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^{\Vert h\Vert /T}$, where $N$ is the size of the system, $\Vert h\Vert$ 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.

Published version. Minor editorial changes, one new reference added. 4 pages, 1 figure

References in corpus (7)

• The power of quantum systems on a line
• Optimal Quantum Measurements of Expectation Values of Observables
• Quantum Simulations of Classical Annealing Processes
• Quantum Graphical Models and Belief Propagation
• Quantum Belief Propagation
• The computational difficulty of finding MPS ground states
• Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs

Cited by in corpus (2)

• Quantum algorithm for simulating the dynamics of an open quantum system
• Thermal equilibration between two quantum systems