2021
DOI: 10.1007/jhep05(2021)009
|View full text |Cite|
|
Sign up to set email alerts
|

Building tensor networks for holographic states

Abstract: We discuss a one-parameter family of states in two-dimensional holographic conformal field theories which are constructed via the Euclidean path integral of an effective theory on a family of hyperbolic slices in the dual bulk geometry. The effective theory in question is the CFT flowed under a $$ T\overline{T} $$ T T ¯ deformation, which “folds” the boundary CFT towards the bulk time-reflection sym… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
36
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 20 publications
(38 citation statements)
references
References 75 publications
2
36
0
Order By: Relevance
“…To list a few, it will be very interesting to better understand and develop the Lorentzian setups that include matter and non-trivial dynamics as well as those that deal with de Sitter geometries. The connection between our setup with CMC slices and JHEP07(2021)016 holographic tensor networks from TT -deformations [31] also deserves further study, and may offer a way to definite finite cut-off corrections to the Liouville complexity action in order to match the correct holographic path-integral complexity. Understanding the role of the tension term (possibly its relation to the York time complexity proposals [84,85]) and, more generally, the emergence of time from tensor networks remains another interesting open problem.…”
Section: Jhep07(2021)016mentioning
confidence: 94%
See 2 more Smart Citations
“…To list a few, it will be very interesting to better understand and develop the Lorentzian setups that include matter and non-trivial dynamics as well as those that deal with de Sitter geometries. The connection between our setup with CMC slices and JHEP07(2021)016 holographic tensor networks from TT -deformations [31] also deserves further study, and may offer a way to definite finite cut-off corrections to the Liouville complexity action in order to match the correct holographic path-integral complexity. Understanding the role of the tension term (possibly its relation to the York time complexity proposals [84,85]) and, more generally, the emergence of time from tensor networks remains another interesting open problem.…”
Section: Jhep07(2021)016mentioning
confidence: 94%
“…Then, rewriting K ij and K in (3.49) in terms of T ij and T i i reproduces trace anomaly equation in a CFT deformed by the TT -operator with the coupling related to the finite-cut-off radius. This construction was recently generalized to TT deformations with time-dependent couplings [31] (see also [70] for discussion on the flow of quantum states under TT deformations that is relevant in our context) and studied from the perspective of holographic Tensor Networks as constant K slices of AdS. Interestingly, the explicit time-dependent "folding TT deformation" in CFTs, precisely corresponds to the bulk AdS geometry with time-dependent cut-off surfaces identical to the Q in (3.34).…”
Section: Jhep07(2021)016mentioning
confidence: 99%
See 1 more Smart Citation
“…A version of complexity restricted to local circuit modifications. In AdS/CFT, tensor networks have proven useful in gaining intuition about properties of the bulk semiclassical theory [38][39][40][41][42][43][44]. Roughly speaking, the tensor network lives on a tessellation of a bulk Cauchy slice.…”
Section: Jhep07(2021)011mentioning
confidence: 99%
“…1 In this setting, there is a relatively natural choice which leads to a unique definition of quantum complexity that is equivalent to the 1 An alternative approach to defining complexity draws intuition from path integrals in quantum field theory, and interprets quantum circuits as optimized procedures for performing such path integrals [35][36][37]. This approach builds on the tensor network formulation of holography [38][39][40][41][42][43][44]. For yet another approach to the analysis of complexity growth, this time making use of unitary k-designs and random circuits, see [45][46][47].…”
Section: Introductionmentioning
confidence: 99%