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.
翻译:考虑利用纠缠资源在经典多发信道上进行通信,即两个发射机在通信开始之前分享纠缠资源。Leditzki等人(2020)提出了一个基于伪电感游戏的经典多发信道示例,其中利用纠缠发射机的总速率严格高于没有这种资源情况下的最佳总速率。在这里,我们确定了具有纠缠发射机的一般多发信道的容量区域,并展示了先前的结果可以作为一个特例得到。此外,人们早已知道,在消息平均误差标准下,经典多发信道的容量之间的区域可能比最大误差标准下的容量区域严格更大(Dueck,1978)。我们观察到,纠缠资源的情况下,这两个区域相重合。