Computing Sum of Sources over a Classical-Quantum MAC

2021/03/02 by Touheed Anwar Atif, Atif, Touheed Anwar, Arun Padakandla +3 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #cs.IT #math.IT #quant-ph

paper · pdf · doi:10.48550/arxiv.2103.02082

13 pages

arxiv created 2021/03/02 · openalex publication_date 2021/03/02 · arxiv updated 2021/03/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider the problem of communicating a general bivariate function of two classical sources observed at the encoders of a classical-quantum multiple access channel. Building on the techniques developed for the case of a classical channel, we propose and analyze a coding scheme based on coset codes. The proposed technique enables the decoder recover the desired function without recovering the sources themselves. We derive a new set of sufficient conditions that are weaker than the current known for identified examples. This work is based on a new ensemble of coset codes that are proven to achieve the capacity of a classical-quantum point-to-point channel.

Cited by

• Achievable rate-region for 3-User Classical-Quantum Interference Channel using Structured Codes

Related

• Unified approach for computing sum of sources over CQ-MAC
• Communicating over a Classical-Quantum MAC with State Information Distributed at Senders
• An Achievable Rate Region for 3-User Classical Quantum Broadcast Channel via Coset Codes
• The Classical-Quantum Multiple Access Channel with Conferencing Encoders and with Common Messages
• The Capacity of Classical Summation over a Quantum MAC with Arbitrarily Distributed Inputs and Entanglements