Semidefinite programming strong converse bounds for classical capacity

Preprint English OPEN
Wang, Xin ; Xie, Wei ; Duan, Runyao (2016)

We investigate the classical communication over quantum channels when assisted by no-signaling (NS) and positive-partial-transpose-preserving (PPT) codes, for which both the optimal success probability of a given transmission rate and the one-shot $\epsilon$-error capacity are formalized as semidefinite programs (SDPs). Based on this, we obtain improved SDP finite blocklength converse bounds of general quantum channels for entanglement-assisted codes and unassisted codes. Furthermore, we derive two SDP strong converse bounds for the classical capacity of general quantum channels: for any code with a rate exceeding either of the two bounds of the channel, the success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bounds, we derive an improved upper bound on the classical capacity of the amplitude damping channel. We also establish the strong converse property for the classical and private capacities of a new class of quantum channels. We finally study the zero-error setting and provide efficiently computable upper bounds on the one-shot zero-error capacity of a general quantum channel.
  • References (73)
    73 references, page 1 of 8

    [1] A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Problemy Peredachi Informatsii (Problems of Information Transmission), vol. 9, no. 3, pp. 3-11, 1973.

    [2] --, “The capacity of the quantum channel with general signal states,” IEEE Transactions on Information Theory, vol. 44, no. 1, pp. 269-273, 1998.

    [3] B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,” Physical Review A, vol. 56, no. 1, p. 131, 1997.

    [4] C. King, “The capacity of the quantum depolarizing channel,” IEEE Transactions on Information Theory, vol. 49, no. 1, pp. 221-229, 2003.

    [5] C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capacities of quantum erasure channels,” Physical Review Letters, vol. 78, no. 16, p. 3217, 1997.

    [6] C. King, “Additivity for unital qubit channels,” Journal of Mathematical Physics, vol. 43, no. 10, pp. 4641-4653, 2002.

    [7] G. G. Amosov, A. S. Holevo, and R. F. Werner, “On Some Additivity Problems in Quantum Information Theory,” Problemy Peredachi Informatsii, vol. 36, no. 4, pp. 25-34, 2000.

    [8] N. Datta, A. S. Holevo, and Y. Suhov, “Additivity for transpose depolarizing channels,” International Journal of Quantum Information, vol. 4, no. 01, pp. 85-98, 2006.

    [9] M. Fukuda, “Extending additivity from symmetric to asymmetric channels,” Journal of Physics A: Mathematical and General, vol. 38, no. 45, p. L753, 2005.

    [10] R. Konig, S. Wehner, and J. Wullschleger, “Unconditional security from noisy quantum storage,” IEEE Transactions on Information Theory, vol. 58, no. 3, pp. 1962-1984, 2012.

  • Metrics
    No metrics available
Share - Bookmark