Quantum Maximum Likelihood Decoding for Linear Block Codes

Quantum Maximum Likelihood Decoding for Linear Block Codes
复制标题

线性分组码的量子最大似然解码

DOI:
10.1109/ictc49870.2020.9289350
复制
发表时间:
2020
期刊:
2020 International Conference on Information and Communication Technology Convergence (ICTC)
影响因子:
--
通讯作者:
J. Ha
J. Ha
中科院分区:
--
文献类型:
--
作者:
Hyunwoo Jung;Jeonghwan Kang;J. Ha

文献摘要

参考文献

被引文献

相似文献

虽然最大似然解码(MLD)是最佳的,但它的解码复杂度很高。在这项工作中,我们提出了一种用于线性分组码的量子MLD(QMLD),它以降低的渐近复杂度提供了最佳的解码性能。为此,我们利用 Diirr-Høyer 算法 (DHA) 来找出接收信号向量 y 的码字 cML,最大化线性码 C 中码字之间的条件概率 Pr(y|c)。同时,DHA 需要表示所有可能码字的等概率叠加的量子态作为其输入。为了解决技术挑战,这项工作提出了一种新颖的量子电路,可以产生 DHA 的输入量子态。将比较所提出的 QMLD 和经典 MLD 的复杂性,这清楚地证明了所提出的 QMLD 的计算优势。
While the maximum likelihood decoding (MLD) is optimal, it suffers from a high decoding complexity. In this work, we propose a quantum MLD (QMLD) for linear block codes, which provides an optimal decoding performance at reduced asymptotic complexity. To this end, we utilize the Diirr- Høyer Algorithm (DHA) to find out a codeword, cML for a received signal vector y maximizing the conditional probability Pr(y|c) among codewords in a linear code C. Meanwhile, the DHA requires a quantum state representing the equiprobable superposition of all possible codewords as its input. To resolve the technical challenge, this work proposes a novel quantum circuit that produces the input quantum state to the DHA. Complexities of the proposed QMLD and classic MLD will be compared, which clearly demonstrates the computational superiority of the proposed QMLD.
DOI: 10.1214/11-sts378
发表时间: 2012-08-01
影响因子: 5.7
作者:
Wang, Yazhen
通讯作者: Wang, Yazhen