Fast optimization algorithms and the cosmological constant
Journal Article
·
· Physical Review D
- California Inst. of Technology (CalTech), Pasadena, CA (United States). Inst. for Quantum Information and Matter and Walter Burke Institute for Theoretical Physics
- Univ. of California, Berkeley, CA (United States). Center for Theoretical Physics and Dept. of Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Univ. of Maryland, College Park, MD (United States). Joint Center for Quantum Information and Computer Science; National Inst. of Standards and Technology (NIST), Gaithersburg, MD (United States)
- Univ. of Maryland, College Park, MD (United States). Joint Center for Quantum Information and Computer Science; Univ. of Maryland, College Park, MD (United States). Dept. of Computer Science and Mathematics
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10-120 in a randomly generated 109 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE; USDOE Office of Science (SC)
- Grant/Contract Number:
- AC02-05CH11231
- OSTI ID:
- 1420107
- Alternate ID(s):
- OSTI ID: 1408566
- Journal Information:
- Physical Review D, Journal Name: Physical Review D Journal Issue: 10 Vol. 96; ISSN PRVDAQ; ISSN 2470-0010
- Publisher:
- American Physical Society (APS)Copyright Statement
- Country of Publication:
- United States
- Language:
- English
Topological data analysis for the string landscape
|
journal | March 2019 |
Computational complexity of vacua and near-vacua in field and string theory
|
journal | February 2019 |
Similar Records
Search for Extra Dimensions at CDF
Grover Search and the No-Signaling Principle
Indirect Collider Tests of Large Extra Dimensions
Conference
·
Wed Aug 01 00:00:00 EDT 2007
·
OSTI ID:919093
Grover Search and the No-Signaling Principle
Journal Article
·
Tue Sep 13 20:00:00 EDT 2016
· Physical Review Letters
·
OSTI ID:1600495
Indirect Collider Tests of Large Extra Dimensions
Technical Report
·
Thu Oct 07 00:00:00 EDT 1999
·
OSTI ID:15067