Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number

From MaRDI portal
Publication:2989436

DOI10.1109/TIT.2012.2221677zbMATH Open1364.81059arXiv1002.2514OpenAlexW3103029110WikidataQ56030588 ScholiaQ56030588MaRDI QIDQ2989436FDOQ2989436


Authors: Runyao Duan, Simone Severini, Andreas Winter Edit this on Wikidata


Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain operator space as the quantum generalisation of the adjacency matrix, in terms of which the plain, quantum and entanglement-assisted capacity can be formulated, and for which we show some new basic properties. Most importantly, we define a quantum version of Lovasz' famous theta function, as the norm-completion (or stabilisation) of a "naive" generalisation of theta. We go on to show that this function upper bounds the number of entanglement-assisted zero-error messages, that it is given by a semidefinite programme, whose dual we write down explicitly, and that it is multiplicative with respect to the natural (strong) graph product. We explore various other properties of the new quantity, which reduces to Lovasz' original theta in the classical case, give several applications, and propose to study the operator spaces associated to channels as "non-commutative graphs", using the language of Hilbert modules.


Full work available at URL: https://arxiv.org/abs/1002.2514




Recommendations




Cited In (82)





This page was built for publication: Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number

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