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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Logarithmic negativity equals exact entanglement cost under PPT-preserving operations for large random induced mixed states.
The geometric decoherence time marks the earliest breakdown of the monotone relation between logarithmic negativity and Rényi-1/2 entropy under Lindbladian evolution, serving as a dynamical scale for the onset of decoherence.
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.
-
Logarithmic negativity typically equals exact entanglement cost
Logarithmic negativity equals exact entanglement cost under PPT-preserving operations for large random induced mixed states.
-
Geometric Decoherence Time in Lindbladian Dynamics
The geometric decoherence time marks the earliest breakdown of the monotone relation between logarithmic negativity and Rényi-1/2 entropy under Lindbladian evolution, serving as a dynamical scale for the onset of decoherence.