On Quantum-Enhanced LDPC Decoding for Rayleigh Fading Channels

• URL: http://arxiv.org/abs/2209.11994v1
• Date: Sat, 24 Sep 2022 12:30:52 GMT
• Title: On Quantum-Enhanced LDPC Decoding for Rayleigh Fading Channels
• Authors: Utso Majumder, Aditya Das Sarma, Vishnu Vaidya and M Girish Chandra
• Abstract summary: We have worked out the Quadratic Unconstrained Binary Optimization (QUBO) formulation for Rayleigh Fading channels. The resultant QUBO are solved using D-Wave 2000Q Quantum Annealer. Simple minimum distance decoding of the available copies of the outputs led to improved performance.
• Score: 1.1934558041641545
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum and Classical computers continue to work together in tight cooperation to solve difficult problems. The combination is thus suggested in recent times for decoding the Low Density Parity Check (LDPC) codes, for the next generation Wireless Communication systems. In this paper we have worked out the Quadratic Unconstrained Binary Optimization (QUBO) formulation for Rayleigh Fading channels for two different scenarios: channel state fully known and not known. The resultant QUBO are solved using D-Wave 2000Q Quantum Annealer and the outputs from the Annealer are classically postprocessed, invoking the notion of diversity. Simple minimum distance decoding of the available copies of the outputs led to improved performance, compared to picking the minimum-energy solution in terms of Bit Error Rate (BER). Apart from providing these results and the comparisons to fully classical Simulated Annealing (SA) and the traditional Belief Propagation (BP) based strategies, some remarks about diversity due to quantum processing are also spelt out.

Related papers

• Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation [7.185960422285947]
  We show that guided decimation (BPGD) decoding of quantum LDPC codes offers competitive performance on quantum erasure channels. BPGD is an effective general-purpose solution for erasure decoding across the quantum LDPC landscape.
  arXiv  Detail & Related papers  (2024-11-12T20:45:43Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems [69.47813697920358]
  We analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions.
  arXiv  Detail & Related papers  (2024-08-28T12:51:03Z)
• Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
  We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs) The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
  arXiv  Detail & Related papers  (2024-08-09T16:47:49Z)
• Quantum State Transfer via a Multimode Resonator [4.324470586239192]
  Large-scale fault-tolerant superconducting quantum computation needs rapid quantum communication. We propose a formalism for quantum state transfer using coupling strengths comparable to the channel's free spectral range.
  arXiv  Detail & Related papers  (2024-06-30T12:44:44Z)
• Analog information decoding of bosonic quantum LDPC codes [3.34006871348377]
  We propose novel decoding methods that explicitly exploit the syndrome information obtained from a bosonic qubit readout. Our results lay the foundation for general decoding algorithms using analog information and demonstrate promising results in the direction of fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2023-11-02T15:41:03Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• On Quantum-Assisted LDPC Decoding Augmented with Classical Post-Processing [1.0498337709016812]
  This paper looks into the Quadratic Unconstrained Binary Optimization (QUBO) and utilized D-Wave 2000Q Quantum Annealer to solve it. We evaluated and compared this implementation against the decoding performance obtained using Simulated Annealing (SA) and belief propagation (BP) decoding with classical computers.
  arXiv  Detail & Related papers  (2022-04-21T08:01:39Z)

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.