Parts | Days | Selection | Search | Updates | Downloads | Help

MP: Fachverband Theoretische und Mathematische Grundlagen der Physik

MP 1: Quantum Information and Complexity

MP 1.6: Talk

Monday, March 19, 2018, 18:15–18:35, Z6 - SR 1.012

Computational complexity in tensor networks and holography — •Ignacio Reyes — Institut fuer Theoretische Physik und Astronomie, Universitaet Wuerzburg, Am Hubland, 97074

We consider the proposal of subregion complexity in holography, which associates the volume enclosed by minimal surfaces in AdS-spaces (Ryu-Takayanagi surfaces) with computational complexity.

We argue that this measures the complexity of data-compression algorithm, and describe recent progress on how to match the calculations coming from AdS/CFT to explicit tensor network constructions, using MERA and random tensor networks. We consider black hole geometries.