Computational complexity of the landscape. I.
From MaRDI portal
(Redirected from Publication:877685)
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.
Recommendations
- Computational complexity of the landscape. II: Cosmological considerations
- Numerical polynomial homotopy continuation method and string vacua
- On the computation of non-perturbative effective potentials in the string theory landscape -- IIB/F-theory perspective --
- P/NP , and the quantum field computer
- scientific article; zbMATH DE number 1406123
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- BPP and the polynomial hierarchy
- Calabi-Yau four-folds for \(M\)- and \(F\)-theory compactifications
- Classical physics and the Church--Turing Thesis
- Computational Complexity
- Computational complexity of the landscape. I.
- Computers, Rigidity, and Moduli
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Critical points and supersymmetric vacua, III: String/M models
- De Sitter vacua in string theory
- Factoring polynomials with rational coefficients
- Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
- Fixing all moduli in a simple F-theory compactification
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity
- Optimization by simulated annealing
- PRIMES is in P
- Progress in quantum algorithms
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Saltatory relaxation of the cosmological constant
- Simulation of topological field theories by quantum computers
- The NP-completeness column
- The cosmological constant problem
- The fundamental constants and their variation: observational and theoretical status
- The importance of the P versus NP question
- The statistics of supersymmetric D-brane models
- Threshold Computation and Cryptographic Security
Cited in
(45)- Data science applications to string theory
- Higher spin de Sitter Hilbert space
- Searching the landscape of flux vacua with genetic algorithms
- Branes with brains: exploring string vacua with deep reinforcement learning
- Vacuum branching, dark energy, dark matter
- On finiteness of type IIB compactifications: magnetized branes on elliptic Calabi-Yau threefolds
- Quantum computation vs. firewalls
- Fluxes, vacua, and tadpoles meet Landau-Ginzburg and Fermat
- Topological data analysis for the string landscape
- Computational complexity of the landscape. I.
- Orientifolds, hypercharge embeddings and the standard model
- Accessibility measure for eternal inflation: dynamical criticality and Higgs metastability
- Quantum master equation for the vacuum decay dynamics
- Early-time measure in eternal inflation
- Inflation expels runaways
- Extremal bundles on Calabi-Yau threefolds
- Neural network learning and quantum gravity
- On the computation of non-perturbative effective potentials in the string theory landscape -- IIB/F-theory perspective --
- Finiteness theorems and counting conjectures for the flux landscape
- The DNA of Calabi-Yau hypersurfaces
- Bounding the heat trace of a Calabi-Yau manifold
- Proton decay, Yukawa couplings and underlying gauge symmetry in string theory
- Higgs bundles and UV completion in \(F\)-theory
- Tuning and backreaction in F-term axion monodromy inflation
- Rigour and rigidity: Systematics on particle physics D6-brane models on \(\mathbb{Z}_{2} \times \mathbb{Z}_{6}\)
- Polynomial roots and Calabi-Yau geometries
- 6D (1,1) gauged supergravities from orientifold compactifications
- Moduli stabilization in non-geometric backgrounds
- Ising Machines for Diophantine Problems in Physics
- Multiversal entropy and information conservation in black hole nucleated baby universes
- Explore and Exploit with Heterotic Line Bundle Models
- Algorithmically solving the tadpole problem
- Holomorphic couplings in non-perturbative string compactifications
- Moduli stabilization in asymptotic flux compactifications
- A local Wheeler-DeWitt measure for the string landscape
- The computational complexity of the weak gravity conjecture
- Estimating Calabi-Yau hypersurface and triangulation counts with equation learners
- The dark universe after reheating in string inflation
- Computational complexity of the landscape. II: Cosmological considerations
- Classical transitions with the topological number changing in the early Universe
- The self-organized critical multiverse
- Search optimization, funnel topography, and dynamical criticality on the string landscape
- Machine learning in the string landscape
- Artificial neural network in cosmic landscape
- On the complexity of quantum field theory
This page was built for publication: Computational complexity of the landscape. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877685)
