Preparing thermal states of quantum systems by dimension reduction
classification
🪐 quant-ph
keywords
complexityquantumtimealgorithmdimensionknownotherscaling
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.