Locally accessible information from multipartite ensembles

Wei SongarXiv 2007 · DOI · arXiv

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 Local Operations and Classical Communication (LOCC). We also derive the upper bound for the capacity of distributed dense coding with multipartite senders and multipartite receivers.

Introduction

In quantum information theory, the distinguishability of states is a fundamental concept. While orthogonal states are perfectly distinguishable via global measurements, this is not necessarily true when the states are distributed across multiple distant parties. Under the constraint of Local Operations and Classical Communication (LOCC), even perfectly orthogonal states can become indistinguishable.

While mathematical bounds for "locally accessible information" ($I^{LOCC}$) have been established for bipartite systems, a general framework for multipartite systems has remained elusive. This paper fills this gap by providing a generalized formula to calculate the maximum information extractable in complex, distributed quantum networks.

Theoretical Framework

The multipartite bound is derived by generalizing the classic Holevo bound through a sequential measurement protocol. The derivation relies on the properties of von Neumann entropy ($S$), specifically its concavity and the invariance of local density matrices under distant measurements.

The Universal Bound

The core result is a universal inequality that applies to an arbitrary number of parties ($N$):

$$I^{LOCC} \leq \sum_{i=1}^N S(\rho^{B_i}) - \max_{Z \in \{B_1, \dots, B_N\}} \sum_x p_x S(\rho_x^Z)$$

This formula provides a powerful tool: if the calculated $I^{LOCC}$ bound is strictly less than the total information contained in the ensemble ($I = \log(\text{number of states})$), then those states are guaranteed to be indistinguishable under LOCC.

Case Studies and Validation

To validate the derived bounds, we analyze three specific "toy" ensembles. These theoretical models demonstrate how the bound behaves across different parameter spaces and party configurations.

Ensemble $\mathcal{E}_1$ consists of a tripartite (3-party) system defined by parameters $a$ and $c$. The behavior of the bound for this system is visualized in Figure 1, showing the smooth transition of accessible information across the parameter space.

The locally accessible information bound for tripartite ensemble $\mathcal{E}_1$ as a function of parameters $a$ and $c$.

Key Results

Proving Indistinguishability

A significant application of this bound is proving the limits of state distinguishability. In Example 2, we examine a tripartite system of six states. By comparing the derived LOCC bound to the total information, we can identify specific parameter ranges where perfect distinguishability is impossible.

Comparison of the LOCC bound (blue) and the total information (red) for the six-state tripartite ensemble $\mathcal{E}_2$, highlighting the range of indistinguishability.

As shown in Figure 2, for the range $0.222 < a < 0.975$, the LOCC bound (blue curve) remains strictly below the total information (red curve), proving that these six states cannot be perfectly distinguished via LOCC in this regime.

Distributed Dense Coding

The bound also defines the capacity limits for Distributed Dense Coding, where multiple senders transmit classical information to multiple receivers using pre-shared entanglement. The paper provides a new formula for the maximum capacity of such networks, extending the utility of the $I^{LOCC}$ bound to practical communication protocols.

Conclusion and Future Work

This work establishes a robust theoretical limit for information extraction in multipartite systems. However, several questions remain. While a strong relationship between accessible information and "distillable key" (secure cryptographic key) is proven for pure states, its extension to mixed states remains a conjecture. Additionally, as this is an upper bound, future research may focus on making these bounds "tighter" for specific classes of states and developing practical LOCC protocols that can approach these theoretical limits.

Summary updated

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.
BibTeX
@misc{song2007locally,
  author = {Wei Song},
  title = {{Locally accessible information from multipartite ensembles}},
  year = {2007},
  eprint = {0711.2787},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/0711.2787},
  howpublished = {arXiv},
}
Figure