Issue |
EPL
Volume 118, Number 1, April 2017
|
|
---|---|---|
Article Number | 10004 | |
Number of page(s) | 5 | |
Section | General | |
DOI | https://doi.org/10.1209/0295-5075/118/10004 | |
Published online | 30 May 2017 |
Polynomial complexity despite the fermionic sign
1 Laboratoire de Physique Statistique, Ecole Normale Supérieure, UPMC, Université Paris Diderot, CNRS 24 rue Lhomond, 75005 Paris, France
2 Department of Physics, University of Massachusetts - Amherst, MA 01003, USA
3 National Research Center “Kurchatov Institute” - 123182 Moscow, Russia
4 Wilczek Quantum Center, Zhejiang University of Technology - Hangzhou 310014, China
5 Laboratoire Kastler Brossel, Ecole Normale Supérieure, UPMC, CNRS, Collège de France 24 rue Lhomond, 75005 Paris, France
Received: 29 March 2017
Accepted: 10 May 2017
It is commonly believed that in unbiased quantum Monte Carlo approaches to fermionic many-body problems, the infamous sign problem generically implies prohibitively large computational times for obtaining thermodynamic-limit quantities. We point out that for convergent Feynman diagrammatic series evaluated with a recently introduced Monte Carlo algorithm (see Rossi R., arXiv:1612.05184), the computational time increases only polynomially with the inverse error on thermodynamic-limit quantities.
PACS: 02.70.Ss – Quantum Monte Carlo methods / 71.10.Fd – Lattice fermion models (Hubbard model, etc.)
© EPLA, 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.