Strong converse for identification via quantum channels

Author

Ahlswede, Rudolf ; Winter, Andreas

Author_Institution

Fak. fur Math., Bielefeld Univ., Germany

Volume

48

Issue

3

fYear

2002

fDate

3/1/2002 12:00:00 AM

Firstpage

569

Lastpage

579

Abstract

We present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede´s (1979, 1992) approach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems

Keywords

graph theory; identification; memoryless systems; quantum communication; random processes; telecommunication channels; Hilbert space; classical channels; covering lemma; discrete memoryless quantum channels; explicit large deviation estimates; hypergraph covering problems; quantum channels identification; quantum communication channels; random variables; self-adjoint operators; strong converse; Channel capacity; Communication channels; Computer science; Hilbert space; Information theory; Memoryless systems; Mutual information; Quantum mechanics; Random variables; Statistics;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.985947

Filename

985947