Computational complexity of the landscape: Part I

doi:10.1016/j.aop.2006.07.013

Title: Computational complexity of the landscape: Part I

Full Record
Other Related Research

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.

Authors:

Denef, Frederik ^[1]; Douglas, Michael R. ^[2]

NHETC and Department of Physics and Astronomy, Rutgers University, Piscataway, NJ 08855-0849 (United States). E-mail: frederik.denef@fys.kuleuven.be
NHETC and Department of Physics and Astronomy, Rutgers University, Piscataway, NJ 08855-0849 (United States) and I.H.E.S., Le Bois-Marie, Bures-sur-Yvette, 91440 (France). E-mail: mrd@physics.rutgers.edu

Publication Date:: Tue May 15 00:00:00 EDT 2007

OSTI Identifier:: 20976757

Resource Type:: Journal Article

Resource Relation:: Journal Name: Annals of Physics (New York); Journal Volume: 322; Journal Issue: 5; Other Information: DOI: 10.1016/j.aop.2006.07.013; PII: S0003-4916(06)00138-2; Copyright (c) 2006 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA)

Country of Publication:: United States

Language:: English

Subject:: 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; COSMOLOGICAL CONSTANT; COSMOLOGICAL MODELS; COSMOLOGY; STRING THEORY; UNIVERSE

Citation Formats


                    Denef, Frederik, and Douglas, Michael R. Computational complexity of the landscape: Part I.  United States: N. p., 2007. 
        Web.  doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    Denef, Frederik, & Douglas, Michael R. Computational complexity of the landscape: Part I.  United States.  doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    Denef, Frederik, and Douglas, Michael R. Tue .  
        "Computational complexity of the landscape: Part I".  United States.  
        doi:10.1016/j.aop.2006.07.013.

Copy to clipboard


                    
@article{osti_20976757,

  title        = {Computational complexity of the landscape: Part I},

  author       = {Denef, Frederik and Douglas, Michael R.},

  abstractNote = {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.},

  doi          = {10.1016/j.aop.2006.07.013},

  journal      = {Annals of Physics (New York)},

  number       = 5,

  volume       = 322,

  place        = {United States},

  year         = {Tue May 15 00:00:00 EDT 2007},

  month        = {Tue May 15 00:00:00 EDT 2007}

}

Copy to clipboard

Journal Article:

DOI: 10.1016/j.aop.2006.07.013

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Computational Knowledge for Toroidal Confinement Physics: Part I

Journal Article Chang, C. S. - AIP Conference Proceedings

Basic high level computational knowledge for studying the toroidal confinement physics is discussed. Topics include the primacy hierarchy of simulation quantities in statistical plasma physics, importance of the nonlinear-multiscale self-organization phenomena in a computational study, different types of codes for different applications, and different types of computer architectures for different types of codes.
DOI: 10.1063/1.3097323
Computational Tools for Exploration of the Energy Landscape in Protein-Protein Association

Journal Article Solernou, Albert ; Fernandez-Recio, Juan - AIP Conference Proceedings

We show here our work in structural prediction of protein-protein interactions. Our computational docking methodology has two major components: the sampling of mutual orientations of the interacting molecules, and the scoring and clustering of these orientations for the identification of near-native docking poses. Our procedure can generate a uniformly distributed set of rigid-body docking poses, which can be easily extended to explore the flexibility of the side-chains. The method is able to find near-native orientations in line with other state-of-the-art docking programs, and it has been successfully applied together with our pyDock scoring scheme in the most recent rounds ofmore »« less
DOI: 10.1063/1.3033364
Quantum computational complexity in the presence of closed timelike curves

Journal Article Bacon, Dave ; Department of Physics, California Institute of Technology, Pasadena, California 91125 - Physical Review. A

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which represents a valid quantification of resources given the ability to construct compact regions of closed timelike curves. The notion of self-consistent evolution for quantum computers whose components follow closed timelike curves, as pointed out by Deutsch [Phys. Rev. D 44, 3197 (1991)], implies that the evolution of the chronology respecting components which interact with the closed timelike curve components is nonlinear. We demonstratemore »« less
DOI: 10.1103/PhysRevA.70.032309
Toward a fundamental theory of optimal feature selection: Part II - Implementation and computational complexity

Journal Article Morgera, S.D. - IEEE Trans. Pattern Anal. Mach. Intell.; (United States)

Certain algorithms and their computational complexity are examined for use in a VLSI implementation of the real-time pattern classifier described in Part I of this work. The most computationally intensive processing is found in the classifier training mode wherein subsets of the largest and smallest eigenvalues and associated eigenvectors of the input data covariance pair must be computed. It is shown that if the matrix of interest is centrosymmetric and the method for eigensystem decomposition is operator-based, the problem architecture assumes a parallel form. Such a matrix structure is found in a wide variety of pattern recognition and speech andmore »« less
DOI: 10.1109/TPAMI.1987.4767870
Cosmological avatars of the landscape. I. Bracketing the supersymmetry breaking scale

Journal Article Holman, R. ; Mersini-Houghton, L. ; Takahashi, Tomo ; ... - Physical Review. D, Particles Fields

We investigate the effects of quantum entanglement between our horizon patch and others due to the tracing out of long wavelength modes in the wave function of the Universe as defined on a particular model of the landscape. In this, the first of two papers devoted to this topic, we find that the SUSY breaking scale is bounded both above and below: 10{sup -10}M{sub P}{<=}M{sub SUSY}{<=}10{sup -8}M{sub P} for grand unified theory (GUT) scale inflation. Bounds on the SUSY breaking parameter depend on the scale of inflation. If inflation occurred at GUT energies, the lower bound on b is atmore »« less
DOI: 10.1103/PHYSREVD.77.063510

Similar Records