Construction and complement circuit of a quantum stabilizer code with length 7

Duc-Manh Nguyen, Sunghwan Kim
{"title":"Construction and complement circuit of a quantum stabilizer code with length 7","authors":"Duc-Manh Nguyen, Sunghwan Kim","doi":"10.1109/ICUFN.2016.7537043","DOIUrl":null,"url":null,"abstract":"In this paper, a new method for the construction of a quantum stabilizer code from circulant permutation matrices is discussed. First, we choose a finite-length vector randomly, and we can construct circulant permutation matrices from the vectors. Then, the parity-check matrix can be produce from the circulant permutation matrices. Hence, the generators of stabilizer code are determined according to the parity-check matrix and quantum stabilizer group are defined from the generators. From the stabilizer group, codewords of the proposed quantum codes can also be generated. Finally, a complete efficient encoding and decoding quantum circuit of [[7,1,3]] is proposed. [[7,1,3]] is stabilizer code that construction based on our method is an seven-qubit code that protects a one-qubit state with up to one error, which is very important for quantum information processing.","PeriodicalId":403815,"journal":{"name":"2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUFN.2016.7537043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In this paper, a new method for the construction of a quantum stabilizer code from circulant permutation matrices is discussed. First, we choose a finite-length vector randomly, and we can construct circulant permutation matrices from the vectors. Then, the parity-check matrix can be produce from the circulant permutation matrices. Hence, the generators of stabilizer code are determined according to the parity-check matrix and quantum stabilizer group are defined from the generators. From the stabilizer group, codewords of the proposed quantum codes can also be generated. Finally, a complete efficient encoding and decoding quantum circuit of [[7,1,3]] is proposed. [[7,1,3]] is stabilizer code that construction based on our method is an seven-qubit code that protects a one-qubit state with up to one error, which is very important for quantum information processing.
长度为7的量子稳定码的构造和补电路
本文讨论了一种利用循环置换矩阵构造量子稳定码的新方法。首先,我们随机选择一个有限长度的向量,然后由这些向量构造循环置换矩阵。然后,由循环置换矩阵得到奇偶校验矩阵。因此,根据奇偶校验矩阵确定了稳定码的生成器,并从这些生成器定义了量子稳定群。从稳定器群中,也可以生成所提出量子码的码字。最后,提出了一个完整的高效编解码量子电路[[7,1,3]]。[[7,1,3]]是稳定器码,基于我们的方法构建的稳定器码是一个7量子位码,可以保护一个量子位的状态,最多有一个错误,这对于量子信息处理非常重要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信