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）。我们观察到，在给定纠缠资源的情况下，这两个区域是重合的。此外，我们还探讨了纠缠资源与协商通信相结合的场景，其中发射器之间还可以通过速率受限的链路进行通信。利用超密编码，纠缠资源可以使协商速率翻倍。