The Haemers Bound of Noncommutative Graphs

Sander Gribling, Yinan Li

Research output: Contribution to journalArticleScientificpeer-review

15 Downloads (Pure)

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 preprint, 2019).
Original languageEnglish
Pages (from-to)424-431
JournalIEEE Journal on Selected Areas in Information Theory
Volume1
Issue number2
DOIs
Publication statusPublished - 31 Jul 2020
Externally publishedYes

Fingerprint

Dive into the research topics of 'The Haemers Bound of Noncommutative Graphs'. Together they form a unique fingerprint.

Cite this