An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels

• URL: http://arxiv.org/abs/2203.00110v3
• Date: Wed, 12 Mar 2025 17:18:48 GMT
• Title: An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels
• Authors: Fatma Gouiaa, Arun Padakandla,
• Abstract summary: We consider the scenario of communicating on a $3mhyphen$user classical-quantum broadcast channel.<n>We design a new coding scheme based textitpartitioned coset codes - an ensemble of codes possessing algebraic properties.<n>We characterize a new inner bound to the classical-quantum capacity region of the $3-$user classical-quantum broadcast channel.
• Score: 5.598487000369365
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based \textit{partitioned coset codes} - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes. Proceeding further, we incorporate Sen's technique of tilting smoothing and augmentation to perform simultaneous decoding via a simultaneous decoding POVM and thereby characterize a further enlarged achievable rate region for communicating classical bits over the $3-$user classical-quantum broadcast channel. Finally, in our last step, we characterize a new inner bound to the classical-quantum capacity region of the $3-$user classical-quantum broadcast channel that subsumes all previous known inner bounds by combining the conventional unstructured IID codes with structured coset code strategies.

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)
• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Entanglement-assisted classical capacities of some channels acting as radial multipliers on fermion algebras [0.0]
  We investigate a new class of unital quantum computation channels on $mathrmM_2k$. We identify the matrix algebra $mathrmM_2k$ with a finite-dimensional fermion algebra. Our calculations yield exact values applicable to the operators of the fermionic Ornstein-Uhlenbeck semigroup.
  arXiv  Detail & Related papers  (2024-02-23T16:58:31Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [53.66705737169404]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets. Our main findings are that the maximum number of messages thus identifiable scales super-exponentially as $2R,nlog n$ with the block length $n$. Results are shown to generalise directly to classical-quantum channels with finite-dimensional output quantum system.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• Interpreting Class Conditional GANs with Channel Awareness [57.01413866290279]
  We investigate how a class conditional generator unifies the synthesis of multiple classes. To describe such a phenomenon, we propose channel awareness, which quantitatively characterizes how a single channel contributes to the final synthesis. Our algorithm enables several novel applications with conditional GANs.
  arXiv  Detail & Related papers  (2022-03-21T17:53:22Z)
• 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)
• One-shot inner bounds for sending private classical information over a quantum MAC [0.0]
  We provide the first inner bounds for sending private classical information over a quantum multiple access channel. We do so by using three powerful information theoretic techniques: rate splitting, quantum simultaneous decoding for multiple access channels, and a novel smoothed distributed covering lemma for classical quantum channels.
  arXiv  Detail & Related papers  (2021-05-13T06:31:27Z)
• Achievable rate-region for $3-$User Classical-Quantum Interference Channel using Structured Codes [13.561997774592664]
  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.
  arXiv  Detail & Related papers  (2021-03-05T23:22:56Z)
• Computing Sum of Sources over a Classical-Quantum MAC [13.561997774592664]
  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.
  arXiv  Detail & Related papers  (2021-03-02T23:14:05Z)
• Neural networks behave as hash encoders: An empirical study [79.38436088982283]
  The input space of a neural network with ReLU-like activations is partitioned into multiple linear regions. We demonstrate that this partition exhibits the following encoding properties across a variety of deep learning models. Simple algorithms, such as $K$-Means, $K$-NN, and logistic regression, can achieve fairly good performance on both training and test data.
  arXiv  Detail & Related papers  (2021-01-14T07:50:40Z)
• 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)
• Perceptron Synthesis Network: Rethinking the Action Scale Variances in Videos [48.57686258913474]
  Video action recognition has been partially addressed by the CNNs stacking of fixed-size 3D kernels. We propose to learn the optimal-scale kernels from the data. An textitaction perceptron synthesizer is proposed to generate the kernels from a bag of fixed-size kernels.
  arXiv  Detail & Related papers  (2020-07-22T14:22:29Z)

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.