Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

Simple item page
dc.creatorTroyer, Matthias
dc.creatorWiese, Uwe-Jens
dc.date2004-08-16
dc.date.accessioned2026-07-07T06:29:16Z
dc.date.available2026-07-07T06:29:16Z
dc.descriptionQuantum 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/cond-mat/0408370
dc.identifierhttp://arxiv.org/abs/cond-mat/0408370
dc.identifierPhys.Rev.Lett. 94 (2005) 170201
dc.identifierdoi:10.1103/PhysRevLett.94.170201
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/97972
dc.subjectStatistical Mechanics
dc.subjectStrongly Correlated Electrons
dc.subjectComputational Complexity
dc.subjectHigh Energy Physics - Lattice
dc.subjectComputational Physics
dc.titleComputational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
dc.typetext

Files

Collections

arXiv