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

December 13, 2018 Β· Declared Dead Β· πŸ› Quantum Information Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano arXiv ID 1812.05312 Category cs.IT: Information Theory Cross-listed quant-ph Citations 129 Venue Quantum Information Processing Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted