2022/02/21 by Mohammad Aamir Sohail, Touheed Anwar Atif, Sohail, Mohammad Aamir +5
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Blind Source Separation Techniques #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Systems and Control (eess.SY) #cs.IT #cs.SY #eess.SY #electronic engineering #information engineering #math.IT #quant-ph
paper · pdf · doi:10.48550/arxiv.2202.10403
20 pages, 4 figures. Update: a detailed example
openalex publication_date 2022/02/21 · arxiv created 2022/02/23 · arxiv updated 2022/02/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.