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容量区域的内外边界，并证明先前结果可作为特例导出。已有研究证实（Dueck, 1978），经典MAC在消息平均错误准则下的容量区域严格大于最大错误准则下的容量区域。我们观察到，当存在纠缠资源时，这两个容量区域将重合。此外，本文还考虑了纠缠资源与会议通信的联合设置——即发射机间可通过速率受限链路进行相互通信。利用超密编码技术，纠缠资源可使会议通信速率提升一倍。