Construction of minimal trellises for quantum stabilizer codes  

作　　者：XIAO FangYing CHEN HanWu 

机构地区：[1]School of Computer Science and Engineering,Southeast University

出　　处：《Science China(Information Sciences)》2013年第1期204-214,共11页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 60873101,61170321);Research Fund for the Doctoral (Grant No. 20110092110024);Research Foundation of Graduate School of Southeast University (Grant No. YBJJ0820)

摘　　要：The size of vertex set of quantum trellises affects the efficiency of decoding algorithms, which can be 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.The size of vertex set of quantum trellises affects the efficiency of decoding algorithms, which can be 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.

关 键 词：quantum stabilizer code check matrix TRELLIS Pauli matrix 

分 类 号：O413[理学—理论物理] TN911.2[理学—物理]