Work

Finite Blocklength Converse Bounds for Quantum Channels

Year: 2014

Type: article

Abstract: 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 Verdú 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.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2014.2353614

Authors: William Matthews, Stephanie Wehner

Institutions: University of Waterloo, University of Cambridge, Centre for Quantum Technologies, National University of Singapore

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Research Foundation Singapore, Ministry of Education - Singapore, Isaac Newton Trust

OpenAlex ID: W1989338245

FWCI: 9.243

Cites: 34

Cited by: 106

Related to: 10