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 tensor networks including a lattice RT formula.
A world without pythons would be so simple
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Evanescent quantum extremal surfaces, bounded in area but not generalized entropy, diagnose failures of spacetime emergence in holography.
citing papers explorer
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
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 tensor networks including a lattice RT formula.
-
A Semiclassical Diagnostic for Spacetime Emergence
Evanescent quantum extremal surfaces, bounded in area but not generalized entropy, diagnose failures of spacetime emergence in holography.