Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzki et al. (2020) presented an example of a classical MAC, defined in terms of a pseudo telepathy game, such that the sum rate with entangled transmitters is strictly higher than the best achievable sum rate without such resources. Here, we derive a full characterization of the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. A single-letter formula is established involving auxiliary variables and ancillas of finite dimensions. This, in turn, leads to a sufficient entanglement rate to achieve the rate region.

翻译：考虑在经典多址信道（MAC）上利用纠缠资源进行通信，其中两个发射机在通信开始前预先共享纠缠资源。Leditzki等人（2020）提出了一个经典MAC的示例，该示例基于伪心灵感应游戏定义，使得具有纠缠发射机的和速率严格高于没有此类资源时可达的最佳和速率。本文给出了具有纠缠发射机的一般MAC容量区域的完整刻画，并表明先前的结果可作为特例获得。建立了一个涉及有限维度辅助变量和辅助系统的单字母公式，进而得到了实现该速率区域所需的足够纠缠速率。