Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
