A semidefinite programming upper bound of quantum capacity

Recently the power of positive partial transpose preserving (PPTp) and no-signalling (NS) codes in quantum communication has been studied. We continue with this line of research and show that the NS/PPTp/NS∩PPTp codes assisted zero-error quantum capacity depends only on the non-commutative bipartite graph of the channel and the one-shot case can be computed efficiently by semidefinite programming (SDP). As an example, the activated PPTp codes assisted zero-error quantum capacity is carefully studied. We then present a general SDP upper bound QΓ of quantum capacity and show it is always smaller than or equal to the “Partial transposition bound” introduced by Holevo and Werner, and the inequality could be strict. This upper bound is found to be additive, and thus is an upper bound of the potential PPTp assisted quantum capacity as well. We further demonstrate that QΓ is strictly better than several previously known upper bounds for an explicit class of quantum channels. Finally, we show that QΓ can be used to bound the super-activation of quantum capacity.

[1]  Howard Barnum,et al.  On quantum fidelities and channel capacities , 2000, IEEE Trans. Inf. Theory.

[2]  Runyao Duan,et al.  A new property of the Lovász number and duality relations between graph parameters , 2015, Discret. Appl. Math..

[3]  Eric M. Rains.  A semidefinite program for distillable entanglement , 2001, IEEE Trans. Inf. Theory.

[4]  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.

[5]  William Matthews,et al.  On the Power of PPT-Preserving and Non-Signalling Codes , 2014, IEEE Transactions on Information Theory.

[6]  M. Junge,et al.  Capacity bounds via operator space methods , 2015, Journal of Mathematical Physics.

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

[8]  John Watrous,et al.  Simpler semidefinite programs for completely bounded norms , 2012, Chic. J. Theor. Comput. Sci..

[9]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[10]  Igor Devetak,et al.  Inequalities and separations among assisted capacities of quantum channels. , 2006, Physical review letters.

[11]  Graeme Smith,et al.  Additive extensions of a quantum channel , 2007, 2008 IEEE Information Theory Workshop.

[12]  D. Bruß,et al.  Optimal universal and state-dependent quantum cloning , 1997, quant-ph/9705038.

[13]  R. Werner,et al.  Evaluating capacities of bosonic Gaussian channels , 1999, quant-ph/9912067.

[14]  M. Nielsen,et al.  Information transmission through a noisy quantum channel , 1997, quant-ph/9702049.

[15]  Graeme Smith,et al.  Quantum Communication with Zero-Capacity Channels , 2008, Science.

[16]  David Elkouss,et al.  Unbounded number of channel uses may be required to detect quantum capacity , 2014, Nature Communications.

[17]  R. Duan,et al.  Activated zero-error classical communication over quantum channels assisted with quantum no-signalling correlations , 2015, 1510.05437.

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

[19]  Cerf,et al.  Pauli cloning of a quantum Bit , 2000, Physical review letters.

[20]  Volkher B. Scholz,et al.  Approximate degradable quantum channels , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).

[21]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

[22]  Mark M. Wilde,et al.  Strong Converse Rates for Quantum Communication , 2014, IEEE Transactions on Information Theory.

[23]  M. Wolf,et al.  Quantum capacities of channels with small environment , 2006, quant-ph/0607070.

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

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

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

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

[28]  Andreas J. Winter,et al.  The Quantum Capacity With Symmetric Side Channels , 2008, IEEE Transactions on Information Theory.

[29]  Igor Devetak.  The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

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

[31]  S. Lloyd.  Capacity of the noisy quantum channel , 1996, quant-ph/9604015.

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

[33]  Runyao Duan,et al.  Improved semidefinite programming upper bound on distillable entanglement , 2016, 1601.07940.