Achievable rate-region for $3-$User Classical-Quantum Interference Channel using Structured Codes

• URL: http://arxiv.org/abs/2103.03978v1
• Date: Fri, 5 Mar 2021 23:22:56 GMT
• Title: Achievable rate-region for $3-$User Classical-Quantum Interference Channel using Structured Codes
• Authors: Touheed Anwar Atif, Arun Padakandla and S. Sandeep Pradhan
• Abstract summary: We consider the problem of characterizing an inner bound to the capacity region of a $3-$user classical-quantum interference channel ($3-$CQIC) We develop techniques based on coset codes for $3$to$1-$CQICs - a subclass of $3-$user CQICs.
• Score: 13.561997774592664
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 communicating over CQICs is based on unstructured random codes and employs the techniques of message splitting and superposition coding. For classical $3-$user interference channels (ICs), it has been proven that coding techniques based on coset codes - codes possessing algebraic closure properties - strictly outperform all coding techniques based on unstructured codes. In this work, we develop analogous techniques based on coset codes for $3$to$1-$CQICs - a subclass of $3-$user CQICs. We analyze its performance and derive a new inner bound to the capacity region of $3$to$1-$CQICs that subsume the current known largest and strictly enlarges the same for identified examples.

Related papers

• Achievable Rate Regions for Multi-terminal Quantum Channels via Coset Codes [5.598487000369365]
  We study the problem of communicating classical information over a $3-$user quantum interference channel (QIC) and a $3-$user quantum broadcast channel (QBC) We derive a new inner bound to the classical-quantum capacity region of both the $3-$user QIC and $3-$user QBC.
  arXiv  Detail & Related papers  (2025-03-10T19:36:53Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound [44.154181086513574]
  We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ frackn = frac13 $. We demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs.
  arXiv  Detail & Related papers  (2024-10-05T11:56:15Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels [9.51828574518325]
  We consider the scenario of communicating on a $3mhyphen$user classical-quantum broadcast channel. We design a new coding scheme based textitpartitioned coset codes - an ensemble of codes possessing algebraic properties. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes.
  arXiv  Detail & Related papers  (2022-02-28T21:57:30Z)
• 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)
• 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)
• Non-autoregressive End-to-end Speech Translation with Parallel Autoregressive Rescoring [83.32560748324667]
  This article describes an efficient end-to-end speech translation (E2E-ST) framework based on non-autoregressive (NAR) models. We propose a unified NAR E2E-ST framework called Orthros, which has an NAR decoder and an auxiliary shallow AR decoder on top of the shared encoder.
  arXiv  Detail & Related papers  (2021-09-09T16:50:16Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes [3.9962751777898955]
  We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
  arXiv  Detail & Related papers  (2021-06-15T16:01:42Z)
• Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances [27.90363292358871]
  We present a new construction of asymmetric quantum codes (AQCs) by combining classical tensord codes (CCs) with tensor product codes (TPCs) Most AQCTPCs are highly degenerate, which means they can correct many more errors than their classical counterparts. We generalize our concatenation scheme by using the generalized CCs and TPCs.
  arXiv  Detail & Related papers  (2020-12-01T02:43:24Z)

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.