Reflected entropy in random tensor networks III: triway cuts

TL;DR

This paper establishes that reflected entropies in random tensor networks are governed by minimal triway cuts, extending bipartite entanglement descriptions and connecting to holographic conjectures and tripartite entanglement measures.

Contribution

It proves the relation between reflected entropy and triway cuts in random tensor networks, generalizes the minimal cut picture, and explores the implications for holography and tripartite entanglement.

Findings

Reflected entropy determined by minimal triway cuts in large bond dimension networks.

Extrapolation suggests $S_R=2EW$, linking reflected entropy to entanglement wedge cross-section.

Lower bound on tripartite entanglement gap related to integer program's integrality gap.

Abstract

For general random tensor network states at large bond dimension, we prove that the integer R\'enyi reflected entropies (away from phase transitions) are determined by minimal triway cuts through the network. This generalizes the minimal cut description of bipartite entanglement for these states. A natural extrapolation away from integer R\'enyi parameters, suggested by the triway cut problem, implies the holographic conjecture $S_R=2EW$, where $S_R$ is the reflected entropy and $EW$ is the entanglement wedge cross-section. Minimal triway cuts can be formulated as integer programs which cannot be relaxed to find a dual maximal flow/bit-thread description. This sheds light on the gap between the existence of tripartite entanglement in holographic states and the bipartite entanglement structure motivated by bit-threads. In particular, we prove that the Markov gap that measures tripartite entanglement is lower bounded by the integrality gap of the integer program that computes the triway cut.