Polynomial-Time Classical Simulation of Quantum Ferromagnets.
Phys Rev Lett
; 119(10): 100503, 2017 Sep 08.
Article
en En
| MEDLINE
| ID: mdl-28949162
ABSTRACT
We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, system size, and inverse temperature. As a consequence, we obtain a polynomial time algorithm which approximates the free energy or ground energy to a given additive error. We first show how to approximate the partition function by the perfect matching sum of a finite graph with positive edge weights. Although the perfect matching sum is not known to be efficiently approximable in general, the graphs obtained by our method have a special structure which facilitates efficient approximation via a randomized algorithm due to Jerrum and Sinclair.
Texto completo:
1
Colección:
01-internacional
Base de datos:
MEDLINE
Tipo de estudio:
Clinical_trials
Idioma:
En
Revista:
Phys Rev Lett
Año:
2017
Tipo del documento:
Article
País de afiliación:
Estados Unidos