Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer

2009/05/31 by David Poulin, Pawel Wocjan · 1 citation
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physrevlett.103.220502

published as Phys. Rev. Lett. 103 220502 (2009)

arxiv created 2009/11/30 · arxiv updated 2013/05/29

Abstract

We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space dimension and alpha < 1/2 is proportional to the Helmholtz free energy density of the system. We also derive an algorithm to evaluate the partition function of a quantum system in a time proportional to the system's thermalization time and inversely proportional to the targeted accuracy squared.

Cited by

• Quantum Annealing Algorithms for Estimating Ising Partition Functions

Related

• Optimal quantum algorithm for Gibbs state preparation
• Quantum Thermal State Preparation
• Polynomial-time classical sampling of high-temperature quantum Gibbs states
• Preparing thermal states on noiseless and noisy programmable quantum processors
• Efficient Quantum Gibbs Sampling with Local Circuits