Limitation on the amount of accessible information in a quantum channel

被引:59
作者
Schumacher, B
Westmoreland, M
Wootters, WK
机构
[1] LOS ALAMOS NATL LAB, LOS ALAMOS, NM 87545 USA
[2] DENISON UNIV, DEPT MATH, GRANVILLE, OH 43023 USA
[3] WILLIAMS COLL, DEPT PHYS, WILLIAMSTOWN, MA 01267 USA
关键词
D O I
10.1103/PhysRevLett.76.3452
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We prove a new result limiting the amount of accessible information in a quantum channel. This generalizes Kholevo's theorem and implies it as a simple corollary. Our proof uses the strong subadditivity of the von Neumann entropy functional S(rho) and a specific physical analysis of the measurement process. The result presented here has application in information obtained from ''weak'' measurements, such as those sometimes considered in quantum cryptography.
引用
收藏
页码:3452 / 3455
页数:4
相关论文
共 10 条
[1]  
Bennett C H., 1984, P IEEE INT C COMPUTE, P175, DOI DOI 10.1016/J.TCS.2014.05.025
[2]   EAVESDROPPING ON QUANTUM-CRYPTOGRAPHICAL SYSTEMS [J].
EKERT, AK ;
HUTTNER, B ;
PALMA, GM ;
PERES, A .
PHYSICAL REVIEW A, 1994, 50 (02) :1047-1056
[3]   ENSEMBLE-DEPENDENT BOUNDS FOR ACCESSIBLE INFORMATION IN QUANTUM-MECHANICS [J].
FUCHS, CA ;
CAVES, CM .
PHYSICAL REVIEW LETTERS, 1994, 73 (23) :3047-3050
[4]  
Helstrom C. W., 1976, QUANTUM DETECTION ES, P74
[5]  
Kholevo A. S., 1973, Problems of Information Transmission, V9, P177
[6]  
Levitin L.B., 1969, P 4 ALL UN C INF COD
[7]  
LIEB EH, 1973, J MATH PHYS, V14, P267
[8]  
SCHUMACHER B, 1990, COMPLEXITY ENTROPY P, P29
[9]   GENERAL PROPERTIES OF ENTROPY [J].
WEHRL, A .
REVIEWS OF MODERN PHYSICS, 1978, 50 (02) :221-260
[10]   ENVIRONMENT-INDUCED SUPER-SELECTION RULES [J].
ZUREK, WH .
PHYSICAL REVIEW D, 1982, 26 (08) :1862-1880