Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2011.6034211
DC FieldValue
dc.titleZero-error communication via quantum channels and a quantum Lovász script v sign-function
dc.contributor.authorDuan, R.
dc.contributor.authorSeverini, S.
dc.contributor.authorWinter, A.
dc.date.accessioned2014-12-12T08:03:49Z
dc.date.available2014-12-12T08:03:49Z
dc.date.issued2011
dc.identifier.citationDuan, R.,Severini, S.,Winter, A. (2011). Zero-error communication via quantum channels and a quantum Lovász script v sign-function. IEEE International Symposium on Information Theory - Proceedings : 64-68. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ISIT.2011.6034211" target="_blank">https://doi.org/10.1109/ISIT.2011.6034211</a>
dc.identifier.isbn9781457705953
dc.identifier.issn21578104
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/117285
dc.description.abstractWe 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. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2011.6034211
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1109/ISIT.2011.6034211
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page64-68
dc.description.codenPISTF
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.