Abstract

We present two new constructions of entanglement-assisted quantum error-correcting codes using some fundamental properties of (classical) linear codes in an effective way. The main ideas include linear complementary dual codes and related concatenation constructions. Numerical examples in modest lengths show that our constructions perform better than known constructions in the literature. We also give a proof on a generalization of binary Singleton type bound on entanglement-assisted quantum error-correcting codes to arbitrary q-ary entanglement-assisted quantum error-correcting codes.

Full Text
Published version (Free)

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 call