For a bipartite mixed state obtained by tracing out one subsystem of a tripartite Haar-random pure state, the relative entropy of entanglement equals log(d_A d_B / max(d_A,d_B,d_C)) plus an absolute constant, with high probability.
Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distance like measures of multipartite entanglement.
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Relative entropy of entanglement of Haar random states
For a bipartite mixed state obtained by tracing out one subsystem of a tripartite Haar-random pure state, the relative entropy of entanglement equals log(d_A d_B / max(d_A,d_B,d_C)) plus an absolute constant, with high probability.