Quantum algorithms for conformal bootstrap
arXiv:1811.05675 · doi:10.1016/j.nuclphysb.2019.114702
Abstract
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.
arXiv comment22 pages, 2 figures
References in corpus (13)
- Quantum Computing in the NISQ era and beyond
- Complexity Equals Action
- The Conformal Bootstrap: Theory, Numerical Techniques, and Applications
- Complexity, action, and black holes
- Solving the 3d Ising Model with the Conformal Bootstrap II. c-Minimization and Precise Critical Exponents
- Quantum Algorithms for Quantum Field Theories
- Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
- Quantum Complexity and Negative Curvature
- BQP-completeness of Scattering in Scalar Quantum Field Theory
- Quantum Algorithms for Fermionic Quantum Field Theories
- A Semidefinite Program Solver for the Conformal Bootstrap
- Improvements in Quantum SDP-Solving with Applications
- N=4 Superconformal Bootstrap of the K3 CFT