The Haemers bound of noncommutative graphs

arXiv2002.02743MaRDI QIDQ6334308FDOQ6334308

Publication date: 7 February 2020

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'asz theta function (Duan-Severini-Winter, IEEE Trans. Inform. Theory, 2013 and Boreland-Todorov-Winter, arXiv, 2019).

This page was built for publication: The Haemers bound of noncommutative graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6334308)