Computing Sum of Sources over a Classical-Quantum MAC

• URL: http://arxiv.org/abs/2103.02082v1
• Date: Tue, 2 Mar 2021 23:14:05 GMT
• Title: Computing Sum of Sources over a Classical-Quantum MAC
• Authors: Touheed Anwar Atif, Arun Padakandla and S. Sandeep Pradhan
• Abstract summary: 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. 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.
• Score: 13.561997774592664
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• A Quantum Kernel Learning Approach to Acoustic Modeling for Spoken Command Recognition [69.97260364850001]
  We propose a quantum kernel learning (QKL) framework to address the inherent data sparsity issues. We project acoustic features based on classical-to-quantum feature encoding.
  arXiv  Detail & Related papers  (2022-11-02T16:46:23Z)
• Conservation laws and quantum error correction: towards a generalised matching decoder [2.1756081703276]
  We explore decoding algorithms for the surface code, a prototypical quantum low-density parity-check code. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. We propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties.
  arXiv  Detail & Related papers  (2022-07-13T18:00:00Z)
• Unified approach for computing sum of sources over CQ-MAC [12.641141743223375]
  We consider the task of communicating a generic bivariate function of two classical sources over a Classical-Quantum Multiple Access Channel (CQ-MAC) Inspired by the techniques developed for the analogous classical setting, we propose and analyze a coding scheme based on a fusion of algebraic structured and unstructured codes.
  arXiv  Detail & Related papers  (2022-02-21T18:00:39Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding [67.6686661244228]
  We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code. We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
  arXiv  Detail & Related papers  (2020-11-01T03:26:08Z)
• One-Shot Hybrid State Redistribution [20.28217079480463]
  We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The available resources are shared entanglement, and noiseless classical and quantum communication channels.
  arXiv  Detail & Related papers  (2020-06-22T08:17:37Z)
• Bounding the Classical Capacity of Multilevel Damping Quantum Channels [0.0]
  A recent method to certify the capacity of quantum communication channels is applied for general damping channels in finite dimension. The results for large representative classes of different damping structures are presented.
  arXiv  Detail & Related papers  (2020-01-17T11:47:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.