2000 character limit reached
The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel
Published 8 Dec 2018 in quant-ph, cs.IT, and math.IT | (1812.03305v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.