Efficient Algorithms for Approximating Quantum Partition Functions

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

• Ryan Mann, University of Bristol
• Thursday 18 November 2021, 14:15-15:15
• MR3 Centre for Mathematical Sciences.

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.

This talk is included in these lists:

• All CMS events
• CMS Events
• CQIF Seminar
• DAMTP info aggregator
• Hanchen DaDaDash
• Interested Talks
• MR3 Centre for Mathematical Sciences
• bld31

Note that ex-directory lists are not shown.