Achieving the Holevo bound via a bisection decoding protocol

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.

Updated version: added statement of the main theorem; 35 pages and 2 figures

References in corpus (4)

• Coding Theorem and Strong Converse for Quantum Channels
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• Quantum channels and their entropic characteristics
• Sequential projective measurements for channel decoding

Cited by in corpus (11)

• Multi-Phase Hadamard receivers for classical communication on lossy bosonic channels
• Real-time calibration of coherent-state receivers: learning by trial and error
• Optimal quantum state discrimination via nested binary measurements
• Squeezing-enhanced communication without a phase reference
• The capacity of coherent-state adaptive decoders with interferometry and single-mode detectors
• Optimal realistic attacks in continuous-variable quantum key distribution
• Beating the Classical Limits of Information Transmission using a Quantum Decoder
• Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements
• Performance of Coherent Frequency-Shift Keying for Classical Communication \\ on Quantum Channels
• Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels
• A learning theory for quantum photonic processors and beyond