Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT
read the original abstract
We propose an optimization procedure for Euclidean path-integrals that evaluate CFT wave functionals in arbitrary dimensions. The optimization is performed by minimizing certain functional, which can be interpreted as a measure of computational complexity, with respect to background metrics for the path-integrals. In two dimensional CFTs, this functional is given by the Liouville action. We also formulate the optimization for higher dimensional CFTs and, in various examples, find that the optimized hyperbolic metrics coincide with the time slices of expected gravity duals. Moreover, if we optimize a reduced density matrix, the geometry becomes two copies of the entanglement wedge and reproduces the holographic entanglement entropy. Our approach resembles a continuous tensor network renormalization and provides a concrete realization of the proposed interpretation of AdS/CFT as tensor networks. The present paper is an extended version of our earlier report arXiv:1703.00456 and includes many new results such as evaluations of complexity functionals, energy stress tensor, higher dimensional extensions and time evolutions of thermofield double states.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks are introduced as a class satisfying computational covariance, bounding complexity by the Python's Lunch Conjecture exponent, and combining holographic features of perfect and random te...
-
Universal Time Evolution of Holographic and Quantum Complexity
Holographic complexity measures show universal linear growth followed by late-time saturation, proven necessary and sufficient via pole structures in the energy basis using the residue theorem, arising from random mat...
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.