Fetching the paper…
Reading the bibliography…
In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point.
Statistical theory of equations of state and phase transitions. ii. lattice gas and Ising model
Tsung-Dao Lee and Chen-Ning Yang · 1952
Earlier work this paper cites.
The nature of critical points
Michael Fisher · 1965
Earlier work this paper cites.
Gibbs states of a one dimensional quantum lattice
Huzihiro Araki · 1969
Earlier work this paper cites.
Correlation functionals of infinite volume quantum spin systems
William Greenberg · 1969
Earlier work this paper cites.
On the distribution of zeros for the Heisenberg model
Masuo Suzuki · 1969
Earlier work this paper cites.
Zeros of the partition function for the Heisenberg, ferroelectric, and general Ising models
Masuo Suzuki and Michael Fisher · 1971
Earlier work this paper cites.
The cluster expansion for classical and quantum lattice systems
Yong Moon Park · 1982
Earlier work this paper cites.
Cluster expansion for abstract polymer models
Roman Koteckỳ and David Preiss · 1986
Earlier work this paper cites.
Completely analytical interactions: constructive description
Roland Dobrushin and Senya Shlosman · 1987
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
Mark Jerrum and Alistair Sinclair · 1993
Earlier work this paper cites.
Estimates of semi-invariants for the Ising model at low temperatures
Roland Dobrushin · 1996
Earlier work this paper cites.
Complex analysis
Theodore Gamelin · 2003
Earlier work this paper cites.
Mixing in time and space for discrete spin systems
Dror Weitz · 2004
Earlier work this paper cites.
String-net condensation: A physical mechanism for topological phases
Michael Levin and Xiao-Gang Wen · 2005
Earlier work this paper cites.
Solving gapped hamiltonians locally
Matthew Hastings · 2006
Earlier work this paper cites.
Counting independent sets up to the tree threshold
Dror Weitz · 2006
Earlier work this paper cites.
Quantum belief propagation: An algorithm for thermal quantum systems
Matthew Hastings · 2007
Cited alongside, same era.
The complexity of stoquastic local Hamiltonian problems
Sergey Bravyi, David DiVincenzo, Roberto Oliveira, and Barbara Terhal · 2008
Cited alongside, same era.
The power of quantum systems on a line
Dorit Aharonov, Daniel Gottesman, Sandy Irani, and Julia Kempe · 2009
Cited alongside, same era.
Sampling from the thermal quantum gibbs state and evaluating partition functions with a quantum computer
David Poulin and Pawel Wocjan · 2009
Cited alongside, same era.
Computational transition at the uniqueness threshold
Allan Sly · 2010
Cited alongside, same era.
The computational hardness of counting in two-spin models on d d -regular graphs
Allan Sly and Nike Sun · 2012
Cited alongside, same era.
Finite correlation length implies efficient preparation of quantum thermal states
Fernando Brandão and Michael J Kastoryano · 2016
Later among the works it cites.
Quantum Gibbs samplers: the commuting case
Michael Kastoryano and Fernando Brandão · 2016
Later among the works it cites.
Rigorous RG algorithms and area laws for low energy eigenstates in 1D
Itai Arad, Zeph Landau, Umesh Vazirani, and Thomas Vidick · 2017
Later among the works it cites.
Polynomial-time classical simulation of quantum ferromagnets
Sergey Bravyi and David Gosset · 2017
Later among the works it cites.
Quantum algorithms for Gibbs sampling and hitting-time estimation
Anirban Narayan Chowdhury and Rolando Somma · 2017
Later among the works it cites.
Approximating the permanent of a random matrix with vanishing mean
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Product-state approximations to quantum ground states
Fernando Brandão and Aram Harrow · 2013
Cited alongside, same era.
Locality of temperature
Martin Kliesch, Christian Gogolin, MJ Kastoryano, A Riera, and J Eisert · 2014
Cited alongside, same era.
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Alistair Sinclair, Piyush Srivastava, and Marc Thurley · 2014
Cited alongside, same era.
Computing the partition function for cliques in a graph
Alexander Barvinok · 2015
Cited alongside, same era.
Monte Carlo simulation of stoquastic Hamiltonians
Sergey Bravyi · 2015
Cited alongside, same era.
Undecidability of the spectral gap
Toby S Cubitt, David Perez-Garcia, and Michael M Wolf · 2015
Cited alongside, same era.
Lior Eldar and Saeed Mehraban · 2017
Later among the works it cites.
Markovian matrix product density operators: Efficient computation of global entropy
Isaac Kim · 2017
Later among the works it cites.
Polynomial-time classical simulation for one-dimensional quantum gibbs states
Tomotaka Kuwahara and Keiji Saito · 2018
Later among the works it cites.
Approximation algorithms for complex-valued Ising models on bounded degree graphs
Ryan Mann and Michael Bremner · 2018
Later among the works it cites.
Location of zeros for the partition function of the Ising model on bounded degree graphs
Han Peters and Guus Regts · 2018
Later among the works it cites.
Classical algorithms for quantum mean values
Sergey Bravyi, David Gosset, and Ramis Movassagh · 2019
Closest in time.
Quantum approximate Markov chains are thermal
Kohtaro Kato and Fernando Brandão · 2019
Closest in time.
Private communication
Tomotaka Kuwahara, Kohtaro Kato, and Fernando Brandao · 2019
Closest in time.
Fisher zeros and correlation decay in the Ising model
Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava · 2019
Closest in time.
The Ising partition function: zeros and deterministic approximation
Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava · 2019
Closest in time.