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. Furthermore, it has long been known that the capacity region of the classical MAC under a message-average error criterion can be strictly larger than with a maximal error criterion (Dueck, 1978). We observe that given entanglement resources, the regions coincide.

翻译：考虑经典多址信道（MAC）在纠缠资源下的通信，其中两个发射器在通信开始前预先共享纠缠资源。Leditzki等人（2020）提出一个基于伪遥传游戏的经典MAC实例，表明具有纠缠发射器的和速率严格高于无此类资源时的最优可达和速率。本文推导了具有纠缠发射器的通用MAC容量区域的完整表征，并证明先前的结果可视为特例。我们建立了涉及有限维辅助变量和辅助系统的单字母公式，进而给出了达到该速率区域所需的充分纠缠速率。此外，长期以来已知经典MAC在消息平均误差准则下的容量区域可能严格大于最大误差准则下的容量区域（Dueck, 1978）。我们观察到，在给定纠缠资源的情况下，这两个区域重合。