Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/american-physical-society-aps/linear-plotkin-bound-for-entanglement-assisted-quantum-codes-Hjz66hHtiB
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- American Physical Society (APS)
- Copyright
- ©2013 American Physical Society
- ISSN
- 1050-2947
- DOI
- 10.1103/PhysRevA.87.032309
- Publisher site
- See Article on Publisher Site
Abstract
The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using the special structure of linear EAQECCs, we derive an EA-Plotkin bound for linear EAQECCs, which strengthens the previous known EA-Plotkin bound. This linear EA-Plotkin bound is tighter then the EA-Singleton bound, and matches the EA-Hamming bound and the EA-linear programming bound in some cases. We also construct three families of EAQECCs with good parameters. Some of these EAQECCs saturate this linear EA-Plotkin bound and the others are near optimal according to this bound; almost all of these linear EAQECCs are degenerate codes.
Journal
Physical Review A – American Physical Society (APS)
Published: Mar 7, 2013