Reed-Muller Codes for Quantum Pauli and Multiple Access Channels

• URL: http://arxiv.org/abs/2506.08651v1
• Date: Tue, 10 Jun 2025 10:02:57 GMT
• Title: Reed-Muller Codes for Quantum Pauli and Multiple Access Channels
• Authors: Dina Abdelhadi, Colin Sandon, Emmanuel Abbe, Ruediger Urbanke,
• Abstract summary: We extend the scope of RM codes development and analysis to multiple-access channels (MACs) and quantum Pauli channels.<n>We first derive the achievable rate region for RM codes on Q-MACs, a class of MACs with additive correlated noise.<n>We then put forward a connection between the rate region of these QMACs and quantum RM codes designed for Pauli noise channels.
• Score: 14.49195801951889
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of RM codes development and analysis to multiple-access channels (MACs) and quantum Pauli channels, leveraging a unified approach. Specifically, we first derive the achievable rate region for RM codes on so-called Q-MACs, a class of MACs with additive correlated noise. This is achieved via a generalization of the bending and boosting arguments defined in arXiv:2304.02509. We then put forward a connection between the rate region of these QMACs and quantum RM codes designed for Pauli noise channels. This connection highlights a universality property of quantum RM codes, demonstrating their rate-optimal performance across a range of channel parameters, rather than for a single Pauli channel.

Related papers

• Rydberg Atomic Quantum MIMO Receivers for The Multi-User Uplink [77.32323151235285]
  We propose a flexible architecture for Rydberg atomic quantum multiple-input multiple-output (RAQ-MIMO) receivers in the multi-user uplink.<n>The corresponding signal model of the RAQ-MIMO system is constructed by paving the way from quantum physics to wireless communications.
  arXiv  Detail & Related papers  (2025-06-02T06:16:54Z)
• Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels [3.637365301757111]
  We investigate the generation of EPR pairs between three observers in a general causally structured setting.<n>The most general quantum codes for this setup take the form of tripartite quantum channels.
  arXiv  Detail & Related papers  (2025-05-12T04:15:21Z)
• Near-Field Channel Estimation for XL-MIMO: A Deep Generative Model Guided by Side Information [70.25632840894272]
  This paper investigates the near-field (NF) channel estimation for large-scale multiple-input multiple-output (XL-MIMO) systems.<n>We propose a GenAI-based approach to refine the estimated channel.<n> Experimental results indicate that the proposed approach is capable of offering substantial performance gain in CE.
  arXiv  Detail & Related papers  (2025-05-11T08:35:36Z)
• Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables [7.415361840837667]
  We analyze decoding functions using symmetry and the nested structure of Reed-Muller codes.<n>Our results show that any set of $2o(sqrtlog N)$ bits can be decoded with a high probability when the code rate is less than the Holevo capacity.
  arXiv  Detail & Related papers  (2025-02-06T05:19:24Z)
• Joint Channel Estimation and Feedback with Masked Token Transformers in Massive MIMO Systems [74.52117784544758]
  This paper proposes an encoder-decoder based network that unveils the intrinsic frequency-domain correlation within the CSI matrix. The entire encoder-decoder network is utilized for channel compression. Our method outperforms state-of-the-art channel estimation and feedback techniques in joint tasks.
  arXiv  Detail & Related papers  (2023-06-08T06:15:17Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels [6.831109886531548]
  In 2016, Renes introduced a belief propagation with quantum messages (BPQM) We propose an extension of BPQM to general binary-input symmetric classical-quantum (BSCQ) channels based on the implementation of a symmetric "paired measurement"
  arXiv  Detail & Related papers  (2022-07-11T16:14:49Z)
• 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)
• 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)
• One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC [0.0]
  We prove a novel one-shot multi-sender theorem generalising Dupuistrivial result. An immediate application of our main result is to obtain a one-shot simultaneous decoder for sending quantum information over a k-sender entanglement unassisted quantum multiple access channel (QMAC) Our work is the first one to obtain a non- simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and iid settings.
  arXiv  Detail & Related papers  (2021-02-03T18:30:41Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)

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.