Computational complexity of the landscape: Part I
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
We study the computational complexity of the physical problem of finding vacua of string theory which agree with data, such as the cosmological constant, and show that such problems are typically NP hard. In particular, we prove that in the Bousso–Polchinski model, the problem is NP complete. We discuss the issues this raises and the possibility that, even if we were to find compelling evidence that some vacuum of string theory describes our universe, we might never be able to find that vacuum explicitly. In a companion paper, we apply this point of view to the question of how early cosmology might select a vacuum.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
The cosmological constant problem
Weinberg, S. (1989) · Reviews of Modern Physics · doi:10.1103/revmodphys.61.1 · Cited by 7,341
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Action integrals and partition functions in quantum gravity
Gibbons, G. W., & Hawking, S. W. (1977) · Physical Review D · doi:10.1103/physrevd.15.2752 · Cited by 3,449
Quantum Theory of Gravity. I. The Canonical Theory
DeWitt, B. S. (1967) · Physical Review · doi:10.1103/physrev.160.1113 · Cited by 3,385
Hartle, J. B., & Hawking, S. W. (1983) · Physical Review D · doi:10.1103/physrevd.28.2960 · Cited by 3,027
Funnels, pathways, and the energy landscape of protein folding: A synthesis
Bryngelson, J. D., Onuchic, J. N., Socci, N. D., & Wolynes, P. G. (1995) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340210302 · Cited by 2,648
Cited by
Four-dimensional string compactifications with D-branes, orientifolds and fluxes
Blumenhagen, R., Körs, B., Lüst, D., & Stieberger, S. (2007) · Physics Reports · doi:10.1016/j.physrep.2007.04.003 · Cited by 890
Baumann, D., & McAllister, L. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781316105733 · Cited by 532
The QCD axion and moduli stabilisation
Conlon, J. P. (2006) · Journal of High Energy Physics · doi:10.1088/1126-6708/2006/05/078 · Cited by 364
Les Houches Lectures on Constructing String Vacua
Frederik Denef, B. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.1194 · Cited by 319
Quantum computation vs. firewalls
Harlow, D., & Hayden, P. (2013) · Journal of High Energy Physics · doi:10.1007/jhep06(2013)085 · Cited by 310
“,54], which is the gold standard in evidence that a classical computation requires exponential time. Good reviews of the basic properties of NP-completeness and its possible relevance for physics are [20,55]. It will be important later that this additional source of computational diculty is relevant only if kis large.…”
BackgroundThe Cosmological Constant and the String Landscape
Polchinski, J. (2006) · arXiv · doi:10.48550/arxiv.hep-th/0603249 · Cited by 164
Algorithmic universality in F-theory compactifications
Halverson, J., Long, C., & Sung, B. (2017) · Physical Review D · doi:10.1103/physrevd.96.126006 · Cited by 71
Metadata
- Authors
- Denef, F., & Douglas, M. R.
- Venue
- Annals of Physics
- Publisher
- Elsevier BV
- Published
- 2007-05
- Volume
- 322
- Issue
- 5
- Pages
- 1096-1142
- ISSN
- 0003-4916 (ISSN-L)
- OpenAlex
- W1939025161
- Cited by
- 138
- References
- 22
- FWCI
- 6.25
- 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
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.