Sequential decoding of a general classical-quantum channel
From MaRDI portal
Publication:5362173
DOI10.1098/rspa.2013.0259zbMath1371.81069arXiv1303.0808OpenAlexW3106453919WikidataQ59832624 ScholiaQ59832624MaRDI QIDQ5362173
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
Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)
Related Items (9)
Achieving the Holevo bound via a bisection decoding protocol ⋮ An effective iterative method to build the Naimark extension of rank-n POVMs ⋮ Shadow Tomography of Quantum States ⋮ On the near-optimality of one-shot classical communication over quantum channels ⋮ POVM-induced coherence measure in terms of fidelity ⋮ Classical capacities of memoryless but not identical quantum channels ⋮ Union bound for quantum information processing ⋮ Online learning of quantum states ⋮ Emergence of maximal hidden quantum correlations and its trade-off with the filtering probability in dissipative two-qubit systems
This page was built for publication: Sequential decoding of a general classical-quantum channel
