Speaker
Shirabe Endo
(KEK/SOKENDAI)
Description
Superstring theory can produce an enormous number of four-dimensional vacua of order 10^100, and most of these vacua have a negative cosmological constant. Since our universe has a small positive cosmological constant, we need to find such vacua. Computational methods are good approaches to this problem, but the necessary computational cost becomes a large issue. In this work, we investigate quantum algorithms as an approach to the vacuum-search problem. In this talk, we focus on the ADK toy model and discuss how much the computational complexity can be reduced by quantum algorithms. In particular, we show that reformulating the vacuum search as a collision problem leads to a larger quantum speedup.