Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Quantum Computing for Quantum Chemistry >  Dissipative quantum algorithms for thermal state preparation and their convergence times

Dissipative quantum algorithms for thermal state preparation and their convergence times

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Lila Cadi Tazi.

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.

This talk is part of the Quantum Computing for Quantum Chemistry series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2026 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity