pith. sign in

arxiv: 2605.23670 · v1 · pith:HJFKX4FInew · submitted 2026-05-22 · ✦ hep-th · quant-ph

Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks

Gurbir Arora , Matthew Headrick , Albion Lawrence , Martin Sasieta , Brian Swingle , Connor Wolfe This is my paper

Pith reviewed 2026-05-25 04:14 UTC · model grok-4.3

classification ✦ hep-th quant-ph
keywords tensor networksholographyPython's Lunch Conjecturecomputational covarianceRyu-Takayanagi formulablack hole complexityperfect tensors
0
0 comments X

The pith

Twirled perfect tensor networks satisfy computational covariance, bounding their complexity by the Python's Lunch value while obeying a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines twirled perfect tensor networks as a new class of models for black hole interiors, starting from the Python's Lunch Conjecture prediction of lower complexity for certain extended states. It shows that random tensor networks lack computational covariance and thus do not have their complexity controlled by the PLC exponent, while the proposed networks are constructed to satisfy this covariance property. As a result, the new networks have complexity bounded by the PLC value and still obey a lattice Ryu-Takayanagi formula for any boundary subregion, blending features of perfect and random tensor networks. A sympathetic reader would care because this gives an explicit construction that aligns tensor network fine structure with conjectured gravitational properties.

Core claim

The central claim is that tensor networks built from twirled perfect tensors satisfy the computational covariance property, allowing arbitrary decompositions into low-complexity units under basic rules. This property implies that their complexity is bounded by the PLC value, in contrast to generic random tensor networks where the exponential complexity is not controlled by the PLC exponent. These networks also obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.

What carries the argument

Twirled perfect tensors, which enforce computational covariance so that the network permits arbitrary low-complexity decompositions under basic rules.

If this is right

  • Network complexity remains bounded by the PLC exponent rather than generic exponential scaling.
  • The networks obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
  • A discrete limitation from local postselection persists, unlike in gravity.
  • The construction provides a flexible framework applicable beyond quantum gravity.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Such networks could enable more efficient classical simulations of black hole interior dynamics than fully random models.
  • Testing computational covariance in other discrete holographic codes might reveal whether it is required for matching gravitational entropy formulas.
  • The approach suggests designing tensor networks for quantum error correction that respect similar covariance constraints.

Load-bearing premise

The fine structure of tensor networks modeling gravity must obey computational covariance, allowing arbitrary decompositions into low-complexity units under basic rules.

What would settle it

Explicit construction of a small twirled perfect tensor network followed by direct computation of its circuit complexity to determine whether it exceeds the PLC bound.

Figures

Figures reproduced from arXiv: 2605.23670 by Albion Lawrence, Brian Swingle, Connor Wolfe, Gurbir Arora, Martin Sasieta, Matthew Headrick.

Figure 1
Figure 1. Figure 1: A semiclassical python’s lunch in EWA (gray). Concretely, the proposal is that Xc A divides EWA into two regions: the “simple wedge” on its exterior and the python’s lunch in its interior. On the one hand, decoding the region outside Xc A 3 [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Left: TN model of a python’s lunch, with three cuts associated with the minimal [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A local TN model of the python’s lunch. In gray, a foliation [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A planar python’s lunch (in blue) delimited in the transverse direction by the spatial [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: TN model of a planar python’s lunch. Two MERA TFDs are contracted together [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: The two RT candidates X1 B and X2 B . For ℓB > ℓM, the RT surface is X2 B , and the boundary satisfies the Markov chain condition I(A : C|B) = 0 at the classical level. MPS approach We also consider a second approach in which we model the state using a matrix product state (MPS) and then leverage known contraction methods. The idea is to replace each Markov length chunk with a single MPS tensor with approp… view at source ↗
Figure 7
Figure 7. Figure 7: An MPS TN model of a planar python’s lunch. We have divided the boundary into [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A step in the sideways contraction of the MPS representing the map [PITH_FULL_IMAGE:figures/full_fig_p016_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: A computationally covariant TN in a flat geometry admits a sequence of unitary maps [PITH_FULL_IMAGE:figures/full_fig_p020_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Left: histogram of the eigenvalues of R†R for a square Gaussian random tensor R with bond dimension D = 400, compared to the MP distribution at r = 1. The O(1) spread of the singular values indicates that the map is far from an isometry. Right: MP distribution for different values of r. As r decreases, the distribution becomes increasingly peaked around 1, converging to a delta function in the limit r → 0… view at source ↗
Figure 11
Figure 11. Figure 11: Left: the RTN map WRTN, acting from left to right. Right: the ground state and a first excited state of the classical Z2 Ising model on the network. The black arrows represent the pinning magnetic field, while the red and blue arrows correspond to Ising spins. The ground state corresponds to the red domain wall configuration at the minimal cut. The first excited state is obtained by flipping a single spin… view at source ↗
Figure 12
Figure 12. Figure 12: The α-bit restriction Wα : Hα → H(Xmax) is an approximate isometry, provided α is sufficiently small. If the RTN has a finer degree of locality close to the minimal cut, we expect α ≪ 1 (generally α ≲ O(1/|Xmin|)). Consider the classical Z2 Ising Hamiltonian (4.21) on the extended network, with pinning mag￾netic field hx = ( +1 , x ∈ Xα , −1 , x ∈ Xmax , (4.37) where Xα is the cut associated with the subs… view at source ↗
Figure 13
Figure 13. Figure 13: Implementation of the map of Fig [PITH_FULL_IMAGE:figures/full_fig_p035_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Example of TPTN consisting on the twirled HaPPY stabilizer qubit state. The TN [PITH_FULL_IMAGE:figures/full_fig_p042_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Effective stat mech model for the purity of [PITH_FULL_IMAGE:figures/full_fig_p045_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Operator pushing in the twirled HaPPY quantum error correcting code. [PITH_FULL_IMAGE:figures/full_fig_p048_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Left: A computationally covariant TN may admit slicings that are globally expanding [PITH_FULL_IMAGE:figures/full_fig_p049_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Comparison of different lengthscales for different values of [PITH_FULL_IMAGE:figures/full_fig_p055_18.png] view at source ↗
read the original abstract

We define a novel class of tensor networks motivated by the Python's Lunch Conjecture (PLC) in local tensor network models of the black hole interior. We start from the observation that, for extended black brane states with short-range correlations, the PLC predicts a complexity that is smaller than the upper bound for generic short-range correlated states. We argue that the PLC makes implicit assumptions about the fine structure of the relevant tensor networks modeling gravity that render them non-generic. We demonstrate this explicitly in random tensor network models of the python's lunch, where the exponential complexity is not generally controlled by the PLC exponent. We trace the difference with the PLC to a lack of "computational covariance" in random tensor networks: while the PLC is motivated by an ability to arbitrarily decompose space into low-complexity units provided certain basic rules are followed, we show that random tensor networks do not generically have this property. We propose another class of tensor networks built from what we call "twirled perfect tensors" that do satisfy the computational covariance property and have a complexity bounded by the PLC value. We still find a discrete limitation from local postselection that appears to be absent in gravity. Moreover, we show that this class of tensor networks combines desirable holographic features of perfect tensor networks and random tensor networks, for example, it obeys a lattice Ryu-Takayanagi formula for arbitrary boundary subregions. Though motivated by holography, these tensor networks provide a flexible framework with potential applications beyond quantum gravity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The paper defines twirled perfect tensor networks motivated by the Python's Lunch Conjecture (PLC) for local tensor network models of black hole interiors. It argues that random tensor networks lack computational covariance (the ability to arbitrarily decompose into low-complexity units under basic rules), so their complexity is not controlled by the PLC exponent, while the proposed twirled networks satisfy covariance, bound complexity by the PLC value, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions, thereby combining features of perfect and random tensor networks.

Significance. If the central claims hold, the construction supplies an explicit tensor-network realization of the fine-structure assumptions implicit in the PLC, yielding a complexity bound and an exact lattice RT formula that random networks lack. The explicit counter-example in random networks and the introduction of computational covariance as a distinguishing property are concrete contributions; the framework is noted to have potential uses outside quantum gravity.

major comments (1)
  1. [Abstract and the section defining the twirling operation and proving the RT property] The central claim that twirled perfect tensor networks obey an exact lattice RT formula for arbitrary boundary subregions (Abstract) is load-bearing for the assertion that the class 'combines desirable holographic features.' Because the construction is defined via twirling (an average over unitaries), the manuscript must demonstrate that the minimal-cut/entanglement-entropy equality holds instance-wise for each fixed network rather than only in expectation; otherwise the comparison to the exact RT formula in gravity is weakened.
minor comments (1)
  1. [Abstract] The abstract states that a 'discrete limitation from local postselection' remains; a one-sentence characterization of this limitation (and where it appears in the derivation) would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of our manuscript and for providing this constructive comment. We respond to the major comment below.

read point-by-point responses

  1. Referee: [Abstract and the section defining the twirling operation and proving the RT property] The central claim that twirled perfect tensor networks obey an exact lattice RT formula for arbitrary boundary subregions (Abstract) is load-bearing for the assertion that the class 'combines desirable holographic features.' Because the construction is defined via twirling (an average over unitaries), the manuscript must demonstrate that the minimal-cut/entanglement-entropy equality holds instance-wise for each fixed network rather than only in expectation; otherwise the comparison to the exact RT formula in gravity is weakened.

    Authors: We appreciate the referee pointing out this important distinction. In our construction, the twirling is applied to the perfect tensors to achieve computational covariance. However, the proof that the lattice RT formula holds is based on the isometry properties of the individual twirled tensors, which ensure that the minimal cut equals the entanglement entropy for each fixed choice of the unitaries in the twirl. The averaging is only over the ensemble to establish the covariance property, but the RT equality is deterministic for each network. We will revise the manuscript to include an explicit clarification in the relevant section that the equality holds instance-wise, strengthening the comparison to the gravitational RT formula. revision: yes

Circularity Check

0 steps flagged

No significant circularity; construction is self-contained.

full rationale

The paper defines a new class of 'twirled perfect tensor networks' motivated by the PLC and shows they satisfy computational covariance (leading to the complexity bound) while also obeying a lattice RT formula. This is presented as an explicit construction and demonstration rather than a derivation that reduces by construction to its inputs. No equations, self-citation chains, or fitted predictions are exhibited in the provided text that would trigger any of the enumerated circularity patterns. The distinction from random tensor networks is argued directly from their lack of the covariance property. The overall derivation chain remains independent of the target results.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no explicit free parameters, axioms, or invented entities; the PLC itself and the notion of computational covariance are treated as external inputs whose status is not audited here.

pith-pipeline@v0.9.0 · 5811 in / 1139 out tokens · 26204 ms · 2026-05-25T04:14:56.833854+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

78 extracted references · 72 canonical work pages · 24 internal anchors

  1. [1]

    Holographic Derivation of Entanglement Entropy from AdS/CFT

    S. Ryu, T. Takayanagi, “Holographic derivation of entanglement entropy from AdS/CFT” Phys. Rev. Lett.96(2006) 181602,arXiv:hep-th/0603001

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  2. [2]

    A Covariant Holographic Entanglement Entropy Proposal

    V. E. Hubeny, M. Rangamani, T. Takayanagi, “A Covariant holographic entanglement entropy proposal” JHEP07(2007) 062,arXiv:0705.0016 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  3. [3]

    Quantum corrections to holographic entanglement entropy

    T. Faulkner, A. Lewkowycz, J. Maldacena, “Quantum corrections to holographic entanglement entropy” JHEP11(2013) 074,arXiv:1307.2892 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  4. [4]

    Quantum Extremal Surfaces: Holographic Entanglement Entropy beyond the Classical Regime

    N. Engelhardt, A. C. Wall, “Quantum Extremal Surfaces: Holographic Entanglement Entropy beyond the Classical Regime” JHEP01(2015) 073,arXiv:1408.3203 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  5. [5]

    The Gravity Dual of a Density Matrix

    B. Czech, J. L. Karczmarek, F. Nogueira, M. Van Raamsdonk, “The Gravity Dual of a Density Matrix” Class. Quant. Grav.29(2012) 155009,arXiv:1204.1330 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  6. [6]

    Relative entropy equals bulk relative entropy

    D. L. Jafferis, A. Lewkowycz, J. Maldacena, S. J. Suh, “Relative entropy equals bulk relative entropy” JHEP06(2016) 004,arXiv:1512.06431 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  7. [7]

    Bulk Locality and Quantum Error Correction in AdS/CFT

    A. Almheiri, X. Dong, D. Harlow, “Bulk Locality and Quantum Error Correction in AdS/CFT” JHEP04(2015) 163,arXiv:1411.7041 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  8. [8]

    Reconstruction of Bulk Operators within the Entanglement Wedge in Gauge-Gravity Duality

    X. Dong, D. Harlow, A. C. Wall, “Reconstruction of Bulk Operators within the Entanglement Wedge in Gauge-Gravity Duality” Phys. Rev. Lett.117no. 2, (2016) 021601,arXiv:1601.05416 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  9. [9]

    Entanglement Wedge Reconstruction via Universal Recovery Channels

    J. Cotler, P. Hayden, G. Penington, G. Salton, B. Swingle, M. Walter, “Entanglement Wedge Reconstruction via Universal Recovery Channels” Phys. Rev. X9no. 3, (2019) 031011,arXiv:1704.05839 [hep-th]

    work page arXiv 2019

  10. [10]

    TASI Lectures on the Emergence of the Bulk in AdS/CFT

    D. Harlow, “TASI Lectures on the Emergence of Bulk Physics in AdS/CFT” PoS TASI2017(2018) 002,arXiv:1802.01040 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  11. [11]

    Entanglement Wedge Reconstruction using the Petz Map

    C.-F. Chen, G. Penington, G. Salton, “Entanglement Wedge Reconstruction using the Petz Map” JHEP01(2020) 168,arXiv:1902.02844 [hep-th]

    work page arXiv 2020

  12. [12]

    Leading order corrections to the quantum extremal surface prescription

    C. Akers, G. Penington, “Leading order corrections to the quantum extremal surface prescription” JHEP04(2021) 062,arXiv:2008.03319 [hep-th]

    work page arXiv 2021

  13. [13]

    Entanglement Renormalization and Holography

    B. Swingle, “Entanglement Renormalization and Holography” Phys. Rev. D86(2012) 065007,arXiv:0905.1317 [cond-mat.str-el]

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  14. [14]

    A class of quantum many-body states that can be efficiently simulated

    G. Vidal, “Class of Quantum Many-Body States That Can Be Efficiently Simulated” Phys. Rev. Lett.101(2008) 110501,arXiv:quant-ph/0610099. 60

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  15. [15]

    Holographic duality from random tensor networks

    P. Hayden, S. Nezami, X.-L. Qi, N. Thomas, M. Walter, Z. Yang, “Holographic duality from random tensor networks” JHEP11(2016) 009,arXiv:1601.01694 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  16. [16]

    Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence

    F. Pastawski, B. Yoshida, D. Harlow, J. Preskill, “Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence” JHEP06(2015) 149, arXiv:1503.06237 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  17. [17]

    The Ryu-Takayanagi Formula from Quantum Error Correction

    D. Harlow, “The Ryu–Takayanagi Formula from Quantum Error Correction” Commun. Math. Phys.354no. 3, (2017) 865–912,arXiv:1607.03901 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  18. [18]

    Quantum minimal surfaces from quantum error correction

    C. Akers, G. Penington, “Quantum minimal surfaces from quantum error correction” SciPost Phys.12no. 5, (2022) 157,arXiv:2109.14618 [hep-th]

    work page arXiv 2022

  19. [19]

    Hyperinvariant multiscale entanglement renormalization ansatz: Approximate holographic error correction codes with power-law correlations

    C. Cao, J. Pollack, Y. Wang, “Hyperinvariant multiscale entanglement renormalization ansatz: Approximate holographic error correction codes with power-law correlations” Phys. Rev. D105no. 2, (2022) 026018,arXiv:2103.08631 [quant-ph]

    work page arXiv 2022

  20. [20]

    Living on the Edge: A Toy Model for Holographic Reconstruction of Algebras with Centers

    W. Donnelly, B. Michel, D. Marolf, J. Wien, “Living on the Edge: A Toy Model for Holographic Reconstruction of Algebras with Centers” JHEP04(2017) 093, arXiv:1611.05841 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  21. [21]

    Emergent bulk gauge field in random tensor networks

    X.-L. Qi, “Emergent bulk gauge field in random tensor networks”arXiv:2209.02940 [hep-th]

    work page arXiv

  22. [22]

    Holographic tensor networks with bulk gauge symmetries

    X. Dong, S. McBride, W. W. Weng, “Holographic tensor networks with bulk gauge symmetries” JHEP02(2024) 222,arXiv:2309.06436 [hep-th]

    work page arXiv 2024

  23. [23]

    Approximate Bacon-Shor Code and Holography

    C. Cao, B. Lackey, “Approximate Bacon-Shor Code and Holography” JHEP05(2021) 127,arXiv:2010.05960 [hep-th]

    work page arXiv 2021

  24. [24]

    Holographic properties of superposed quantum geometries

    E. Colafranceschi, S. Langenscheidt, D. Oriti, “Holographic properties of superposed quantum geometries” Phys. Rev. D110no. 4, (2024) 046024,arXiv:2207.07625 [quant-ph]

    work page arXiv 2024

  25. [25]

    Background independent tensor networks

    C. Akers, A. Y. Wei, “Background independent tensor networks” SciPost Phys.17no. 3, (2024) 090,arXiv:2402.05910 [hep-th]

    work page arXiv 2024

  26. [26]

    Gravitational Backreaction is Magical

    C. Cao, G. Cheng, A. Hamma, L. Leone, W. Munizzi, S. F. E. Oliviero, “Gravitational Backreaction is Magical” PRX Quantum6no. 4, (2025) 040375,arXiv:2403.07056 [hep-th]

    work page arXiv 2025

  27. [27]

    State-dependent geometries from magic-enriched quantum codes

    C. Cao, G. Cheng, K. Karthikeyan, C. Li, J. Preskill, “State-dependent geometries from magic-enriched quantum codes”arXiv:2603.13475 [hep-th]

    work page arXiv

  28. [28]

    Anti-de Sitter Space from Optimization of Path Integrals in Conformal Field Theories

    P. Caputa, N. Kundu, M. Miyaji, T. Takayanagi, K. Watanabe, “Anti-de Sitter Space from Optimization of Path Integrals in Conformal Field Theories” Phys. Rev. Lett.119 no. 7, (2017) 071602,arXiv:1703.00456 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  29. [29]

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

    P. Caputa, N. Kundu, M. Miyaji, T. Takayanagi, K. Watanabe, “Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT” JHEP11 (2017) 097,arXiv:1706.07056 [hep-th]. 61

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  30. [30]

    CFTD from TQFTD+1 via Holographic Tensor Network, and Precision Discretization of CFT2

    L. Chen, K. Ji, H. Zhang, C. Shen, R. Wang, X. Zeng, L.-Y. Hung, “CFTD from TQFTD+1 via Holographic Tensor Network, and Precision Discretization of CFT2” Phys. Rev. X14no. 4, (2024) 041033,arXiv:2210.12127 [hep-th]

    work page arXiv 2024

  31. [31]

    Toward random tensor networks and holographic codes in CFT

    J. Chandra, T. Hartman, “Toward random tensor networks and holographic codes in CFT ” JHEP05(2023) 109,arXiv:2302.02446 [hep-th]

    work page arXiv 2023

  32. [32]

    Deriving the non-perturbative gravitational dual of quantum Liouville theory from BCFT operator algebra

    L. Chen, L.-Y. Hung, Y. Jiang, B.-X. Lao, “Deriving the non-perturbative gravitational dual of quantum Liouville theory from BCFT operator algebra”arXiv:2403.03179 [hep-th]

    work page arXiv

  33. [33]

    Building up quantum spacetimes with BCFT Legos

    L.-Y. Hung, Y. Jiang, “Building up quantum spacetimes with BCFT Legos” arXiv:2404.00877 [hep-th]

    work page arXiv

  34. [34]

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

    N. Bao, G. Penington, J. Sorce, A. C. Wall, “Beyond Toy Models: Distilling Tensor Networks in Full AdS/CFT” JHEP11(2019) 069,arXiv:1812.01171 [hep-th]

    work page arXiv 2019

  35. [35]

    Holographic Tensor Networks in Full AdS/CFT

    N. Bao, G. Penington, J. Sorce, A. C. Wall, “Holographic Tensor Networks in Full AdS/CFT”arXiv:1902.10157 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 1902

  36. [36]

    Toy Models of Holographic Duality between local Hamiltonians

    T. Kohler, T. Cubitt, “Toy Models of Holographic Duality between local Hamiltonians” JHEP08(2019) 017,arXiv:1810.08992 [hep-th]

    work page arXiv 2019

  37. [37]

    Holographic duality between local Hamiltonians from random tensor networks

    H. Apel, T. Kohler, T. Cubitt, “Holographic duality between local Hamiltonians from random tensor networks” JHEP03(2022) 052,arXiv:2105.12067 [hep-th]

    work page arXiv 2022

  38. [38]

    Continuous symmetries and approximate quantum error correction

    P. Faist, S. Nezami, V. V. Albert, G. Salton, F. Pastawski, P. Hayden, J. Preskill, “Continuous symmetries and approximate quantum error correction” Phys. Rev. X10 no. 4, (2020) 041018,arXiv:1902.07714 [quant-ph]

    work page arXiv 2020

  39. [39]

    Gauging the bulk: generalized gauging maps and holographic codes

    K. Dolev, V. Calvera, S. S. Cree, D. J. Williamson, “Gauging the bulk: generalized gauging maps and holographic codes” JHEP05(2022) 158,arXiv:2108.11402 [quant-ph]

    work page arXiv 2022

  40. [40]

    Multipartite edge modes and tensor networks

    C. Akers, R. M. Soni, A. Y. Wei, “Multipartite edge modes and tensor networks” SciPost Phys. Core7(2024) 070,arXiv:2404.03651 [hep-th]

    work page arXiv 2024

  41. [41]

    Diffeomorphism invariant tensor networks for 3d gravity

    V. Balasubramanian, C. Cummings, “Diffeomorphism invariant tensor networks for 3d gravity”arXiv:2510.13941 [hep-th]

    work page arXiv

  42. [42]

    Time Evolution of Entanglement Entropy from Black Hole Interiors

    T. Hartman, J. Maldacena, “Time Evolution of Entanglement Entropy from Black Hole Interiors” JHEP05(2013) 014,arXiv:1303.1080 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  43. [43]

    Addendum to Computational Complexity and Black Hole Horizons

    L. Susskind, “Computational Complexity and Black Hole Horizons” Fortsch. Phys.64 (2016) 24–43,arXiv:1403.5695 [hep-th]. [Addendum: Fortsch.Phys. 64, 44–48 (2016)]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  44. [44]

    The black hole interior from non-isometric codes and complexity

    C. Akers, N. Engelhardt, D. Harlow, G. Penington, S. Vardhan, “The black hole interior from non-isometric codes and complexity” JHEP06(2024) 155,arXiv:2207.06536 [hep-th]

    work page arXiv 2024

  45. [45]

    The Universe as a Quantum Encoder

    J. Cotler, A. Strominger, “The Universe as a Quantum Encoder”arXiv:2201.11658 [hep-th]. 62

    work page arXiv

  46. [46]

    Overlapping qubits from non-isometric maps and de Sitter tensor networks

    C. Cao, W. Chemissany, A. Jahn, Z. Zimborás, “Overlapping qubits from non-isometric maps and de Sitter tensor networks” Nature Commun.16no. 1, (2025) 163, arXiv:2304.02673 [hep-th]

    work page arXiv 2025

  47. [47]

    The Python’s Lunch: geometric obstructions to decoding Hawking radiation

    A. R. Brown, H. Gharibyan, G. Penington, L. Susskind, “The Python’s Lunch: geometric obstructions to decoding Hawking radiation” JHEP08(2020) 121,arXiv:1912.00228 [hep-th]

    work page arXiv 2020

  48. [48]

    Geometric surprises in the Python’s lunch conjecture

    G. Arora, M. Headrick, A. Lawrence, M. Sasieta, C. Wolfe, “Geometric surprises in the Python’s lunch conjecture” SciPost Phys.16no. 6, (2024) 152,arXiv:2401.06678 [hep-th]

    work page arXiv 2024

  49. [49]

    A world without pythons would be so simple

    N. Engelhardt, G. Penington, A. Shahbazi-Moghaddam, “A world without pythons would be so simple” Class. Quant. Grav.38no. 23, (2021) 234001,arXiv:2102.07774 [hep-th]

    work page arXiv 2021

  50. [50]

    Holographic representation of local bulk operators

    A. Hamilton, D. N. Kabat, G. Lifschytz, D. A. Lowe, “Holographic representation of local bulk operators” Phys. Rev. D74(2006) 066009,arXiv:hep-th/0606141

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  51. [51]

    Finding pythons in unexpected places

    N. Engelhardt, G. Penington, A. Shahbazi-Moghaddam, “Finding pythons in unexpected places” Class. Quant. Grav.39no. 9, (2022) 094002,arXiv:2105.09316 [hep-th]

    work page arXiv 2022

  52. [52]

    Cryptographic tests of the python’s lunch conjecture

    A. May, S. Pasterski, C. Waddell, M. Xu, “Cryptographic tests of the python’s lunch conjecture” SciPost Phys.19no. 4, (2025) 084,arXiv:2411.10527 [hep-th]

    work page arXiv 2025

  53. [53]

    Simulating Hamiltonian dynamics with a truncated Taylor series

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, R. D. Somma, “Simulating Hamiltonian Dynamics with a Truncated Taylor Series” Phys. Rev. Lett.114no. 9, (2015) 090502, arXiv:1412.4687 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  54. [54]

    Exponential improvement in precision for simulating sparse Hamiltonians

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, R. D. Somma, “Exponential improvement in precision for simulating sparse Hamiltonians” in46th annual ACM symposium on Theory of computing. 12, 2013.arXiv:1312.1414 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  55. [55]

    Asymptotically isometric codes for holography

    T. Faulkner, M. Li, “Asymptotically isometric codes for holography”arXiv:2211.12439 [hep-th]

    work page arXiv

  56. [56]

    Microscopic Origin of the Entropy of Black Holes in General Relativity

    V. Balasubramanian, A. Lawrence, J. M. Magan, M. Sasieta, “Microscopic Origin of the Entropy of Black Holes in General Relativity” Phys. Rev. X14no. 1, (2024) 011024, arXiv:2212.02447 [hep-th]

    work page arXiv 2024

  57. [57]

    Microscopic Origin of the Entropy of Astrophysical Black Holes

    V. Balasubramanian, A. Lawrence, J. M. Magan, M. Sasieta, “Microscopic Origin of the Entropy of Astrophysical Black Holes” Phys. Rev. Lett.132no. 14, (2024) 141501, arXiv:2212.08623 [hep-th]

    work page arXiv 2024

  58. [58]

    Reflected entropy in random tensor networks

    C. Akers, T. Faulkner, S. Lin, P. Rath, “Reflected entropy in random tensor networks” JHEP05(2022) 162,arXiv:2112.09122 [hep-th]

    work page arXiv 2022

  59. [59]

    Reflected entropy in random tensor networks. Part II. A topological index from canonical purification

    C. Akers, T. Faulkner, S. Lin, P. Rath, “Reflected entropy in random tensor networks. Part II. A topological index from canonical purification” JHEP01(2023) 067, arXiv:2210.15006 [hep-th]. 63

    work page arXiv 2023

  60. [60]

    Reflected entropy in random tensor networks. Part III. Triway cuts

    C. Akers, T. Faulkner, S. Lin, P. Rath, “Reflected entropy in random tensor networks. Part III. Triway cuts” JHEP12(2024) 209,arXiv:2409.17218 [hep-th]

    work page arXiv 2024

  61. [61]

    Distribution of eigenvalues for some sets of random matrices

    V. A. Marchenko, L. A. Pastur, “Distribution of eigenvalues for some sets of random matrices” Matematicheskii Sbornik114no. 4, (1967) 507–536

    1967

  62. [62]

    Bengtsson, K

    I. Bengtsson, K. Życzkowski,Geometry of quantum states: an introduction to quantum entanglement. Cambridge university press, 2017

    2017

  63. [63]

    Non-isometry, state dependence and holography

    S. Antonini, V. Balasubramanian, N. Bao, C. Cao, W. Chemissany, “Non-isometry, state dependence and holography” JHEP02(2025) 150,arXiv:2411.07296 [hep-th]

    work page arXiv 2025

  64. [64]

    Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit

    P. Hayden, G. Penington, “Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit” Commun. Math. Phys.374no. 2, (2020) 369–432,arXiv:1706.09434 [quant-ph]

    work page arXiv 2020

  65. [65]

    Learning the Alpha-bits of Black Holes

    P. Hayden, G. Penington, “Learning the Alpha-bits of Black Holes” JHEP12(2019) 007, arXiv:1807.06041 [hep-th]

    work page arXiv 2019

  66. [66]

    Computational Complexity of Isometric Tensor-Network States

    D. Malz, R. Trivedi, “Computational Complexity of Isometric Tensor-Network States” PRX Quantum6no. 2, (2025) 020310,arXiv:2402.07975 [quant-ph]

    work page arXiv 2025

  67. [67]

    Computational complexity of injective projected entangled pair states

    D. Harley, F. Witteveen, D. Malz, “Computational complexity of injective projected entangled pair states”arXiv:2509.19963 [quant-ph]

    work page arXiv

  68. [68]

    Absolutely maximally entangled pure states of multipartite quantum systems

    G. Rajchel-Mieldzioć, R. Bistroń, A. Rico, A. Lakshminarayan, K. Życzkowski, “Absolutely maximally entangled pure states of multipartite quantum systems” arXiv:2508.04777 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv

  69. [69]

    New multipartite entanglement measure and its holographic dual

    A. Gadde, V. Krishna, T. Sharma, “New multipartite entanglement measure and its holographic dual” Phys. Rev. D106no. 12, (2022) 126001,arXiv:2206.09723 [hep-th]

    work page arXiv 2022

  70. [70]

    Random circuits in the black hole interior

    J. M. Magan, M. Sasieta, B. Swingle, “Random circuits in the black hole interior” SciPost Phys.19no. 1, (2025) 007,arXiv:2412.08693 [hep-th]

    work page arXiv 2025

  71. [71]

    ER for typical EPR

    J. M. Magán, M. Sasieta, B. Swingle, “ER for typical EPR” Phys. Rev. Lett.135no. 16, (2025) 161601,arXiv:2504.07171 [hep-th]

    work page arXiv 2025

  72. [72]

    Quantum Gravity in the Lab. I. Teleportation by Size and Traversable Wormholes

    A. R. Brown, H. Gharibyan, S. Leichenauer, H. W. Lin, S. Nezami, G. Salton, L. Susskind, B. Swingle, M. Walter, “Quantum Gravity in the Lab. I. Teleportation by Size and Traversable Wormholes” PRX Quantum4no. 1, (2023) 010320,arXiv:1911.06314 [quant-ph]

    work page arXiv 2023

  73. [73]

    Building Holographic Entanglement by Measurement

    J. Jeffrey, L. Gandarias, M. Schleier-Smith, B. Swingle, “Building Holographic Entanglement by Measurement”arXiv:2601.21065 [quant-ph]

    work page arXiv

  74. [74]

    Black Holes at Exp-time

    L. Susskind, “Black Holes at Exp-time”arXiv:2006.01280 [hep-th]

    work page arXiv 2006

  75. [75]

    Smallest singular value of a random rectangular matrix

    M. Rudelson, R. Vershynin, “Smallest singular value of a random rectangular matrix” Communications on Pure and Applied Mathematics62no. 12, (2009) 1707–1739. 64

    2009

  76. [76]

    Vershynin,High-Dimensional Probability: An Introduction with Applications in Data Science

    R. Vershynin,High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2018

    2018

  77. [77]

    Concentration of the Spectral Measure for Large Matrices

    A. Guionnet, O. Zeitouni, “Concentration of the Spectral Measure for Large Matrices” Electronic Communications in Probability5no. none, (2000) 119 – 136

    2000

  78. [78]

    Mantegazza,Lecture notes on mean curvature flow, vol

    C. Mantegazza,Lecture notes on mean curvature flow, vol. 290. Springer Science & Business Media, 2011. 65

    2011