Efficient algorithms for approximating quantum partition functions

DOI10.1063/5.0013689zbMath1459.81034arXiv2004.11568OpenAlexW3018457802MaRDI QIDQ5855662

Ryan L. Mann, Tyler Helmuth

Publication date: 19 March 2021

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.11568

zbMATH Keywords

spin models at high temperature

Mathematics Subject Classification ID

Quantum computation (81P68) Spinor and twistor methods applied to problems in quantum theory (81R25) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Combinatorics and complexity of partition functions
• Large deviations for quantum spin systems
• The cluster expansion for classical and quantum lattice systems
• Cluster expansion for abstract polymer models
• The complexity of approximating complex-valued Ising and Tutte partition functions
• The Ising partition function: zeros and deterministic approximation
• Low temperature phase diagrams for quantum perturbations of classical spin systems
• Algorithmic Pirogov-Sinai theory
• Polynomial-Time Approximation Algorithms for the Ising Model
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Left and right convergence of graphs with bounded degree
• Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems
• Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
• Algorithms for #BIS-hard problems on expander graphs
• Computational Complexity
• Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

This page was built for publication: Efficient algorithms for approximating quantum partition functions