Sandwich theorems and capacity bounds for non-commutative graphs

DOI10.1016/j.jcta.2020.105302zbMath1448.05159arXiv1907.11504OpenAlexW2964532533MaRDI QIDQ2005181

Andreas Winter, G. Boreland, Ivan G. Todorov

Publication date: 7 October 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Shannon capacitysandwich theoremquantum channelLovász numbernon-commutative graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Information theoretic parameters of noncommutative graphs and convex corners ⋮ Synchronicity for quantum non-local games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum systems, channels, information. A mathematical introduction.
• Entropy splitting for antiblocking corners and perfect graphs
• A continuity theorem for Stinespring's dilation
• Relaxations of vertex packing
• Completely positive linear maps on complex matrices
• Geometric algorithms and combinatorial optimization.
• The sandwich theorem
• Lovász theta type norms and operator systems
• Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• Quantum Computation and Quantum Information
• On the Shannon capacity of a graph
• The Theory of Quantum Information
• Complexity and Capacity Bounds for Quantum Channels
• A “quantum” Ramsey theorem for operator systems

This page was built for publication: Sandwich theorems and capacity bounds for non-commutative graphs