Entanglement-Assisted Classical Capacity of a Quantum Channel

Given a quantum channel $\mathcal{N}$, a rate $R\in\mathbb{R}^{+}$ is achievable for entanglement-assisted classical communication over $\mathcal{N}$ if, for all $\varepsilon\in(0,1]$, $\delta>0$, and sufficiently large $n$, there exists an $(n,2^{n(R-\delta)},\varepsilon)$ entanglement-assisted classical communication protocol. The capacity $C_{\operatorname{EA}}(\mathcal{N})$ is \[ C_{\operatorname{EA}}(\mathcal{N}) := \sup\{R : R\text{ is an achievable rate for }\mathcal{N}\}. \]