Information theoretic parameters of noncommutative graphs and convex corners
DOI10.1215/00192082-9799163zbMath1492.05063arXiv2103.14091OpenAlexW3150137633MaRDI QIDQ2152773
G. Boreland, Andreas Winter, Ivan G. Todorov
Publication date: 11 July 2022
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.14091
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17) Information theory (general) (94A15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum entropies (81P17) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric graphs with respect to graph entropy
- Tensor products of operator systems
- Entropy splitting for antiblocking corners and perfect graphs
- Relaxations of vertex packing
- Perfect couples of graphs
- Geometric algorithms and combinatorial optimization
- On the Shannon capacity of probabilistic graphs
- The sandwich theorem
- Sandwich theorems and capacity bounds for non-commutative graphs
- 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
- Continuity bounds on the quantum relative entropy
- Fredman–Komlós bounds and information theory
- The zero-error side information problem and chromatic numbers (Corresp.)
- On the Shannon capacity of a graph
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Complexity and Capacity Bounds for Quantum Channels
- Inequalities for quantum entropy: A review with conditions for equality
- An Extreme Form of Superactivation for Quantum Zero-Error Capacities
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- A “quantum” Ramsey theorem for operator systems
- A lower bound on graph entropy
- Quantum Information Theory
- Graph pairs and their entropies: Modularity problems
