Sandwich theorems and capacity bounds for non-commutative graphs
Authors:
- G. BorelandGBG. Boreland
- I.G. TodorovITI.G. Todorov
- A. WinterAWA. Winter
- 1 January 2021
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 177
Abstract
No abstract availableKeywords
Funding Information
- Ministerio de Economàa y Competitividad (FIS2016-80681-P)
- European Regional Development Fund
- Generalitat de Catalunya (2017-SGR-1127)
This publication has 11 references indexed in Scilit:
- A “quantum” Ramsey theorem for operator systemsProceedings of the American Mathematical Society, 2017
- Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph TheoryIEEE Transactions on Information Theory, 2015
- Lovász theta type norms and operator systemsLinear Algebra and its Applications, 2015
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász NumberIEEE Transactions on Information Theory, 2012
- A continuity theorem for Stinespring's dilationJournal of Functional Analysis, 2008
- Entropy splitting for antiblocking corners and perfect graphsCombinatorica, 1990
- Relaxations of vertex packingJournal of Combinatorial Theory, Series B, 1986
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Completely positive linear maps on complex matricesLinear Algebra and its Applications, 1975
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956