Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
arXiv:2202.02184 · doi:10.1109/TIT.2023.3277808
Abstract
We show that entirely quantum Shannon theoretic methods, based on von Neumann entropies and their properties, can be used to derive Singleton bounds on the performance of entanglement-assisted hybrid classical-quantum (EACQ) error correcting codes. Concretely, we show that the triple-rate region of qubits, cbits and ebits of possible EACQ codes over arbitrary alphabet sizes is contained in the quantum Shannon theoretic rate region of an associated memoryless erasure channel, which turns out to be a polytope. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size (i.e. Hilbert space dimension) is large enough, in keeping with known facts about classical and quantum minimum distance separable (MDS) codes: in particular, all of its extreme points and all but one of its extremal lines. The attainability of the remaining one extremal line segment is left as an open question.
arXiv comment18 pages, 1 figure; v2 has more details, more references, and self-contained proofs; in v3 some typos are fixed and ORCIDs added; v4 greatly expanded to 22 pages with more references, now 4 figures, improvements to the presentation
References in corpus (22)
- Correcting Quantum Errors with Entanglement
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
- Continuity of quantum conditional information
- Catalytic quantum error correction
- Entanglement-assisted communication of classical and quantum information
- Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
- Entanglement-assisted quantum turbo codes
- Generalization of Quantum Error Correction via the Heisenberg Picture
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Entropic proofs of Singleton bounds for quantum error-correcting codes
- Quantum Error Correction of Observables
- Entanglement-Assisted Quantum Communication Beating the Quantum Singleton Bound
- Entanglement-Assisted Quantum Error-Correcting Codes with Imperfect Ebits
- Classical Enhancement of Quantum Error-Correcting Codes
- On Subsystem Codes Beating the Hamming or Singleton Bound
- Codes for Simultaneous Transmission of Quantum and Classical Information
- One-shot quantum error correction of classical and quantum information
- Hybrid Codes
- One-Shot Hybrid State Redistribution
- Encoding Classical Information in Gauge Subsystems of Quantum Codes
- MDS Entanglement-Assisted Quantum Codes of Arbitrary Lengths and Arbitrary Distances