A simple and concise exposition of widely accessible techniques to construct classical algorithms.
SPEAKER: Dr Ryan Mann
AFFILIATION: University of Bristol, UK
TOPIC: Quantum Algorithms and Complexity
TITLE: Efficient Algorithms for Approximating Quantum Partition Functions
ABSTRACT: 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. https://arxiv.org/abs/2004.11568
HOSTED BY: Professor Michael Bremner, Centre for Quantum Software and Information, University of Technology Sydney, Australia
PROFILE PAGES:
Ryan Mann https://research-information.bris.ac.uk/en/persons/ryan-l-mann
Michael Bremner https://profiles.uts.edu.au/Michael.Bremner
SEMINAR WEBPAGE: https://www.uts.edu.au/research-and-teaching/our-research/centre-quantum-software-and-information/events/qsi-seminar-dr-ryan-mann-university-bristol
