  With the help of recent developments in quantum algorithms for semidefinite
programming, we discuss the possibility for quantum speedup for the numerical
conformal bootstrap in conformal field theory. We show that quantum algorithms
may have significant improvement in the computational performance for several
numerical bootstrap problems.
