Unified approach for computing sum of sources over CQ-MAC
Abstract
We consider the task of communicating a generic bivariate function of two classical sources over a Classical-Quantum Multiple Access Channel (CQ-MAC). The two sources are observed at the encoders of the CQ-MAC, and the decoder aims at reconstructing a bivariate function from the received quantum state. Inspired by the techniques developed for the analogous classical setting, and employing the technique of simultaneous (joint) decoding developed for the classical-quantum setting, we propose and analyze a coding scheme based on a fusion of algebraic structured and unstructured codes. This coding scheme allows exploiting both the symmetric structure common amongst the sources and the asymmetries. We derive a new set of sufficient conditions that strictly enlarges the largest known set of sources (capable of communicating the bivariate function) for any given CQ-MAC. We provide these conditions in terms of single-letter quantum information-theoretic quantities.
Keywords
Cite
@article{arxiv.2202.10403,
title = {Unified approach for computing sum of sources over CQ-MAC},
author = {Mohammad Aamir Sohail and Touheed Anwar Atif and S. Sandeep Pradhan and Arun Padakandla},
journal= {arXiv preprint arXiv:2202.10403},
year = {2022}
}
Comments
20 pages, 4 figures. Update: a detailed example