ENTANGLEMENT-ASSISTED QUANTUM ERROR-CORRECTING CODES CONSTRUCTED FROM IRREGULAR REPEAT ACCUMULATE CODES
Yun-Jiang Wang, Baoming Bai, Wenbo Zhao, Xinmei Wang · International Journal of Quantum Information · 2009
In some contexts, it would make sense to look for codes that can use the maximal amount of shared ebits between sender and receiver, in order to boost qubit channel yield. Also, the codes are also expected to have feat net rates, when there are not enough ebits shared between the sender and receiver. In this paper, entanglement-assisted irregular quantum error-correcting codes achieving this goal are constructed from quaternary classical irregular repeat accumulate codes. Because of their sparse tanner graphs, the constructed codes have relatively low polynomial time-encoding complexity, and can be efficiently decoded by using sum–product algorithm. Moreover, the simulation results show that they outperform their existing quantum regular counterparts which are based on binary classical regular codes.