Achieving the Holevo bound via a bisection decoding protocol
Open Access
- 1 June 2016
- journal article
- conference paper
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 57 (6) , 062204
Abstract
We present a new decoding protocol to realize transmission of classical information through a quantum channel at asymptotically maximum capacity, achieving the Holevo bound and thus the optimal communication rate. At variance with previous proposals, our scheme recovers the message bit by bit, making use of a series of “yes-no” measurements, organized in bisection fashion, thus determining which codeword was sent in log2 N steps, N being the number of codewords.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Quantum channels and their entropic characteristicsReports on Progress in Physics, 2012
- Superadditivity of communication capacity using entangled inputsNature Physics, 2009
- Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel codingPhysical Review A, 2007
- Quantum information with continuous variablesReviews of Modern Physics, 2005
- Classical Capacity of the Lossy Bosonic Channel: The Exact SolutionPhysical Review Letters, 2004
- General formulas for capacity of classical-quantum channelsIEEE Transactions on Information Theory, 2003
- Coding theorem and strong converse for quantum channelsIEEE Transactions on Information Theory, 1999
- Strong converse to the quantum channel coding theoremIEEE Transactions on Information Theory, 1999
- The capacity of the quantum channel with general signal statesIEEE Transactions on Information Theory, 1998
- The proper formula for relative entropy and its asymptotics in quantum probabilityCommunications in Mathematical Physics, 1991