Compare Papers

Paper 1

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

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano

Year
2018
Journal
arXiv preprint
DOI
arXiv:1812.05312
arXiv
1812.05312

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.

Open paper

Paper 2

Category-Based Error Budgeting for Heterogeneous Quantum Processors

Abuqasem I.

Year
2026
Journal
Europe PMC
DOI
10.20944/preprints202602.1979.v1
arXiv
-

No abstract.

Open paper