Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants

DOI10.1109/TIT.2014.2349502zbMath1360.81053arXiv1310.7120OpenAlexW3103988172WikidataQ57521842 ScholiaQ57521842MaRDI QIDQ2983376

Andreas Winter, Simone Severini, Laura Mančinska, David E. Roberson, Dan Stahlke, Toby S. Cubitt

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Quantum coherence, entanglement, quantum correlations (81P40) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Graph operations (line graphs, products, etc.) (05C76) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (10)

Conic formulations of graph homomorphisms ⋮ Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone ⋮ Shannon capacity and the categorical product ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ Resource convertibility and ordered commutative monoids ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ A unified construction of semiring-homomorphic graph invariants ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Spectral lower bounds for the orthogonal and projective ranks of a graph

This page was built for publication: Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants