Zero-error source-channel coding with entanglement

DOI10.1007/978-88-7642-475-5_26MaRDI QIDQ6829125zbMATH OpenFDO

Authors Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, G. Scarpa

Publication date 11 June 2014

Published in The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/21679

zbMATH Keywords

entanglementnon-commutative graph theoryquantum channel capacity

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Coding theorems (Shannon theory) (94A24)

Review text

In the paper under review the are studying a quantum version of source-channel coding problem. A brief, but well written introduction of classical problem is stated, which is followed by the quantum version.\N\NThe classical part of the problem is equivalent of finding chromatic number of the characteristic graph of the discrete dual source. In the quantum case, this naturally becomes a problem of non-commutative graph theory. The authors have given natural extensions of definitions of chromatic number and independence number for such graphs. Using these, it has been shown that entanglement can allow unbounded decrease in the asymptotic rate of classical source channel codes. Consequently, the authors have given a lower bound for source code in terms of Lovász theta number.\N\NFor the entire collection see [Zbl 1271.05002].

This page was built for publication: Zero-error source-channel coding with entanglement

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