A Quantum Approximate Optimization Algorithm-based Decoder Architecture for NextG Wireless Channel Codes
- URL: http://arxiv.org/abs/2408.11726v1
- Date: Wed, 21 Aug 2024 15:53:09 GMT
- Title: A Quantum Approximate Optimization Algorithm-based Decoder Architecture for NextG Wireless Channel Codes
- Authors: Srikar Kasi, James Sud, Kyle Jamieson, Gokul Subramanian Ravi,
- Abstract summary: Forward Error Correction (FEC) provides reliable data flow in wireless networks despite the presence of noise and interference.
FEC processing demands significant fraction of a wireless network's resources, due to its computationally-expensive decoding process.
We present FDeQ, a QAOA-based FEC Decoder design targeting the popular NextG wireless Low Density Parity Check (LDPC) and Polar codes.
FDeQ achieves successful decoding with error performance at par with state-of-the-art classical decoders at low FEC code block lengths.
- Score: 6.52154420965995
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Forward Error Correction (FEC) provides reliable data flow in wireless networks despite the presence of noise and interference. However, its processing demands significant fraction of a wireless network's resources, due to its computationally-expensive decoding process. This forces network designers to compromise between performance and implementation complexity. In this paper, we investigate a novel processing architecture for FEC decoding, one based on the quantum approximate optimization algorithm (QAOA), to evaluate the potential of this emerging quantum compute approach in resolving the decoding performance-complexity tradeoff. We present FDeQ, a QAOA-based FEC Decoder design targeting the popular NextG wireless Low Density Parity Check (LDPC) and Polar codes. To accelerate QAOA-based decoding towards practical utility, FDeQ exploits temporal similarity among the FEC decoding tasks. This similarity is enabled by the fixed structure of a particular FEC code, which is independent of any time-varying wireless channel noise, ambient interference, and even the payload data. We evaluate FDeQ at a variety of system parameter settings in both ideal (noiseless) and noisy QAOA simulations, and show that FDeQ achieves successful decoding with error performance at par with state-of-the-art classical decoders at low FEC code block lengths. Furthermore, we present a holistic resource estimation analysis, projecting quantitative targets for future quantum devices in terms of the required qubit count and gate duration, for the application of FDeQ in practical wireless networks, highlighting scenarios where FDeQ may outperform state-of-the-art classical FEC decoders.
Related papers
- Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
We implement a decoder that finds the recovery operation with the highest success probability.
We study the decoder performance on a 4.8.8 color code lattice under different noise models.
arXiv Detail & Related papers (2024-05-06T18:17:42Z) - Error correction of parity-encoding-based annealing through post-readout
decoding [0.0]
We show through Monte Carlo simulation that this redundant encoding may be exploited to solve the problems of the inefficiency and computational cost of the parity-encoded scheme.
Our findings open up the possibility of parity-encoded schemes for realizing the QA with near-term quantum technologies.
arXiv Detail & Related papers (2024-02-13T22:55:58Z) - Simultaneous Discovery of Quantum Error Correction Codes and Encoders with a Noise-Aware Reinforcement Learning Agent [0.0]
In this work, we significantly expand the power ofReinforcement learning approaches to QEC code discovery.
Explicitly, we train an RL agent that automatically discovers both QEC codes and their encoding circuits for a given gate set.
We introduce the concept of a noise-aware meta-agent, which learns to produce encoding strategies simultaneously for a range of noise models.
arXiv Detail & Related papers (2023-11-08T15:19:16Z) - Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes [3.4602940992970908]
We introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques.
We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations.
arXiv Detail & Related papers (2023-10-23T14:51:22Z) - Coding for the Gaussian Channel in the Finite Blocklength Regime Using a
CNN-Autoencoder [13.276758337527038]
Supporting low latency communications requires the use of short codes, while attaining vanishing frame error probability (FEP) requires long codes.
This paper investigates the potential of Convolutional Neural Networks autoencoders (CNN-AE) in approaching the theoretical maximum achievable rate.
Numerical results show that the CNN-AE outperforms benchmark schemes and approaches the theoretical maximum rate.
arXiv Detail & Related papers (2023-05-25T19:13:31Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Modular decoding: parallelizable real-time decoding for quantum
computers [55.41644538483948]
Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
arXiv Detail & Related papers (2023-03-08T19:26:10Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Model-based Deep Learning Receiver Design for Rate-Splitting Multiple
Access [65.21117658030235]
This work proposes a novel design for a practical RSMA receiver based on model-based deep learning (MBDL) methods.
The MBDL receiver is evaluated in terms of uncoded Symbol Error Rate (SER), throughput performance through Link-Level Simulations (LLS) and average training overhead.
Results reveal that the MBDL outperforms by a significant margin the SIC receiver with imperfect CSIR.
arXiv Detail & Related papers (2022-05-02T12:23:55Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity.
We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree.
These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
arXiv Detail & Related papers (2022-01-06T21:02:30Z)
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.