Construction of minimal trellises for quantum stabilizer codes

作     者：XIAO FangYing CHEN HanWu 

作者机构：School of Computer Science and EngineeringSoutheast University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2013年第56卷第1期

页      面：208-218页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 070201[理学-理论物理] 081101[工学-控制理论与控制工程] 0701[理学-数学] 0811[工学-控制科学与工程] 0702[理学-物理学] 

基　　金：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) 

主　　题：quantum stabilizer code check matrix trellis Pauli matrix 

摘      要：The size of vertex set of quantum trellises affects the efficiency of decoding algorithms,which can be improved by reducing the number of *** on the standard check matrix of stabilizer codes,an algorithm to construct trellis-oriented generators for quantum stabilizer codes is *** using this algorithm,the trellises with minimal vertex set can be *** addition,an algorithm to construct trellises iteratively for quantum stabilizer codes is also *** 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.