TY - JOUR
T1 - Zero-error channel capacity and simulation assisted by non-local correlations
AU - Cubitt, Toby S.
AU - Leung, Debbie
AU - Matthews, William
AU - Winter, Andreas
N1 - Funding Information:
Manuscript received May 11, 2010; revised January 06, 2011; accepted April 13, 2011. Date of current version July 29, 2011. The work of T. S. Cubitt was supported by a Leverhulme early-career fellowship and the EC project “QAP” under Contract IST-2005-15848. The work of D. Leung was funded by the CRC, CFI, ORF, CIFAR, NSERC, and QuantumWorks. The work of W. Matthews was supported by NSERC and QuantumWorks. The work of A. Winter was supported by the EC, the U.K. EPSRC, the Royal Society, and a Philip Leverhulme Prize. The Centre for Quantum Technologies, National University of Singapore, is funded by the Singapore MoE and the NRF as part of the Research Centres of Excellence programme. This work was supported in part by the NSF under Grant PHY05-51164. T. Cubitt is with the Universidad Computense de Madrid, Madrid, Spain.
PY - 2011/8
Y1 - 2011/8
N2 - The theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i.e., shared randomness, shared entanglement and arbitrary nonsignalling correlations. When the channel being simulated is noiseless, this is zero-error coding assisted by correlations. When the resource channel is noiseless, it is the reverse problem of simulating a noisy channel exactly by a noiseless one, assisted by correlations. In both cases, separations between the power of the different classes of assisting correlations are exhibited for finite block lengths. The most striking result here is that entanglement can assist in zero-error communication. In the large block length limit, shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation, but not for asymptotic zero-error coding. For assistance by arbitrary nonsignalling correlations, linear programming formulas for the asymptotic capacity and simulation rates are derived, the former being equal (for channels with nonzero unassisted capacity) to the feedback-assisted zero-error capacity derived by Shannon. Finally, a kind of reversibility between nonsignalling-assisted zero-error capacity and exact simulation is observed, mirroring the usual reverse Shannon theorem.
AB - The theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i.e., shared randomness, shared entanglement and arbitrary nonsignalling correlations. When the channel being simulated is noiseless, this is zero-error coding assisted by correlations. When the resource channel is noiseless, it is the reverse problem of simulating a noisy channel exactly by a noiseless one, assisted by correlations. In both cases, separations between the power of the different classes of assisting correlations are exhibited for finite block lengths. The most striking result here is that entanglement can assist in zero-error communication. In the large block length limit, shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation, but not for asymptotic zero-error coding. For assistance by arbitrary nonsignalling correlations, linear programming formulas for the asymptotic capacity and simulation rates are derived, the former being equal (for channels with nonzero unassisted capacity) to the feedback-assisted zero-error capacity derived by Shannon. Finally, a kind of reversibility between nonsignalling-assisted zero-error capacity and exact simulation is observed, mirroring the usual reverse Shannon theorem.
KW - Channel coding
KW - graph capacities
KW - quantum entanglement
KW - zero-error information theory
UR - http://www.scopus.com/inward/record.url?scp=79961006837&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2159047
DO - 10.1109/TIT.2011.2159047
M3 - Review article
AN - SCOPUS:79961006837
SN - 0018-9448
VL - 57
SP - 5509
EP - 5523
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 8
M1 - 5961832
ER -