Strong converse to the quantum channel coding theorem
From MaRDI portal
Abstract: A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity.
Recommendations
Cited in
(35)- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- An upper bound on the success probability of minimum-error discrimination
- Quantum reverse hypercontractivity: its tensorization and application to strong converses
- Strong converse theorems for multimessage networks with tight cut-set bound
- Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Strong converse for the classical capacity of the pure-loss bosonic channel
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Moderate deviation analysis for classical communication over quantum channels
- Strong converse exponent for classical-quantum channel coding
- Strong converse theorems using Rényi entropies
- A coding problem via quantum channels
- Strong converse for the quantum capacity of the erasure channel for almost all codes
- A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
- Achieving the Holevo bound via a bisection decoding protocol
- A Strong Converse Theorem for Quantum Multiple Access Channels
- A Random Coding Based Proof for the Quantum Coding Theorem
- Quantum Coding Theorem from Privacy and Distinguishability
- Erratum: ``Minimum-error quantum distinguishability bounds from matrix monotone functions: a comment on `Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds'\,
- Coding theorem and strong converse for quantum channels
- Strong converse for identification via quantum channels
- Rényi relative entropies of quantum Gaussian states
- A low-rate bound on the reliability of a quantum discrete memoryless channel
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
- Selfcomplementary quantum channels
- “Pretty Strong” Converse for the Quantum Capacity of Degradable Channels
- A Strong Converse Theorem for Quantum Multiple Access Channels
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)
- Error exponents for quantum channels with constrained inputs
- Alexander S. Holevo's researches in quantum information theory in 20th century
- On the distinguishability of geometrically uniform quantum states
- An additive refinement of quantum channel capacities
- Zero-entropy encoders and simultaneous decoders in identification via quantum channels
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
This page was built for publication: Strong converse to the quantum channel coding theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503437)
