Semidefinite Programming Converse Bounds for Quantum Communication

DOI10.1109/TIT.2018.2874031zbMATH Open1431.94105arXiv1709.00200MaRDI QIDQ5223952FDOQ5223952

Authors: Xin Wang, Kun Fang, Runyao Duan 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of quantum information that can be transmitted over a single use of a quantum channel, which improve the previous bound from [Tomamichel/Berta/Renes, Nat. Commun. 7, 2016]. As applications, we study quantum communication over depolarizing channels and amplitude damping channels with finite resources. Second, we find an SDP strong converse bound for the quantum capacity of an arbitrary quantum channel, which means the fidelity of any sequence of codes with a rate exceeding this bound will vanish exponentially fast as the number of channel uses increases. Furthermore, we prove that the SDP strong converse bound improves the partial transposition bound introduced by Holevo and Werner. Third, we prove that this SDP strong converse bound is equal to the so-called max-Rains information, which is an analog to the Rains information introduced in [Tomamichel/Wilde/Winter, IEEE Trans. Inf. Theory 63:715, 2017]. Our SDP strong converse bound is weaker than the Rains information, but it is efficiently computable for general quantum channels.

Full work available at URL: https://arxiv.org/abs/1709.00200

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Semidefinite programming (90C22) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

Cited In (6)

• Geometric Rényi divergence and its applications in quantum channel capacities
• Amortized channel divergence for asymptotic quantum channel discrimination
• Sensitivity, affine transforms and quantum communication complexity
• Computable lower bounds on the entanglement cost of quantum channels
• Semidefinite programming hierarchies for constrained bilinear optimization
• On convex optimization problems in quantum information theory

This page was built for publication: Semidefinite Programming Converse Bounds for Quantum Communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223952)