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

  Browse A-Z

Log in

Googledetails Microsoftdetails

πŸ” Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Efficient Algorithms for Approximating Quantum Partition Functions

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://zoom.us/j/99781367340 Room 2S5, Donald McIntyre Building, Faculty of Education, 184 Hills Road, Cambridge Department of Computer Science and technology, Lecture Theatre 1

Other talks

CONFERENCE: Chemical and material sciences enabled by AI and automation Genomic Medicine CPC Online Causal Inference Semina Title to be confirmed External Seminar - Hilde Nelissen TBC Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS
 

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