arXiv Analytics

Sign in

arXiv:1205.1712 [quant-ph]AbstractReferencesReviewsResources

On the strong converses for the quantum channel capacity theorems

Naresh Sharma, Naqueeb Ahmad Warsi

Published 2012-05-08, updated 2012-06-20Version 3

A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds on the fidelity measures reminiscent of the Wolfowitz strong converse for the classical channel capacity theorems. We provide a new proof for the error exponents for the classical information transfer. A long standing problem in quantum information theory has been to find out the strong converse for the channel capacity theorem when quantum information is sent across the channel. We give the quantum error exponent thereby giving a one-shot exponential upper bound on the fidelity. We then apply our results to show that the strong converse holds for the quantum information transfer across an erasure channel for maximally entangled channel inputs.

Comments: Added the strong converse for the erasure channel for maximally entangled inputs and corrected minor typos
Categories: quant-ph, cs.IT, math.IT
Related articles: Most relevant | Search more
arXiv:2407.11118 [quant-ph] (Published 2024-07-15)
Tight lower bound on the error exponent of classical-quantum channels
arXiv:2407.13728 [quant-ph] (Published 2024-07-18)
Barycentric bounds on the error exponents of quantum hypothesis exclusion
arXiv:1108.1240 [quant-ph] (Published 2011-08-05, updated 2011-10-07)
Quantum information transfer in degenerate Raman regime