Pith. sign in

REVIEW 2 minor 80 references

Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks

T0 review · 0 major / 2 minor · reviewed 2026-06-30 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Tensor networks from twirled perfect tensors satisfy computational covariance and bound complexity by the Python's Lunch Conjecture.

desk verdict Twirled perfect tensors fix computational covariance so random networks' PLC violation goes away while keeping lattice RT for arbitrary regions. read the letter →

arxiv 2605.23670 v2 pith:HJFKX4FI submitted 2026-05-22 hep-th quant-ph

Gurbir Arora , Matthew Headrick , Albion Lawrence , Martin Sasieta , Brian Swingle , Connor Wolfe This is my paper · ORCID
classification hep-thquant-ph
keywords tensornetworksPython'sLunchConjecturecomputationalcovarianceRyu-Takayanagiformulaholographyblackholecomplexityperfecttensors
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper argues that random tensor networks fail to capture black hole interior physics because they lack computational covariance, a property implicitly assumed by the Python's Lunch Conjecture. The authors introduce twirled perfect tensor networks that restore this covariance while retaining holographic features from both perfect and random tensor networks. These networks keep complexity controlled by the PLC exponent rather than a higher generic bound. They also satisfy a lattice Ryu-Takayanagi formula for arbitrary boundary subregions. This supplies a new class of models motivated by holography but applicable more broadly.

What carries the argument

Twirled perfect tensors, constructed to ensure computational covariance under arbitrary low-complexity decompositions of space while preserving holographic properties.

What would settle it

An explicit calculation in which the complexity of a twirled perfect tensor network exceeds the PLC exponent for some configuration would disprove the bounded-complexity claim.

Watch

Extended reading notes

Core claim

The central claim is that tensor networks built from twirled perfect tensors satisfy the computational covariance property, have complexity bounded by the PLC value, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions, unlike random tensor networks which fail to capture the fine structure assumed by the PLC.

Load-bearing premise

The Python's Lunch Conjecture assumes tensor networks modeling gravity possess a fine structure that enables computational covariance, which generic random networks lack.

Editorial extensions

If this is right

  • Complexity stays bounded by the PLC exponent rather than the generic upper bound.
  • A lattice Ryu-Takayanagi formula holds for arbitrary boundary subregions.
  • Desirable holographic features from perfect tensor networks and random tensor networks are combined in one construction.
  • A discrete limitation from local postselection remains, which appears absent in gravity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Holographic models may need non-generic fine structure beyond randomness to reproduce conjectured gravitational complexity bounds.
  • The framework could be tested in condensed-matter systems that require similar covariance under local operations.
  • Explicit constructions might clarify how gravity evades the postselection limitation present in these networks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The manuscript introduces 'twirled perfect tensors' as a novel class of 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 generically lack 'computational covariance,' resulting in exponential complexity not controlled by the PLC exponent, and proposes twirled perfect tensors that satisfy this covariance property with complexity bounded by the PLC value. The construction is shown to obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions while combining features of perfect tensor networks and random tensor networks, with an acknowledged residual limitation from local postselection.

Significance. If the central claims hold, the work supplies an explicit, covariant tensor network class that aligns more closely with PLC assumptions than generic random networks while preserving holographic properties such as the lattice RT formula. The explicit constructions, definitions of the twirling operation, and derivations establishing covariance and RT obedience constitute clear strengths, providing a flexible framework applicable beyond quantum gravity.

minor comments (2)
  1. [Abstract and §4] The abstract states that explicit demonstrations were performed in random tensor network models, but the main text should include a brief summary of the model dimensions, bond dimensions, and number of samples used to support the claim that exponential complexity is not controlled by the PLC exponent.
  2. [§3] The definition of the twirling operation and computational covariance would benefit from an explicit equation reference (e.g., the precise averaging procedure over unitaries) to make the independence from the PLC exponent fully transparent.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our manuscript, including the recognition of the explicit constructions, definitions of the twirling operation, and derivations for computational covariance and the lattice RT formula. We appreciate the recommendation for minor revision and will incorporate any editorial suggestions in the revised version. No major comments were raised in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper defines twirled perfect tensors explicitly via a twirling operation on perfect tensors, then derives computational covariance, PLC-bounded complexity, and the lattice RT formula directly from these definitions and explicit constructions. Random tensor networks are shown to lack covariance via counterexamples in the same framework. No step reduces a claimed prediction to a fitted input, self-citation chain, or imported uniqueness theorem; the central results follow from the supplied algebraic and network properties without circular reduction.

Assumptions & free parameters 0 free parameters · 2 assumptions · 2 invented entities

The central claim rests on the domain assumption that the Python's Lunch Conjecture correctly describes the complexity of gravity-modeled states and that the fine-structure assumptions implicit in the conjecture are the reason random networks deviate from it. No free parameters are mentioned. The new entities are introduced by definition without independent evidence outside the construction.

assumptions (2)
  • domain assumption The Python's Lunch Conjecture applies to local tensor network models of the black hole interior and predicts lower complexity for extended black brane states with short-range correlations.
    The paper begins from this observation and uses it to motivate the need for non-generic networks.
  • domain assumption Random tensor networks do not generically possess computational covariance.
    The difference with the PLC is traced to this lack, demonstrated explicitly in the random models.
invented entities (2)
  • twirled perfect tensors
    purpose: Tensor networks that satisfy computational covariance and therefore have complexity bounded by the PLC while obeying a lattice Ryu-Takayanagi formula.
    New class defined in the paper; no independent evidence outside the definition is provided.
  • computational covariance
    purpose: Property that allows arbitrary decomposition of space into low-complexity units under basic rules, absent in random networks.
    Introduced as the key distinguishing feature; defined within the paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks." pith.science (2026). https://pith.science/paper/HJFKX4FI

@misc{pith2026260523670,
  author       = {Pith},
  title        = {Pith review of: Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HJFKX4FI}},
  note         = {Machine review of arXiv:2605.23670}
}
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.

Figures

Figures reproduced from arXiv: 2605.23670 by the authors.

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. 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. 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 ↗
Figures from the paper (18 more)
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]
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]
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 s…
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]
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]
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]
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 dif…
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 gro…
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…
Figure 13
Figure 13. Figure 13: Implementation of the map of Fig [PITH_FULL_IMAGE:figures/full_fig_p035_13.png]
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]
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_p041_14.png]
Figure 15
Figure 15. Figure 15: Effective stat mech model for the purity of [PITH_FULL_IMAGE:figures/full_fig_p045_15.png]
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]
Figure 16
Figure 16. Figure 16: Operator pushing in the twirled HaPPY quantum error correcting code. [PITH_FULL_IMAGE:figures/full_fig_p047_16.png]
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]
Figure 17
Figure 17. Figure 17: Left: A computationally covariant TN may admit slicings that are globally expanding [PITH_FULL_IMAGE:figures/full_fig_p048_17.png]
Figure 18
Figure 18. Figure 18: Comparison of different lengthscales for different values of [PITH_FULL_IMAGE:figures/full_fig_p055_18.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

80 extracted references · 80 canonical work pages

  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 Pith review 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 Pith review 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 Pith review 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 Pith review 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]. 59

    work page Pith review 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 Pith review 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 Pith review 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 Pith review arXiv 2016

Show all 80 references
  1. [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]

    2019

  2. [10]

    TASI Lectures on the Emergence of Bulk Physics 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]

    2018 arXiv

  3. [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]

    2020

  4. [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]

    2021

  5. [13]

    Entanglement Renormalization and Holography

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

    2012 arXiv

  6. [14]

    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

    2008 arXiv

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

    2016 arXiv

  8. [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]

    2015 arXiv

  9. [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]

    2017 arXiv

  10. [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]

    2022

  11. [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]

    2022

  12. [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]. 60

    2017 arXiv

  13. [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]

  14. [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]

    2024

  15. [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]

    2021

  16. [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]

    2024

  17. [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]

    2024

  18. [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]

    2025

  19. [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]

    arXiv

  20. [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]

    2017 arXiv

  21. [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]

    2017 arXiv

  22. [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]

    2024

  23. [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]

    2023

  24. [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]

  25. [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]

  26. [34]

    It from ETH: Multi-interval Entanglement and Replica Wormholes from Large-cBCFT Ensemble

    H. Geng, L.-Y. Hung, Y. Jiang, “It from ETH: Multi-interval Entanglement and Replica Wormholes from Large-cBCFT Ensemble”arXiv:2505.20385 [hep-th]

  27. [35]

    Ryu-Takayanagi formula for multi-boundary black holes from 2D large-c CFT ensemble

    N. Bao, H. Geng, Y. Jiang, “Ryu-Takayanagi formula for multi-boundary black holes from 2D large-c CFT ensemble” JHEP10(2025) 042,arXiv:2504.12388 [hep-th]. 61

    2025

  28. [36]

    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]

    2019

  29. [37]

    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]

    1902 arXiv

  30. [38]

    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]

    2019

  31. [39]

    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]

    2022

  32. [40]

    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]

    2020

  33. [41]

    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]

    2022

  34. [42]

    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]

    2024

  35. [43]

    Diffeomorphism invariant tensor networks for 3d gravity

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

  36. [44]

    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]

    2013 arXiv

  37. [45]

    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)]

    2016 arXiv

  38. [46]

    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]

    2024

  39. [47]

    The Universe as a Quantum Encoder

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

  40. [48]

    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]

    2025

  41. [49]

    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]

    2020

  42. [50]

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

    2024

  43. [51]

    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]

    2021

  44. [52]

    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

    2006 arXiv

  45. [53]

    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]

    2022

  46. [54]

    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]

    2025

  47. [55]

    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]

    2015 arXiv

  48. [56]

    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]

    2013 arXiv

  49. [57]

    Asymptotically isometric codes for holography

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

  50. [58]

    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]

    2024

  51. [59]

    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]

    2024

  52. [60]

    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]

    2022

  53. [61]

    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]

    2023

  54. [62]

    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]

    2024

  55. [63]

    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

  56. [64]

    Bengtsson, K

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

    2017

  57. [65]

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

    2025

  58. [66]

    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]

    2020

  59. [67]

    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]

    2019

  60. [68]

    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]

    2025

  61. [69]

    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]

  62. [70]

    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]

    arXiv

  63. [71]

    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]

    2022

  64. [72]

    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]

    2025

  65. [73]

    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]

    2025

  66. [74]

    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]

    2023

  67. [75]

    Building Holographic Entanglement by Measurement

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

  68. [76]

    Black Holes at Exp-time

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

    2006

  69. [77]

    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

    2009

  70. [78]

    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

  71. [79]

    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

  72. [80]

    Mantegazza,Lecture notes on mean curvature flow, vol

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

    2011

Pith tools

Reviewed June 30, 2026 · model on record in the stance chip above.