Computational Complexity of Vacua and Near-Vacua in Field and String Theory

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 ≠ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…