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 determine the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. 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）。本文发现，在拥有纠缠资源的情况下，这两个容量区域趋于一致。