Information theoretic parameters of noncommutative graphs and convex corners
From MaRDI portal
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quantum entropies (81P17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Information theory (general) (94A15) Measures of information, entropy (94A17)
Abstract: We establish a second anti-blocker theorem for non-commutative convex corners, show that the anti-blocking operation is continuous on bounded sets of convex corners, and define optimisation parameters for a given convex corner that generalise well-known graph theoretic quantities. We define the entropy of a state with respect to a convex corner, characterise its maximum value in terms of a generalised fractional chromatic number and establish entropy splitting results that demonstrate the entropic complementarity between a convex corner and its anti-blocker. We identify two extremal tensor products of convex corners and examine the behaviour of the introduced parameters with respect to tensoring. Specialising to non-commutative graphs, we obtain quantum versions of the fractional chromatic number and the clique covering number, as well as a notion of non-commutative graph entropy of a state, which we show to be continuous with respect to the state and the graph. We define the Witsenhausen rate of a non-commutative graph and compute the values of our parameters in some specific cases.
Recommendations
Cites work
- A ``quantum Ramsey theorem for operator systems
- A lower bound on graph entropy
- An Extreme Form of Superactivation for Quantum Zero-Error Capacities
- Complexity and Capacity Bounds for Quantum Channels
- Continuity bounds on the quantum relative entropy
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Entropy splitting for antiblocking corners and perfect graphs
- Fredman–Komlós bounds and information theory
- Geometric algorithms and combinatorial optimization
- Graph pairs and their entropies: Modularity problems
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3468645 (Why is no real title available?)
- scientific article; zbMATH DE number 1351867 (Why is no real title available?)
- scientific article; zbMATH DE number 1120256 (Why is no real title available?)
- scientific article; zbMATH DE number 1849957 (Why is no real title available?)
- scientific article; zbMATH DE number 780788 (Why is no real title available?)
- scientific article; zbMATH DE number 6116733 (Why is no real title available?)
- Inequalities for quantum entropy: A review with conditions for equality
- On the Shannon capacity of a graph
- On the Shannon capacity of probabilistic graphs
- Perfect couples of graphs
- Perfect graphs and graph entropy: An updated survey
- Quantum information theory
- Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
- Relaxations of vertex packing
- Sandwich theorems and capacity bounds for non-commutative graphs
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- Symmetric graphs with respect to graph entropy
- Tensor products of operator systems
- The sandwich theorem
- The zero-error side information problem and chromatic numbers (Corresp.)
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
Cited in
(5)
This page was built for publication: Information theoretic parameters of noncommutative graphs and convex corners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152773)
