REVIEW 2 cited by
Computational Complexity of Vacua and Near-Vacua in Field and String Theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Computational Complexity of Vacua and Near-Vacua in Field and String Theory
read the original abstract
We demonstrate that the problems of finding stable or metastable vacua in a low energy effective field theory requires solving nested NP-hard and co-NP-hard problems, while the problem of finding near-vacua is in P. Multiple problems relevant for computing effective potential contributions from string theory are shown to be instances of NP-hard problems. If P $\neq$ NP, the hardness of finding string vacua is exponential in the number of scalar fields. Cosmological implications, including for rolling solutions, are discussed in light of a recently proposed measure.
Forward citations
Cited by 2 Pith papers
-
Small Vacuum Energy and Tunneling in a Modified Bousso-Polchinski Model
In a wafer-modified Bousso-Polchinski model, 99.95% of the 532 million Calabi-Yau fourfold configurations in the Schöller-Skarke database allow vacuum energy spacings of 10^{-120} or smaller, with membrane nucleation ...
-
Axiverse Lampposts
In a hierarchical multi-axion theory with random couplings, axion field ranges shrink with 1/sqrt(N), generic axion–SM couplings are suppressed, but the QCD axion's coupling is unsuppressed.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.