Abstract

Dissipative quantum algorithms for quantum state preparation, including ground states and thermal states, are being increasingly commonly recognised for their promises of practical quantum advantage. Recent progress in algorithmic detailed-balanced Lindbladians allows one to construct and efficiently simulate the open system dynamics converging towards desired target states, however the end-to-end complexity of these algorithms is dependent on their mixing times. This quantity determines how long does it take to converge sufficiently close to the steady state. In this talk, I shall explain the construction of algorithmic Lindbladians for Gibbs state preparation, discuss the available techniques for bounding their mixing times, and present our results proving efficient mixing for weakly-interacting quantum systems.