We consider the task of communicating a generic bivariate function of two classical correlated sources over a Classical-Quantum Multiple Access Channel (CQ-MAC). The two …
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 …
TA Atif, SS Pradhan - 2021 IEEE International Symposium on …, 2021 - ieeexplore.ieee.org
We consider the task of faithfully simulating a distributed quantum measurement and function computation, and demonstrate a new achievable rate-region. For this, we develop …
F Shirani, SS Pradhan - IEEE Transactions on Information …, 2023 - ieeexplore.ieee.org
This work considers an information-theoretic characterization of the set of achievable rates, costs, and distortions in a broad class of distributed communication and function …
TA Atif, A Padakandla… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
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 …
We consider a scenario wherein two parties Alice and Bob are provided and–samples that are IID from a PMF. Alice and Bob can communicate to Charlie over (noiseless) …
TA Atif, A Padakandla… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
We consider the problem of characterizing an inner bound to the capacity region of a 3— user classical-quantum interference channel (3—CQIC). The best known coding scheme for …
D Malak - arXiv preprint arXiv:2405.02904, 2024 - arxiv.org
We devise achievable encoding schemes for distributed source compression for computing inner products, symmetric matrix products, and more generally, square matrix products …
A Padakandla - 2022 IEEE International Symposium on …, 2022 - ieeexplore.ieee.org
We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as …