Encoding entanglement-assisted quantum stabilizer codes
- ISSN号:1674-1056
- 期刊名称:《中国物理B:英文版》
- 时间:0
- 分类:O413[理学—理论物理;理学—物理] TN911.22[电子电信—通信与信息系统;电子电信—信息与通信工程]
- 作者机构:[1]State Key Laboratory of ISN, Department of Telecommunications Engineering, Xidian University, Xi'an 710071, China, [2]School of Electronics and Information, Northwestern Polytechnical University, Xi'an 710069, China, [3]The Key Laboratory of AIPPC of Ministry of Education, Northwestern Polytechnical University, Xi'an 710069, China
- 相关基金:Project supported by the National Basic Research Program of China (Grant No. 2010CB328300), the National Natural Science Foundation of China (Grant Nos. 60972046 and 60902030), the Program for Chang, jiang Scholars and Innovative Research Team in University (Grant No. IRT0852), the Natural Science Foundation of Shaanxi Province (Grant No. 2010JQ8025), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20100203120004), the 111 Program (Grant No. B08038), and the China Scholarship Council (Grant No. [200813019).
关键词:
量子纠错码, 编码, 纠缠, 稳定, 迭代算法, 计算机编程, 控制非门, 电路组成, quantum error correction, entanglement-assisted quantum stabilizer codes, encodingcomplexity
中文摘要:
We address the problem of encoding entanglement-assisted (EA) quantum error-correcting codes (QECCs) and of the corresponding complexity.We present an iterative algorithm from which a quantum circuit composed of CNOT,H,and S gates can be derived directly with complexity O(n~2) to encode the qubits being sent.Moreover,we derive the number of each gate consumed in our algorithm according to which we can design EA QECCs with low encoding complexity.Another advantage brought by our algorithm is the easiness and efficiency of programming on classical computers.
英文摘要:
We address the problem of encoding entanglement-assisted (EA) quantum error-correcting codes (QECCs) and of the corresponding complexity. We present an iterative algorithm from which a quantum circuit composed of CNOT, H, and S gates can be derived directly with complexity O(n2) to encode the qubits being sent. Moreover, we derive the number of each gate consumed in our algorithm according to which we can design EA QECCs with low encoding complexity. Another advantage brought by our algorithm is the easiness and efficiency of programming on classical computers.