Game-theoretic characterization of antidegradable channels
From MaRDI portal
Publication:2924888
DOI10.1063/1.4895918zbMath1297.81042arXiv1404.0277OpenAlexW2053796149MaRDI QIDQ2924888
Nilanjana Datta, Francesco Buscemi, Sergii Strelchuk
Publication date: 20 October 2014
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.0277
(n)-person games, (n>2) (91A06) Cryptography (94A60) Channel models (including quantum) in information and communication theory (94A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (5)
Social optimality in quantum Bayesian games ⋮ Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation ⋮ Incompatibility of quantum channels ⋮ The Pitfalls of Deciding Whether a Quantum Channel is (Conjugate) Degradable and How to Avoid Them ⋮ Quantum majorization on semi-finite von Neumann algebras
Cites Work
- Comparison of quantum statistical models: Equivalent conditions for sufficiency
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Public Quantum Communication and Superactivation
- Quantum Communication with Zero-Capacity Channels
- Comparison of information structures and completely positive maps
- Complementary Channels and the Additivity Problem
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- The Quantum Capacity With Symmetric Side Channels
- A single quantum cannot be cloned
- The structure of degradable quantum channels
- Positive Linear Maps on C*-Algebras
- Positive Functions on C ∗ -Algebras
This page was built for publication: Game-theoretic characterization of antidegradable channels