Brad Lackey: Optimization Algorithms and the Cosmological Constant
A talk by Brad Lackey at the Workshop on Computational Complexity and High Energy Physics, hosted July 31 to August 2, 2017 by the Joint Center for Quantum Information and Computer Science at the University of Maryland.
Abstract: We discuss the complexity associated to landscape models of the cosmological constant. One toy model of such leads to the cosmological constant being the solution to a number partitioning problem, an NP-complete family of problems. At first glance solving such a problem appears to require more work than is available to the causally connected component of the universe. We delve deeper into number partitioning problems and show however that when the number of field contributing to the landscape is very large (which is the case in such models) then number partition problems are easy, and even for sizes relevant to
landscape models for the cosmological constant can be solved with current hardware.