BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Efficient Algorithms for Approximating Quantum Partition Functions
  - Ryan Mann\, University of Bristol
DTSTART:20211118T141500Z
DTEND:20211118T151500Z
UID:TALK164590@talks.cam.ac.uk
CONTACT:Damian Pitalua-Garcia
DESCRIPTION:We establish a polynomial-time approximation algorithm for par
 tition 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\, Perkin
 s\, and Regts. Similar results have previously been obtained by related me
 thods\, and our main contribution is a simple and slightly sharper analysi
 s for the case of pairwise interactions on bounded-degree graphs. This is 
 joint work with Tyler Helmuth and is based on arXiv:2004.11568.
LOCATION:MR3 Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR