Computational complexity of the landscape. I.
From MaRDI portal
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
- 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
- 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?)
- 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 cosmological constant problem
- The fundamental constants and their variation: observational and theoretical status
- The importance of the P versus NP question
- The NP-completeness column
- The statistics of supersymmetric D-brane models
- Threshold Computation and Cryptographic Security
Cited in
(46)- Computational complexity of the landscape. II: Cosmological considerations
- Inflation expels runaways
- Machine learning in the string landscape
- Artificial neural network in cosmic landscape
- Extremal bundles on Calabi-Yau threefolds
- Algorithmically solving the tadpole problem
- Moduli stabilization in asymptotic flux compactifications
- 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
- Topological data analysis for the string landscape
- Estimating Calabi-Yau hypersurface and triangulation counts with equation learners
- Higgs bundles and UV completion in \(F\)-theory
- Bounding the heat trace of a Calabi-Yau manifold
- The dark universe after reheating in string inflation
- Fluxes, vacua, and tadpoles meet Landau-Ginzburg and Fermat
- On finiteness of type IIB compactifications: magnetized branes on elliptic Calabi-Yau threefolds
- Rigour and rigidity: Systematics on particle physics D6-brane models on \(\mathbb{Z}_{2} \times \mathbb{Z}_{6}\)
- Quantum computation vs. firewalls
- On the computation of non-perturbative effective potentials in the string theory landscape -- IIB/F-theory perspective --
- Holomorphic couplings in non-perturbative string compactifications
- Classical transitions with the topological number changing in the early Universe
- The self-organized critical multiverse
- Accessibility measure for eternal inflation: dynamical criticality and Higgs metastability
- Search optimization, funnel topography, and dynamical criticality on the string landscape
- Early-time measure in eternal inflation
- Quantum master equation for the vacuum decay dynamics
- Explore and Exploit with Heterotic Line Bundle Models
- Ising Machines for Diophantine Problems in Physics
- A local Wheeler-DeWitt measure for the string landscape
- Neural network learning and quantum gravity
- Finiteness theorems and counting conjectures for the flux landscape
- Multiversal entropy and information conservation in black hole nucleated baby universes
- The computational complexity of the weak gravity conjecture
- On the complexity of quantum field theory
- Vacuum branching, dark energy, dark matter
- The DNA of Calabi-Yau hypersurfaces
- Mass-dependent minimal length and deformed quantum mechanics from heterotic string theory
- Polynomial roots and Calabi-Yau geometries
- 6D (1,1) gauged supergravities from orientifold compactifications
- Computational complexity of the landscape. I.
- Proton decay, Yukawa couplings and underlying gauge symmetry in string theory
- Moduli stabilization in non-geometric backgrounds
- Orientifolds, hypercharge embeddings and the standard model
- Tuning and backreaction in F-term axion monodromy inflation
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)
