TY - GEN
T1 - Zero-error communication via quantum channels and a quantum Lovász script v sign-function
AU - Duan, Runyao
AU - Severini, Simone
AU - Winter, Andreas
PY - 2011
Y1 - 2011
N2 - 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 linear space operators 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 Lovász' famous script v sign function, as the norm-completion (or stabilisation) of a "naive" generalisation of script v sign. 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 Lovász' original script v sign in the classical case, give several applications, and propose to study the linear spaces of operators associated to channels as "non-commutative graphs", using the language of operator systems and Hilbert modules.
AB - 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 linear space operators 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 Lovász' famous script v sign function, as the norm-completion (or stabilisation) of a "naive" generalisation of script v sign. 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 Lovász' original script v sign in the classical case, give several applications, and propose to study the linear spaces of operators associated to channels as "non-commutative graphs", using the language of operator systems and Hilbert modules.
UR - http://www.scopus.com/inward/record.url?scp=80054805312&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6034211
DO - 10.1109/ISIT.2011.6034211
M3 - Conference contribution
AN - SCOPUS:80054805312
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 64
EP - 68
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -