The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel with Stochastic Encoders for Transmission

2019/03/08 by Stephen DiAdamo, Holger Boche, Diadamo, Stephen +1
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.1903.03395

openalex publication_date 2019/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme. Here, we use transmission codes with a stochastic encoding scheme and show that the analogous capacity theorem holds. Further, by using stochastic encoders, the proof of achievability is highly simplified.

Citations

• The Simultaneous Identification Capacity of the Classical--Quantum\n Multiple Access Channel

Related

• The Simultaneous Identification Capacity of the Classical--Quantum\n Multiple Access Channel
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels
• Communicating over a Classical-Quantum MAC with State Information Distributed at Senders
• Simultaneous classical-quantum capacities of quantum multiple access channels
• Exponent for classical-quantum multiple access channel