| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations | Matthias Troyer
; Uwe-Jens Wiese
; | Rating: | Visitors: 1/5 (1 visitor) | Date: |
16 Aug 2004 | Journal: | Phys.Rev.Lett. 94 (2005) 170201 | Subject: | Statistical Mechanics; Strongly Correlated Electrons; Computational Physics; Computational Complexity | cond-mat.stat-mech cond-mat.str-el cs.CC hep-lat physics.comp-ph | Abstract: | 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. | Source: | arXiv, cond-mat/0408370 | Other source: | [GID 457811] pmid15904269 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |