Dualities and identities for entanglement-assisted quantum codes

Ching-Yi Lai*, Todd A. Brun, Mark M. Wilde

*此作品的通信作者

研究成果: Article同行評審

23 引文 斯高帕斯(Scopus)

摘要

The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code's information qubits with its ebits. To introduce this notion, we show how entanglement-assisted repetition codes and accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We also establish the Gilbert-Varshamov bound and the Plotkin bound for EAQEC codes, and we use these to examine the existence of some EAQEC codes. Finally, we provide upper bounds on the block error probability when transmitting maximal-entanglement EAQEC codes over the depolarizing channel, and we derive variations of the hashing bound for EAQEC codes, which is a lower bound on the maximum rate at which reliable communication over Pauli channels is possible with the use of pre-shared entanglement.

原文English
頁(從 - 到)957-990
頁數34
期刊Quantum Information Processing
13
發行號4
DOIs
出版狀態Published - 1 一月 2014

指紋

深入研究「Dualities and identities for entanglement-assisted quantum codes」主題。共同形成了獨特的指紋。

引用此