Miðbiksmat/Midway evaluation: Vyshnav Mohan

Title: Complexity, Bulk Reconstruction, and Semiclassical Black Holes

Abstract:  Quantum computational complexity is an information-theoretic measure that probes the finer details of the Hilbert space of a quantum system. We will study two of its avatars: Krylov complexity and holographic complexity. We will then show that the holographic complexity of any static d+1 dimensional black hole saturates at very late times. The saturation can be attributed to an infinite number of constrained instanton saddle points in the bulk.  Along the way, we will discuss how this saturation is intimately tied to the late-time behaviour of boundary correlation functions, bulk reconstruction of black hole interiors, and the principle of black hole complementarity.