期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 60, 期 11, 页码 7317-7329出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2014.2353614
关键词
Channel coding; quantum channels; block codes; finite blocklength; quantum entanglement
资金
- Natural Sciences and Engineering Research Council of Canada (Quantum Works)
- Isaac Newton Trust, Cambridge, U.K.
- National Research Foundation, Singapore
- Ministry of Education, Singapore
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalize both a classical converse of Polyanskiy, Poor, and Verdu as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular, our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels, its large blocklength limit is the well-known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin, and Thapliyal.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据