Polynomial complexity despite the fermionic sign
Strongly Correlated Electrons
2017-06-13 v2 Quantum Gases
Abstract
It is commonly believed that in 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 the Monte Carlo algorithm of [Rossi, arXiv:1612.05184], the computational time increases only polynomially with the inverse error on thermodynamic-limit quantities.
Keywords
Cite
@article{arxiv.1703.10141,
title = {Polynomial complexity despite the fermionic sign},
author = {R. Rossi and N. Prokof'ev and B. Svistunov and K. Van Houcke and F. Werner},
journal= {arXiv preprint arXiv:1703.10141},
year = {2017}
}