Entanglement-assisted classical communication / Theorem
Lower Bound for Entanglement-Assisted Classical Communication in Asymptotic Setting
Theorem statement
Let $\mathcal{N}$ be a quantum channel. Let $I$ denote the channel mutual information functional and let $C$ denote entanglement-assisted classical capacity. The channel mutual information $I(\mathcal{N})$ is an achievable entanglement-assisted classical communication rate. Consequently,
\[
C_{\operatorname{EA}}(\mathcal{N}) \ge I(\mathcal{N}).
\]
Sources
- Principles of Quantum Communication Theory: A Modern Approach
Sumeet Khatri, Mark M. Wilde, 2024
Lean context
Copy a short prompt with the import, Lean declaration, citations, and public source link.