Pith. sign in

REVIEW 4 cited by

Beyond Toy Models: Distilling Tensor Networks in Full AdS/CFT

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.01171 v5 pith:5JGZ6KOI submitted 2018-12-04 hep-th gr-qcquant-ph

Beyond Toy Models: Distilling Tensor Networks in Full AdS/CFT

classification hep-th gr-qcquant-ph
keywords tensornetworknetworksbulkholographicryu-takayanagisurfacesbond
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present a general procedure for constructing tensor networks that accurately reproduce holographic states in conformal field theories (CFTs). Given a state in a large-$N$ CFT with a static, semiclassical gravitational dual, we build a tensor network by an iterative series of approximations that eliminate redundant degrees of freedom and minimize the bond dimensions of the resulting network. We argue that the bond dimensions of the tensor network will match the areas of the corresponding bulk surfaces. For 'tree' tensor networks (i.e., those that are constructed by discretizing spacetime with non-intersecting Ryu-Takayanagi surfaces), our arguments can be made rigorous using a version of one-shot entanglement distillation in the CFT. Using the known quantum error correcting properties of AdS/CFT, we show that bulk legs can be added to the tensor networks to create holographic quantum error correcting codes. These codes behave similarly to previous holographic tensor network toy models, but describe actual bulk excitations in continuum AdS/CFT. By assuming some natural generalizations of the 'holographic entanglement of purification' conjecture, we are able to construct tensor networks for more general bulk discretizations, leading to finer-grained networks that partition the information content of a Ryu-Takayanagi surface into tensor-factorized subregions. While the granularity of such a tensor network must be set larger than the string/Planck scales, we expect that it can be chosen to lie well below the AdS scale. However, we also prove a no-go theorem which shows that the bulk-to-boundary maps cannot all be isometries in a tensor network with intersecting Ryu-Takayanagi surfaces.

discussion (0)

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

Forward citations

Cited by 4 Pith papers

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

  1. Entanglement Wedge Reconstruction and the Information Paradox

    hep-th 2019-05 unverdicted novelty 8.0

    A phase transition in the quantum RT surface at the Page time derives the Page curve and enables entanglement wedge reconstruction of the black hole interior from Hawking radiation.

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

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

    hep-th 2026-05 unverdicted novelty 7.0

    Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.

  4. Rethinking quantum information in gravity and fields

    hep-th 2026-06 unverdicted novelty 2.0

    The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.