The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations
Open accessAbstract
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 nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
Greiner, M., Mandel, O., Esslinger, T., Hänsch, T. W., & Bloch, I. (2002) · Nature · doi:10.1038/415039a · Cited by 5,935
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“For some quantum systems, especially fermionic and frustrated systems, the numerical evaluation of the integrals encounters the problem of sampling with non-positive-semidefinite weight functions, which is the so-called sign problem [see, e.g. (Troyer and Wiese, 2005)].”
BackgroundSolving the quantum many-body problem with artificial neural networks
Carleo, G., & Troyer, M. (2017) · Science · doi:10.1126/science.aag2302 · Cited by 2,215
Self-citationQuantum simulations with trapped ions
Blatt, R., & Roos, C. F. (2012) · Nature Physics · doi:10.1038/nphys2252 · Cited by 1,629
Information processing in generalized probabilistic theories
Barrett, J. (2007) · Physical Review A · doi:10.1103/physreva.75.032304 · Cited by 768
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Metadata
- Authors
- Troyer, M., & Wiese, U.-J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-05-04
- Volume
- 94
- Issue
- 17
- Pages
- 170201-170201
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2017474131
- Cited by
- 1,246
- References
- 2
- FWCI
- 14.77
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations. https://app.cochat.ai/papers/10.1103/physrevlett.94.170201
- The paper
- Troyer, M., & Wiese, U.-J. (2005). Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations. Physical Review Letters. https://doi.org/10.1103/physrevlett.94.170201
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
