摘要
量子网格图顶点集的大小影响译码算法的效率,减少网格图的顶点数可以提高译码算法的效率.本文基于标准化的稳定子群校验矩阵,给出了构造面向网格图的稳定子群生成元的方法,据此可以构造顶点集最小的量子网格图.此外,本文通过分析差错算子与稳定子群生成元各个量子位的对易关系对两算子之间对易关系的影响,给出了一种快速生成量子稳定子码网格图的方法.现有构造方法对各顶点集分别独立计算,没有利用已有的计算结果,所以运算量大,这限制了译码的规模和速度.本文方法是在已有顶点集的基础上,利用迭代法构造新顶点集,该方法计算复杂性更小、算法效率更高,从而能适应规模更大和对时间要求更高的应用.
The size of vertex set of quantum trellises affects the efficiency of decoding algorithms, wmcn can De improved by reducing the number of vertices. Based on the standard check matrix of stabilizer codes, an algorithm to construct trellis-oriented generators for quantum stabilizer codes is presented. By using this algorithm, the trellises with minimal vertex set can be constructed. In addition, an algorithm to construct trellises iteratively for quantum stabilizer codes is also introduced. The algorithm proposed in this paper is more efficient and less complex than the one proposed by Olliver, and so is more suitable for the applications of larger scale and stricter timeliness.
出处
《中国科学：信息科学》
CSCD
2013年第4期502-514,共13页
Scientia Sinica(Informationis)
基金
国家自然科学基金(批准号:60873101
61170321)
高等学校博士学科点专项科研基金(批准号:20110092-110024)
东南大学优秀博士论文基金(批准号:YBJJ0820)资助项目
