Factor-Graph Representations Of Stabilizer Quantum Codes

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)(2016)

引用 3|浏览10
暂无评分
摘要
We study normal factor graph (NFG) representations of stabilizer quantum error-correction codes (QECCs), in particular NFG representations of the stabilizer label code and the normalizer label code associated with a stabilizer QECC. The structure of the NFGs we are using is such that the (symplectic) self-orthogonality constraint that stabilizer label codes have to satisfy can be proven rather straightforwardly by applying certain NFG reformulations. We show that a variety of well-known stabilizer QECCs can be expressed in this framework: (tail-biting) convolutional stabilizer QECCs, the toric stabilizer QECCs by Kitaev, and a class of stabilizer QECCs that was recently introduced by Tillich and Zemor. Our approach not only gives new insights into these stabilizer QECCs, but will ultimately help to formulate new classes of stabilizer QECCs and low-complexity (approximate) decoding algorithms.
更多
查看译文
关键词
low-complexity approximate decoding algorithms,toric stabilizer QECC,tail-biting convolutional stabilizer QECC,self-orthogonality constraint,normalizer label code,stabilizer label code,stabilizer quantum error-correction codes,NFG representations,normal factor graph representations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要