Bounds on entanglement assisted source-channel coding via the Lovász number and its variants

DOI10.4230/LIPICS.TQC.2014.48MaRDI QIDQ2969047zbMATH OpenOpenAlexFDO

Authors L. Mančinska, David Roberson, Simone Severini, Dan Stahlke, Andreas Winter, Toby Cubitt

Publication date 13 March 2017

Full work available at URL https://arxiv.org/pdf/1310.7120

zbMATH Keywords

Lovász thetasource-channel codingzero-error capacity

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Violating the Shannon capacity of metric graphs with entanglement
• Sandwich theorems and capacity bounds for non-commutative graphs
• Quantum homomorphisms

Cited in

(1)

• Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity

This page was built for publication: Bounds on entanglement assisted source-channel coding via the Lovász \(\vartheta\) number and its variants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969047)