Twirled perfect tensor networks achieve computational covariance, bound complexity by the PLC, and obey a lattice Ryu-Takayanagi formula for arbitrary boundary subregions.
Background independent tensor networks
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
hep-th 3years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
citing papers explorer
-
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.
-
Structural Obstruction to Replica Symmetry Breaking for Multi-Entropy in Random Tensor Networks
Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.
-
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.