The Haemers bound of noncommutative graphs
arXiv:2002.02743
Abstract
We continue the study of the quantum channel version of Shannon's zero-error capacity problem. We generalize the celebrated Haemers bound to noncommutative graphs (obtained from quantum channels). We prove basic properties of this bound, such as additivity under the direct sum and submultiplicativity under the tensor product. The Haemers bound upper bounds the Shannon capacity of noncommutative graphs, and we show that it can outperform other known upper bounds, including noncommutative analogues of the Lovász theta function (Duan-Severini-Winter, IEEE Trans. Inform. Theory, 2013 and Boreland-Todorov-Winter, arXiv, 2019).
arXiv commentComments welcome
References in corpus (7)
- Graph Homomorphisms for Quantum Players
- Super-Activation of Zero-Error Capacity of Noisy Quantum Channels
- New lower bound on the Shannon capacity of C7 from circular graphs
- Sandwich theorems and capacity bounds for non-commutative graphs
- Complexity and capacity bounds for quantum channels
- Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
- Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities