Achieving the Holevo bound via a bisection decoding protocol

TL;DR

This paper introduces a novel quantum decoding protocol that achieves the Holevo bound by using a bisection method with yes-no measurements, enabling efficient identification of transmitted messages at optimal capacity.

Contribution

It proposes a new bisection decoding scheme that attains the Holevo bound, improving upon previous methods by recovering messages bit by bit with a logarithmic number of steps.

Findings

Achieves the Holevo bound for quantum communication.

Uses a series of yes-no measurements organized in a bisection manner.

Determines codewords in log(N) steps, where N is the number of codewords.

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 "yes-no" measurements, organized in bisection fashion, thus determining which codeword was sent in log(N) steps, N being the number of codewords.