On the quantum no-signalling assisted zero-error classical simulation cost of non-commutative bipartite graphs

Abstract

Using one channel to simulate another exactly with the aid of quantum no-signalling correlations has been studied recently. The one-shot no-signalling assisted classical zero-error simulation cost of non-commutative bipartite graphs has been formulated as semidefinite programms [Duan and Winter, IEEE Trans. Inf. Theory 62, 891 (2016)]. Before our work, it was unknown whether the one-shot (or asymptotic) no-signalling assisted zero-error classical simulation cost for general non-commutative graphs is multiplicative (resp. additive) or not. In this paper we address these issues and give a general sufficient condition for the multiplicativity of the one-shot simulation cost and the additivity of the asymptotic simulation cost of non-commutative bipartite graphs, which include all known cases such as extremal graphs and classical-quantum graphs. Applying this condition, we exhibit a large class of so-called \emph{cheapest-full-rank graphs} whose asymptotic zero-error simulation cost is given by the one-shot simulation cost. Finally, we disprove the multiplicativity of one-shot simulation cost by explicitly constructing a special class of qubit-qutrit non-commutative bipartite graphs.

5 pages, 2 figures, small typos corrected

References in corpus (13)

• Quantum correlations with no causal order
• Quantum Reverse Shannon Theorem
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Improving zero-error classical communication with entanglement
• Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
• Tema Con Variazioni: Quantum Channel Capacity
• On quantum non-signalling boxes
• Zero-error channel capacity and simulation assisted by non-local correlations
• No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
• Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
• Entanglement between Two Uses of a Noisy Multipartite Quantum Channel Enables Perfect Transmission of Classical Information
• On zero-error communication via quantum channels in the presence of noiseless feedback

Cited by in corpus (2)

• Quantum Channel Simulation and the Channel's Smooth Max-Information
• The Communication Value of a Quantum Channel