University of Cambridge > Talks.cam > CQIF Seminar > Efficient Algorithms for Approximating Quantum Partition Functions

Efficient Algorithms for Approximating Quantum Partition Functions

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

If you have a question about this talk, please contact Damian Pitalua-Garcia.

We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Netočný and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs. This is joint work with Tyler Helmuth and is based on arXiv:2004.11568.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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