Communication over a classical multiple-access channel (MAC) with entanglement resources is considered, whereby two transmitters share entanglement resources a priori before communication begins. Leditzky 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 establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters, and show that the previous result can be obtained as a special case. 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. Furthermore, we address the combined setting of entanglement resources and conferencing, where the transmitters can also communicate with each other over rate-limited links. Using superdense coding, entanglement can double the conferencing rate.

翻译：本文考虑在经典多址信道（MAC）上利用纠缠资源进行通信，其中两个发射机在通信开始前预先共享纠缠资源。Leditzky等人（2020）通过一个基于伪隐形传态博弈的经典MAC实例证明，当发射机具有纠缠资源时，其总和速率严格高于无此类资源时可实现的最优总和速率。本文建立了通用纠缠发射机MAC容量区域的内外边界，并表明前述结果可作为特例推导得出。长期以来，经典MAC在消息平均误差准则下的容量区域可能严格大于最大误差准则下的容量区域（Dueck, 1978）。我们观察到，当存在纠缠资源时，这两个区域将重合。此外，本文还研究了纠缠资源与会话机制的组合场景，其中发射机可通过速率受限链路相互通信。利用超密编码技术，纠缠资源可使会话速率提升一倍。