Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

Details Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

2004-08-16

arxiv.org/abs/cond-mat/0408370v1

Phys.Rev.Lett. 94 (2005) 170201

Physics

Condensed Matter

Statistical Mechanics

4 pages

Scientific paper

10.1103/PhysRevLett.94.170201

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.

Affiliated with

Also associated with

No associations

Rating

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646597