Computing Sum of Sources over a Classical-Quantum MAC
Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan

TL;DR
This paper introduces a coset code-based scheme for computing functions of two sources over a classical-quantum MAC, enabling efficient decoding without source recovery and improving existing capacity conditions.
Contribution
It develops a novel coding scheme using coset codes for classical-quantum MACs, providing weaker sufficient conditions for function computation.
Findings
Achieves capacity of classical-quantum point-to-point channels
Proposes a new ensemble of coset codes
Derives weaker sufficient conditions for function computation
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
