Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
Aug, 2004Citations per year
Abstract: (arXiv)
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show, that such a solution is almost certainly unattainable by proving that the sign problem is NP-hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP (nondeterministic polynomial) in polynomial time.- 02.70.Ss
- 05.10.Ln
- Monte Carlo methods
- computational complexity
- fermion systems
- polynomials
References(10)
Figures(0)