Polynomial complexity despite the fermionic sign. (30th May 2017)

• Record Type: Journal Article
• Authors: Rossi, R.; Prokof'ev, N.; Svistunov, B.; Van Houcke, K.; Werner, F.
• Is Part Of: Europhysics letters. Volume 118:Number 1(2017:Apr.)
• Publication Date: 2017-05-30
• Subjects: 02.70.Ss -- 71.10.Fd; Physics -- Periodicals; Electronic journals; 530.05
• DOI: 10.1209/0295-5075/118/10004
• Languages: English
• ISSNs: 0295-5075

Abstract

Abstract: 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.