Achieving the Holevo bound via sequential measurements

Abstract

We present a new decoding procedure to transmit classical information in a quantum channel which, saturating asymptotically the Holevo bound, achieves the optimal rate of the communication line. Differently from previous proposals, it is based on performing a sequence of (projective) YES/NO measurements which in N steps determines which codeword was sent by the sender (N being the number of the codewords). Our analysis shows that as long as N is below the limit imposed by the Holevo bound the error probability can be sent to zero asymptotically in the length of the codewords.

10 pages, 1 figure

References in corpus (7)

• Coding Theorem and Strong Converse for Quantum Channels
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• Multiparty data hiding of quantum information
• On the distinguishability of random quantum states
• Sequential projective measurements for channel decoding
• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem

Cited by in corpus (22)

• Quantum channels and memory effects
• Polar codes for classical-quantum channels
• The information-theoretic costs of simulating quantum measurements
• Quantum union bounds for sequential projective measurements
• Applications of position-based coding to classical communication over quantum channels
• Classical codes for quantum broadcast channels
• Sequential decoding of a general classical-quantum channel
• Multi-Phase Hadamard receivers for classical communication on lossy bosonic channels
• Testing sequential quantum measurements: how can maximal knowledge be extracted?
• Universality of Sequential Quantum Measurements
• Achieving the Holevo bound via a bisection decoding protocol
• The capacity of coherent-state adaptive decoders with interferometry and single-mode detectors
• Union bound for quantum information processing
• On the near-optimality of one-shot classical communication over quantum channels
• Optimal realistic attacks in continuous-variable quantum key distribution
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Second-order coding rates for pure-loss bosonic channels
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements
• Generalized Holevo theorem and distinguishability notions
• Conditional Pulse Nulling Receiver for Multi-pulse PPM and Binary Quantum Coding Signals
• Optimal Encoding Capacity of a Linear Optical Quantum Channel