Strong converse for identification via quantum channels

被引:249
作者
Ahlswede, R
Winter, A
机构
[1] Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany
[2] Univ Bristol, Dept Comp Sci, Bristol BS8 1UB, Avon, England
关键词
covering hypergraphs; identification; large deviations; quantum channels;
D O I
10.1109/18.985947
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, 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 recently discovered 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.
引用
收藏
页码:569 / 579
页数:11
相关论文
共 28 条
[21]   Strong converse to the quantum channel coding theorem [J].
Ogawa, T ;
Nagaoka, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) :2486-2489
[22]   QUANTUM CODING [J].
SCHUMACHER, B .
PHYSICAL REVIEW A, 1995, 51 (04) :2738-2747
[23]   A MATHEMATICAL THEORY OF COMMUNICATION [J].
SHANNON, CE .
BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423
[24]   INEQUALITY WITH APPLICATIONS IN STATISTICAL MECHANICS [J].
THOMPSON, CJ .
JOURNAL OF MATHEMATICAL PHYSICS, 1965, 6 (11) :1812-+
[25]   Compression of quantum-measurement operations [J].
Winter, A ;
Massar, S .
PHYSICAL REVIEW A, 2001, 64 (01) :123111-1231112
[27]  
WINTER A, 2001, QUANTPH0109050 EPRIN
[28]  
Wolfowitz J., 1957, ILLINOIS J MATH, V1, P591