Achieving the Holevo bound via a bisection decoding protocol

DOI10.1063/1.4953690MaRDI QIDQ3178312zbMATH OpenOpenAlexWikidataFDO

Authors Matteo Rosati, V. Giovannetti

Publication date 11 July 2016

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.04999

zbMATH Keywords

POVMquantum channelquantum information theoryHolevo bounddecoding protocolShannon capacity formula

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Channel models (including quantum) in information and communication theory (94A40)

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.

Recommendations

• Towards efficient decoding of classical-quantum polar codes
• A Decoupling Approach to the Quantum Capacity
• Decoding quantum information via the Petz recovery map
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Sequential decoding of a general classical-quantum channel

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• A ‘Pretty Good’ Measurement for Distinguishing Quantum States
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Coding theorem and strong converse for quantum channels
• General formulas for capacity of classical-quantum channels
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Polar Codes for Classical-Quantum Channels
• Polar Codes for Private and Quantum Communication Over Arbitrary Channels
• Quantum information theory
• Quantum information with continuous variables
• Quantum systems, channels, information. A mathematical introduction.
• Sequential decoding of a general classical-quantum channel
• Strong converse and Stein's lemma in quantum hypothesis testing
• Strong converse to the quantum channel coding theorem
• The capacity of the quantum channel with general signal states
• Universal coding for classical-quantum channel

Cited in

(2)

• Detection of polarization shift-keyed/switched/multiplexed quantum coherent states in M-ary photonic communication systems
• Towards efficient decoding of classical-quantum polar codes

This page was built for publication: Achieving the Holevo bound via a bisection decoding protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178312)