Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables

• URL: http://arxiv.org/abs/2502.03785v2
• Date: Sat, 08 Feb 2025 23:20:57 GMT
• Title: Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables
• Authors: Avijit Mandal, Henry D. Pfister,
• Abstract summary: We analyze decoding functions using symmetry and the nested structure of Reed-Muller codes. 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.
• Score: 7.415361840837667
• License:
• Abstract: The question of whether Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels has drawn attention since it was resolved positively for the binary erasure channel by Kudekar et al. in 2016. In 2021, Reeves and Pfister extended this to prove the bit-error probability vanishes on BMS channels when the code rate is less than capacity. In 2023, Abbe and Sandon improved this to show the block-error probability also goes to zero. These results analyze decoding functions using symmetry and the nested structure of RM codes. In this work, we focus on binary-input symmetric classical-quantum (BSCQ) channels and the Holevo capacity. For a BSCQ, we consider observables that estimate the channel input in the sense of minimizing the mean-squared error (MSE). Using the orthogonal decomposition of these observables under a weighted inner product, we establish a recursive relation for the minimum MSE estimate of a single bit in the RM code. Our results show that any set of $2^{o(\sqrt{\log N})}$ bits can be decoded with a high probability when the code rate is less than the Holevo capacity.

Related papers

• Rate-reliability functions for deterministic identification [49.126395046088014]
  We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents. We extend our results to classical-quantum channels and quantum channels with product input restriction.
  arXiv  Detail & Related papers  (2025-02-04T15:09:14Z)
• A logical qubit-design with geometrically tunable error-resistibility [0.46873264197900916]
  We propose a setup for a logical qubit built from superconducting qubits (SCQs) coupled to a microwave cavity-mode. Our design is based on a recently discovered geometric stabilizing mechanism in the Bose-Hubbard wheel (BHW)
  arXiv  Detail & Related papers  (2024-05-13T19:32:58Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• 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)
• Exact performance of the five-qubit code with coherent errors [0.0]
  We obtain explicit process matrix of the coding maps with a unital error channel for the five-qubit code. We analytically show how the code affects the average gate infidelity and diamond distance of the error channels.
  arXiv  Detail & Related papers  (2022-03-03T13:28:59Z)
• 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)
• A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC [13.16823105226952]
  Renes developed a theory of channel duality for classical-input quantum-output (CQ) channels. One special case of this duality is a connection between coding for error correction (resp. wire-tap secrecy) on the quantum pure-state channel (PSC) and coding for wire-tap secrecy (resp. error correction) on the classical binary symmetric channel (BSC)
  arXiv  Detail & Related papers  (2021-03-16T17:55:38Z)
• Quantum Error Source and Channel Coding [0.0]
  We prove conditions on the set of correctable error patterns allowing for unambiguous decoding based on a lookup table. We argue that quantum error correction is more aptly viewed as source compression in the sense of Shannon.
  arXiv  Detail & Related papers  (2020-04-20T17:55:21Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

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.