Encoding entanglement-assisted quantum stabilizer codes

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...

Full description

Saved in:
Bibliographic Details
Published inChinese physics B Vol. 21; no. 2; pp. 88 - 93
Main Author 王云江 白宝明 李卓 彭进业 肖鹤玲
Format Journal Article
LanguageEnglish
Published 01.02.2012
Subjects
Algorithms
Circuits
Complexity
Computer programs
Consumption
Encoding
Gates (circuits)
Programming
Qubits (quantum computing)
控制非门
电路组成
稳定
纠缠
编码
计算机编程
迭代算法
量子纠错码
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Wang Yun-Jiang, Bai Bao-Ming, Li Zhuo, Peng Jin-Ye, Xiao He-Ling a） State Key Laboratory of ISN, Department of Telecommunications Engineering, Xidian University, Xi＇an 710071, China b） School of Electronics and Information, Northwestern Polytechnical University, Xi＇an 710069, China c） The Key Laboratory of AIPPC of Ministry of Education, Northwestern Polyteehnical University, Xi＇an 710069, China
quantum error correction, entanglement-assisted quantum stabilizer codes, encodingcomplexity
11-5639/O4
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.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-1056
2058-3834
1741-4199
DOI:10.1088/1674-1056/21/2/020304