Achieving the Holevo bound via a bisection decoding protocol

DOI10.1063/1.4953690zbMATH Open1345.81023arXiv1506.04999OpenAlexW625057664WikidataQ62598253 ScholiaQ62598253MaRDI QIDQ3178312FDOQ3178312

Matteo Rosati, V. Giovannetti

Publication date: 11 July 2016

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The capacity of the quantum channel with general signal states
• Quantum information with continuous variables
• Quantum systems, channels, information. A mathematical introduction.
• Quantum information theory
• General formulas for capacity of classical-quantum channels
• Strong converse and Stein's lemma in quantum hypothesis testing
• 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
• Strong converse to the quantum channel coding theorem
• Polar Codes for Classical-Quantum Channels
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Universal coding for classical-quantum channel
• Polar Codes for Private and Quantum Communication Over Arbitrary Channels
• Sequential decoding of a general classical-quantum channel

Cited In (1)

• Detection of polarization shift-keyed/switched/multiplexed quantum coherent states in M-ary photonic communication systems

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)