Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

Carlos Galindo, Fernando Hernando, Ryutaro Yamashita, Diego Ruano

Research output: Contribution to journalJournal articleResearchpeer-review

16 Citations (Scopus)
85 Downloads (Pure)


We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.
Original languageEnglish
Article number116
JournalQuantum Information Processing
Issue number4
Publication statusPublished - 2019


  • Entanglement-assisted quantum error-correcting codes
  • Gilbert–Varshamov bound
  • Symplectic, Hermitian and Euclidean duality


Dive into the research topics of 'Entanglement-assisted quantum error-correcting codes over arbitrary finite fields'. Together they form a unique fingerprint.

Cite this