Locally accessible information from multipartite ensembles

TL;DR

This paper introduces a universal upper bound on the locally accessible information in multipartite quantum ensembles, aiding in understanding state distinguishability and dense coding capacity under LOCC constraints.

Contribution

It provides a Holevo-like bound applicable to any multipartite ensemble, extending the analysis of quantum information accessibility and dense coding in distributed systems.

Findings

Universal upper bound on locally accessible information

Analysis of orthogonal state indistinguishability under LOCC

Upper bound for distributed dense coding capacity

Abstract

We present a universal Holevo-like upper bound on the locally accessible information for arbitrary multipartite ensembles. This bound allows us to analyze the indistinguishability of a set of orthogonal states under LOCC. We also derive the upper bound for the capacity of distributed dense coding with multipartite senders and multipartite receivers.