作者: Matthias Troyer , Uwe-Jens Wiese
DOI: 10.1103/PHYSREVLETT.94.170201
关键词: NP 、 Time complexity 、 Numerical sign problem 、 Computational complexity theory 、 Computer science 、 Statistical physics 、 Diffusion Monte Carlo 、 Sign (mathematics) 、 Quantum Monte Carlo 、 Monte Carlo method
摘要: Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of computing time with number particles. A polynomial solution problem is highly desired since it would provide unbiased and numerically exact method simulate correlated quantum systems. Here we show that such a almost certainly unattainable by proving nondeterministic (NP) hard, implying generic also solve all problems in complexity class NP time.