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

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 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.

[1]  Runyao Duan,et al.  Activated zero-error classical capacity of quantum channels in the presence of quantum no-signalling correlations , 2015, ArXiv.

[2]  Jianxin Chen,et al.  Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel , 2009, IEEE Transactions on Information Theory.

[3]  Ashish V. Thapliyal,et al.  Entanglement-Assisted Classical Capacity of Noisy Quantum Channels , 1999, Physical Review Letters.

[4]  J. Preskill,et al.  Causal and localizable quantum operations , 2001, quant-ph/0102043.

[5]  Yasuhiro Abe,et al.  Holonomies of gauge fields in twistor space 2: Hecke algebra, diffeomorphism, and graviton amplitudes , 2009, 0906.2526.

[6]  Debbie W. Leung,et al.  Improving zero-error classical communication with entanglement , 2009, Physical review letters.

[7]  R. Renner,et al.  The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory , 2009, 0912.3805.

[8]  R. Werner,et al.  Tema con variazioni: quantum channel capacity , 2003, quant-ph/0311037.

[9]  Simone Severini,et al.  Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number , 2010, IEEE Transactions on Information Theory.

[10]  Michael J. Todd,et al.  Polynomial Algorithms for Linear Programming , 1988 .

[11]  Runyao Duan,et al.  Super-Activation of Zero-Error Capacity of Noisy Quantum Channels , 2009, 0906.2527.

[12]  Graeme Smith,et al.  An Extreme Form of Superactivation for Quantum Zero-Error Capacities , 2009, IEEE Transactions on Information Theory.

[13]  Peter W. Shor,et al.  Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.

[14]  Andreas J. Winter,et al.  The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels , 2009, IEEE Transactions on Information Theory.

[15]  Č. Brukner,et al.  Quantum correlations with no causal order , 2011, Nature Communications.

[16]  Debbie W. Leung,et al.  Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations , 2010, IEEE Transactions on Information Theory.

[17]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[18]  Runyao Duan,et al.  No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number , 2014, IEEE Transactions on Information Theory.

[19]  E. D. Klerk,et al.  Aspects of semidefinite programming : interior point algorithms and selected applications , 2002 .

[20]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[21]  Runyao Duan,et al.  Entanglement between two uses of a noisy multipartite quantum channel enables perfect transmission of classical information. , 2008, Physical review letters.

[22]  Simone Severini,et al.  On Zero-Error Communication via Quantum Channels in the Presence of Noiseless Feedback , 2015, IEEE Transactions on Information Theory.

[23]  Dong Yang,et al.  Potential Capacities of Quantum Channels , 2015, IEEE Transactions on Information Theory.

[24]  M. Horodecki,et al.  Properties of quantum nonsignaling boxes , 2006 .

[25]  R. Werner,et al.  Semicausal operations are semilocalizable , 2001, quant-ph/0104027.

[26]  D. Leung,et al.  Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels , 2010, Communications in Mathematical Physics.

[27]  Anton van den Hengel,et al.  Semidefinite Programming , 2014, Computer Vision, A Reference Guide.

[28]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .