pith. sign in

arxiv: 1706.07056 · v1 · pith:3FXUMKTYnew · submitted 2017-06-21 · ✦ hep-th · cond-mat.str-el· quant-ph

Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT

classification ✦ hep-th cond-mat.str-elquant-ph
keywords tensorcomplexitydimensionaloptimizationactioncftscontinuousentanglement
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks

    hep-th 2026-05 unverdicted novelty 7.0

    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...

  2. Universal Time Evolution of Holographic and Quantum Complexity

    hep-th 2025-07 unverdicted novelty 7.0

    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...

  3. Bridging Krylov Complexity and Universal Analog Quantum Simulator

    quant-ph 2026-05 unverdicted novelty 6.0

    Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.