Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Fast optimization algorithms and the cosmological constant

Journal Article · · Physical Review D
 [1];  [2];  [3];  [4]
  1. California Inst. of Technology (CalTech), Pasadena, CA (United States). Inst. for Quantum Information and Matter and Walter Burke Institute for Theoretical Physics
  2. Univ. of California, Berkeley, CA (United States). Center for Theoretical Physics and Dept. of Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
  3. 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)
  4. 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

References (62)

Easily searched encodings for number partitioning journal May 1996
Quantum computation vs. firewalls journal June 2013
Rescuing complementarity with little drama journal December 2016
Simulations of Closed Timelike Curves journal January 2017
The cosmological constant journal December 2007
Improved quantum ripple-carry addition circuit journal February 2016
Randomized methods for the number partitioning problem journal February 1996
A complete anytime algorithm for number partitioning journal December 1998
Computational complexity of the landscape: Part I journal May 2007
Probabilistic analysis of optimum partitioning journal September 1986
Determining computational complexity from characteristic ‘phase transitions’ journal July 1999
Planck 2015 results : XIII. Cosmological parameters journal September 2016
Planck 2015 results : X. Diffuse component separation: Foreground maps journal September 2016
Planck 2015 results : XVI. Isotropy and statistics of the CMB journal September 2016
Planck 2015 results : XXVI. The Second journal September 2016
Planck 2015 results : XXIII. The thermal Sunyaev-Zeldovich effect-cosmic infrared background correlation journal September 2016
Observational Evidence from Supernovae for an Accelerating Universe and a Cosmological Constant journal September 1998
Measurements of Ω and Λ from 42 High‐Redshift Supernovae journal June 1999
Holography in general space-times journal June 1999
A covariant entropy conjecture journal July 1999
Quantization of four-form fluxes and dynamical neutralization of the cosmological constant journal May 2000
Positive vacuum energy and the N -bound journal November 2000
Number partitioning as a random energy model journal April 2004
Closed timelike curves make quantum and classical computing equivalent journal October 2008
Quantum networks for elementary arithmetic operations journal July 1996
Cosmological event horizons, thermodynamics, and particle creation journal May 1977
de Sitter vacua in string theory journal August 2003
Predicting the cosmological constant from the causal entropic principle journal August 2007
Complementarity in the multiverse journal June 2009
Multiverse interpretation of quantum mechanics journal February 2012
Complexity, action, and black holes journal April 2016
Can Closed Timelike Curves or Nonlinear Quantum Mechanics Improve Quantum State Discrimination or Help Solve Hard Problems? journal October 2009
A Geometric Solution to the Coincidence Problem, and the Size of the Landscape as the Origin of Hierarchy journal March 2011
Grover Search and the No-Signaling Principle journal September 2016
Anthropic Bound on the Cosmological Constant journal November 1987
Nonlinear Quantum Mechanics Implies Polynomial-Time Solution for NP -Complete and # P Problems journal November 1998
Phase Transition in the Number Partitioning Problem journal November 1998
Random Costs in Combinatorial Optimization journal February 2000
Computational Capacity of the Universe journal May 2002
What is the Computational Value of Finite-Range Tunneling? journal August 2016
Flux compactification journal May 2007
Analysis of the Karmarkar-Karp differencing algorithm journal August 2008
Cosmological event horizons, thermodynamics, and particle creation book June 1993
The Cosmological Constant conference November 2011
Cosmological event horizons, thermodynamics, and particle creation book May 1993
Guest Column: NP-complete problems and physical reality journal March 2005
Computing Partitions with Applications to the Knapsack Problem journal April 1974
The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp journal February 1996
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning journal June 1991
Probabilistic analysis of optimum partitioning journal September 1986
Planck 2015 results. XIII. Cosmological parameters text January 2015
Grover search and the no-signaling principle text January 2015
What is the Computational Value of Finite Range Tunneling? text January 2015
Complexity, action, and black holes text January 2015
Rescuing Complementarity With Little Drama text January 2016
Number partitioning as random energy model text January 2004
Random Costs in Combinatorial Optimization text January 1999
Quantization of Four-form Fluxes and Dynamical Neutralization of the Cosmological Constant text January 2000
Predicting the Cosmological Constant from the Causal Entropic Principle text January 2007
A Covariant Entropy Conjecture text January 1999
Holography in General Space-times text January 1999
Quantum Networks for Elementary Arithmetic Operations text January 1995

Cited By (2)

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

Figures / Tables (6)


Similar Records

Search for Extra Dimensions at CDF
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