Coding Theorem and Strong Converse for Quantum Channels
arXiv:1409.2536 · doi:10.1109/18.796385
Abstract
In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a by-product of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.
5+1 pp, IEEEtran. Posted now, after 15 years, in view of the recent interest in strong converses. Related work by Ogawa & Nagaoka (quant-ph/9808063), and significant subsequent progress in quant-ph/0012127, quant-ph/0206186, arXiv:0903.2838, arXiv:0912.5537, arXiv:1106.3089, arXiv:1108.5327, arXiv:1205.1712, arXiv:1208.1478, arXiv:1301.4927, arXiv:1306.1586, arXiv:1310.7028, arXiv:1401.4161, arXiv:1402.5940, arXiv:1404.5940, arXiv:1405.1797, arXiv:1406.2946, arXiv:1408.3373, arXiv:1408.5328
Cited by in corpus (29)
- Distillation of secret key and entanglement from quantum states
- On the quantum, classical and total amount of correlations in a quantum state
- The mother of all protocols: Restructuring quantum information's family tree
- Quantum channels and their entropic characteristics
- Entanglement of assistance and multipartite state distillation
- Remote preparation of quantum states
- On the strong converses for the quantum channel capacity theorems
- Fundamental bound on the reliability of quantum information transmission
- Smooth Renyi Entropies and the Quantum Information Spectrum
- The information-theoretic costs of simulating quantum measurements
- Coding Theorem for a Class of Quantum Channels with Long-Term Memory
- Sequential projective measurements for channel decoding
- Universal quantum data compression via gentle tomography
- On Quantum Capacity of Compound Channels
- Optimal superdense coding of entangled states
- Simultaneous classical-quantum capacities of quantum multiple access channels
- Classical Capacities of Averaged and Compound Quantum Channels
- Public and private communication with a quantum channel and a secret key
- Classical command of quantum systems via rigidity of CHSH games
- Multiparty quantum protocols for assisted entanglement distillation
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory
- Universal coding for transmission of private information
- Probabilistic metrology defeats ultimate deterministic bound
- A strong converse for the quantum state merging protocol
- Channel simulation with quantum side information
- Max- Relative Entropy of Entanglement, alias Log Robustness
- Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels
- Communicating over adversarial quantum channels using quantum list codes