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
- 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) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - 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) - Optimal Gradient Quantization Condition for Communication-Efficient
Distributed Training [99.42912552638168]
Communication of gradients is costly for training deep neural networks with multiple devices in computer vision applications.
In this work, we deduce the optimal condition of both the binary and multi-level gradient quantization for textbfANY gradient distribution.
Based on the optimal condition, we develop two novel quantization schemes: biased BinGrad and unbiased ORQ for binary and multi-level gradient quantization respectively.
arXiv Detail & Related papers (2020-02-25T18:28: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.