Javascript must be enabled to continue!
Short Block-length Channel Coded Modulation with Random Linear Codes and QAOA Decoding
View through CrossRef
Quantum approximate optimization algorithm (QAOA) is used for NP-hard
problems on noisy intermediate-scale quantum (NISQ) devices. We
demonstrate QAOA’s near-optimum maximum likelihood (ML) decoding for
short block-lengths in Gaussian channels using random linear codes and
channel coded modulation. Simulations with a p-layer QAOA decoder for
 p ∈ [1, 4], coding rates R = k/n ∈ [0.3, 1],
signal-to-noise ratio (SNR)  ∈  [0, 10] dB and k ∈ [10,
26] show near-optimum bit and block error rates. We conjecture
near-optimum performance for p ∈ [1, 10], R = 0.5, SNR = 10 dB and
k ≦ 250 indicating QAOA’s potential in short block-length decoding.
Title: Short Block-length Channel Coded Modulation with Random Linear Codes and QAOA Decoding
Description:
Quantum approximate optimization algorithm (QAOA) is used for NP-hard
problems on noisy intermediate-scale quantum (NISQ) devices.
We
demonstrate QAOA’s near-optimum maximum likelihood (ML) decoding for
short block-lengths in Gaussian channels using random linear codes and
channel coded modulation.
Simulations with a p-layer QAOA decoder for
 p ∈ [1, 4], coding rates R = k/n ∈ [0.
3, 1],
signal-to-noise ratio (SNR)  ∈  [0, 10] dB and k ∈ [10,
26] show near-optimum bit and block error rates.
We conjecture
near-optimum performance for p ∈ [1, 10], R = 0.
5, SNR = 10 dB and
k ≦ 250 indicating QAOA’s potential in short block-length decoding.
Related Results
Short Block-length Channel Coded Modulation with Random Linear Codes and QAOA Decoding
Short Block-length Channel Coded Modulation with Random Linear Codes and QAOA Decoding
<p>Quantum approximate optimization algorithm (QAOA) is used for NP-hard problems on noisy intermediate-scale quantum (NISQ) devices. We demonstrate <u>QAOA's</u>...
En skvatmølle i Ljørring
En skvatmølle i Ljørring
A Horizontal Mill at Ljørring, Jutland.Horizontal water-mills have been in use in Jutland since the beginning of the Christian era 2). But the one here described shows so close a c...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
Improving Decodability of Polar Codes by Adding Noise
Improving Decodability of Polar Codes by Adding Noise
This paper presents an online perturbed and directed neural-evolutionary (Online-PDNE) decoding algorithm for polar codes, in which the perturbation noise and online directed neuro...
Maximum-likelihood detection with QAOA for massive MIMO and Sherrington-Kirkpatrick model with local field at infinite size
Maximum-likelihood detection with QAOA for massive MIMO and Sherrington-Kirkpatrick model with local field at infinite size
<p>Quantum-approximate optimization algorithm (QAOA) is promising in Noisy Intermediate-Scale Quantum (NISQ) computers with applications for NP-hard combinatorial optimiz...
Work Values
Work Values
Research has identified TV series and, also more recently social media, as different actors in vocational socialization, providing individuals with career-related information (Levi...
FinFET Devices and Integration
FinFET Devices and Integration
Through more than a decade of industry wide R&D effort, 3D-FinFET has found its way into manufacturing. In this abstract, we review the key progress in process and integration ...
Optimized Generalized LDPC Convolutional Codes
Optimized Generalized LDPC Convolutional Codes
In this paper, some optimized encoding and decoding schemes are proposed for the generalized LDPC convolutional codes (GLDPC–CCs). In terms of the encoding scheme, a flexible dopin...

