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.
Overlapping qubits from non-isometric maps and de Sitter tensor networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
hep-th 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.