For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.
Holographic duality between local Hamiltonians from random tensor networks
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
hep-th 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
citing papers explorer
-
Multi-entropy in random tensor networks
For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.
-
Twirled Perfect Tensor Networks: Computationally covariant holographic tensor networks
Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.