Efficient Algorithms for Approximating Quantum Partition Functions

Ryan L. Mann*, Tyler Helmuth

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

14 Downloads (Pure)

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\v{c}n\`y 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.
Original languageEnglish
Article number022201
Number of pages8
JournalJournal of Mathematical Physics
Volume62
Issue number2
Early online date1 Feb 2021
DOIs
Publication statusPublished - 1 Feb 2021

Fingerprint

Dive into the research topics of 'Efficient Algorithms for Approximating Quantum Partition Functions'. Together they form a unique fingerprint.
  • QuantAlgo

    Montanaro, A. M. R.

    1/02/1822/08/21

    Project: Research

Cite this