Skip to main navigation Skip to search Skip to main content

Efficient Algorithms for Approximating Quantum Partition Functions

Ryan L. Mann*, Tyler Helmuth

*Corresponding author for this work

Research output: Contribution to journal › Article (Academic Journal) › peer-review

18 Citations (Scopus)
140 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

Access to Document

  • Full-text PDF (final published version)

    This is the final published version of the article (version of record). It first appeared online via American Institute of Physics at https://doi.org/10.1063/5.0013689 . Please refer to any applicable terms of use of the publisher.

    Final published version, 4.23 MBLicence: CC BY

Handle.net

    Fingerprint

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

    • QuantAlgo

      Montanaro, A. M. R. (Principal Investigator)

      1/02/18 → 22/08/21

      Project: Research

    Cite this