Strong converse to the quantum channel coding theorem

Authors:
T. Ogawa;H. Nagaoka
Affiliations:
Graduate Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu;-
Venue:
IEEE Transactions on Information Theory
Year:
1999

Citing 0
Cited 7

Classical capacities of compound and averaged quantum channels

IEEE Transactions on Information Theory
Quantum and classical message protect identification via quantum channels

Quantum Information & Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity

Quantum Information & Computation
A strong converse theorem for quantum multiple access channels

General Theory of Information Transfer and Combinatorics
Identification via quantum channels in the presence of prior correlation and feedback

General Theory of Information Transfer and Combinatorics
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization

Journal of the ACM (JACM)
Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

A lower bound on the probability of decoding error for a quantum communication channel is presented, from which the strong converse to the quantum channel coding theorem is immediately shown. The results and their derivations are mostly straightforward extensions of the classical counterparts which were established by Arimoto (1973), except that more careful treatment is necessary here due to the noncommutativity of operators