2000 character limit reached
The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel (1812.03305v1)
Published 8 Dec 2018 in quant-ph, cs.IT, and math.IT
Abstract: Here we discuss message identification, a problem formalized by Rudolf Ahlswede and Gunter Dueck, over a classical-quantum multiple access channel with two classical senders and one quantum receiver. We show that the simultaneous identification capacity, a capacity defined by Peter L\"ober, of this multiple access channel is equal to its message transmission capacity region.