Polynomial complexity despite the fermionic sign

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 ev...

Full description

Saved in:
Bibliographic Details
Published inEurophysics letters Vol. 118; no. 1; pp. 10004 - 10008
Main Authors Rossi, R., Prokof'ev, N., Svistunov, B., Van Houcke, K., Werner, F.
Format Journal Article
LanguageEnglish
Published Les Ulis EDP Sciences, IOP Publishing and Società Italiana di Fisica 01.04.2017
IOP Publishing
Subjects
02.70.Ss
71.10.Fd
Algorithms
Computing time
Polynomials
Thermodynamics
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:publisher-ID:epl18519
istex:41F3061FED5CE10EC10FE93DBD16BB12B7AF9586
ark:/67375/80W-9TV4G78C-W
ISSN:0295-5075
1286-4854
DOI:10.1209/0295-5075/118/10004