Quantum Speedup for Polar Maximum Likelihood Decoding

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Fujiwara, Shintaro, Ishikawa, Naoki
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929581868449792
author Fujiwara, Shintaro
Ishikawa, Naoki
author_facet Fujiwara, Shintaro
Ishikawa, Naoki
contents Conventional decoding algorithms for polar codes strive to balance achievable performance and computational complexity in classical computing. While maximum likelihood (ML) decoding guarantees optimal performance, its NP-hard nature makes it impractical for real-world systems. In this letter, we propose a novel ML decoding architecture for polar codes based on the Grover adaptive search, a quantum exhaustive search algorithm. Unlike conventional studies, our approach, enabled by a newly formulated objective function, uniquely supports Gray-coded multi-level modulation without expanding the search space size compared to the classical ML decoding. Simulation results demonstrate that our proposed quantum decoding achieves ML performance while providing a pure quadratic speedup in query complexity.
format Preprint
id arxiv_https___arxiv_org_abs_2411_04727
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quantum Speedup for Polar Maximum Likelihood Decoding
Fujiwara, Shintaro
Ishikawa, Naoki
Quantum Physics
Information Theory
Signal Processing
Conventional decoding algorithms for polar codes strive to balance achievable performance and computational complexity in classical computing. While maximum likelihood (ML) decoding guarantees optimal performance, its NP-hard nature makes it impractical for real-world systems. In this letter, we propose a novel ML decoding architecture for polar codes based on the Grover adaptive search, a quantum exhaustive search algorithm. Unlike conventional studies, our approach, enabled by a newly formulated objective function, uniquely supports Gray-coded multi-level modulation without expanding the search space size compared to the classical ML decoding. Simulation results demonstrate that our proposed quantum decoding achieves ML performance while providing a pure quadratic speedup in query complexity.
title Quantum Speedup for Polar Maximum Likelihood Decoding
topic Quantum Physics
Information Theory
Signal Processing
url https://arxiv.org/abs/2411.04727