Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding

• URL: http://arxiv.org/abs/2011.00410v3
• Date: Thu, 6 May 2021 03:41:02 GMT
• Title: Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding
• Authors: Masahito Hayashi and Ning Cai
• Abstract summary: 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.
• Score: 67.6686661244228
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. The former universally achieves corner points of the capacity region and the latter universally achieves general points of the capacity region. Combining the latter universal code with the existing result by Quantum Inf Process. 18, 246 (2019), we establish a single-letterized formula for the capacity region of a classical-quantum compound multiple access channel.

Related papers

• 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)
• Simple and general bounds on quantum random access codes [0.0]
  We provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet. We demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.
  arXiv  Detail & Related papers  (2023-12-21T18:57:55Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes [0.0]
  We show that entirely quantum Shannon theoretic methods can be used to derive Singleton bounds on the performance of EACQ error correcting codes. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size is large enough.
  arXiv  Detail & Related papers  (2022-02-04T15:22:18Z)
• 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)
• 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)
• 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)
• Generalized Perfect Codes for Symmetric Classical-Quantum Channels [9.797319790710711]
  We extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. For certain $N$-qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect.
  arXiv  Detail & Related papers  (2020-07-15T19:22:39Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.