量子稳定子码的概率译码  

Probabilistic decoding algorithm for quantum stabilizer codes

作　　者：肖芳英[1] 陈汉武[1] 

机构地区：[1]东南大学计算机科学与工程学院,江苏南京210096

出　　处：《通信学报》2011年第10期59-66,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(60873101);江苏省自然科学基金资助项目(2008209);东南大学优秀博士论文基金资助项目(YBJJ0820)~~

摘　　要：为了提高量子稳定子码的译码速率,提出了一种基于校验矩阵的量子概率译码算法。通过选择具有最小量子权重的算子作为差错算子来减少译码出错概率,通过预先构造量子标准阵列来缩短译码时间。与已有的量子最大似然译码算法相比,该算法对简并码和非简并码采用统一的译码方式,从而提高了简并码的译码可靠性。此外,算法不需要预先寻找差错算子对应的向量空间的基,因此算法复杂度更小。To improve the performance of quantum decoding algorithm,a quantum probabilistic decoding algorithm（QPDA） based on the check matrix for quantum stabilizer codes was proposed.To achieve low error rates the error op-erator with the minimum quantum weight was chosen and to shorten the time of decoding a quantum standard array（QSA） was constructed before decoding.Comparing with the quantum maximum likelihood decoding algorithm,the QPAD improves the reliability of degenerate decoding due to uniform decoding methods for degenerate and non-degenerate codes,furthermore,has less complexity due to does not require pre-search the bases of vector space cor-responding to the error operator.

关 键 词：量子稳定子码 校验矩阵 量子标准阵列 

分 类 号：TP387[自动化与计算机技术—计算机系统结构]