Sequential decoding of a general classical-quantum channel

DOI10.1098/RSPA.2013.0259MaRDI QIDQ5362173zbMATH OpenOpenAlexWikidataFDO

Authors Mark M. Wilde

Publication date 29 September 2017

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Abstract: Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential measurements to determine the message of the sender. We show here that this intuition is not true, by demonstrating that a sequential decoding strategy works well even in the most general "one-shot" regime, where we are given a single instance of a channel and wish to determine the maximal number of bits that can be communicated up to a small failure probability. This result follows by generalizing a non-commutative union bound to apply for a sequence of general measurements. We also demonstrate two ways in which a receiver can recover a state close to the original state after it has been decoded by a sequence of measurements that each succeed with high probability. The second of these methods will be useful in realizing an efficient decoder for fully quantum polar codes, should a method ever be found to realize an efficient decoder for classical-quantum polar codes.

Recommendations

• Towards efficient decoding of classical-quantum polar codes
• Union bound for quantum information processing
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Universal coding for classical-quantum channel
• Decoding quantum information via the Petz recovery map

Cited in

(14)

• Shadow tomography of quantum states
• Emergence of maximal hidden quantum correlations and its trade-off with the filtering probability in dissipative two-qubit systems
• POVM-induced coherence measure in terms of fidelity
• Union bound for quantum information processing
• Belief propagation decoding of quantum channels by passing quantum messages
• Online learning of quantum states
• Towards efficient decoding of classical-quantum polar codes
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• An effective iterative method to build the Naimark extension of rank-\(n\) POVMs
• Achieving the Holevo bound via a bisection decoding protocol
• Classical capacities of memoryless but not identical quantum channels
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Parsing a Sequence of Qubits
• On the near-optimality of one-shot classical communication over quantum channels

This page was built for publication: Sequential decoding of a general classical-quantum channel

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