The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes

Kao Yueh Kuo, Ching-Yi Lai

研究成果: Paper同行評審

3 引文 斯高帕斯(Scopus)

摘要

Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a decoding process.A good encoding circuit should have some desired features, such as low depth, few gates, and so on. In this paper, we show how to practically implement an encoding circuit of gate complexity O(n(n - k + c)/ log n) for an [[n, k; c]] quantum stabilizer code with the help of c pairs of maximally-entangled states. For the special case of an [[n, k]] stabilizer code with c = 0, the encoding complexity is O(n(n-k)/ log n), which is previously known to be O(n2/ log n). For c > 0, this suggests that the benefits from shared entanglement come at an additional cost of encoding complexity.Finally we discuss decoding of entanglement-assisted quantum stabilizer codes and extend previously known computational hardness results on decoding quantum stabilizer codes.

原文American English
頁面2893-2897
頁數5
DOIs
出版狀態Published - 7月 2019
事件2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
持續時間: 7 7月 201912 7月 2019

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
國家/地區France
城市Paris
期間7/07/1912/07/19

指紋

深入研究「The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes」主題。共同形成了獨特的指紋。

引用此