On the near-optimality of one-shot classical communication over quantum channels

DOI10.1063/1.5039796zbMath1406.81014arXiv1804.09644OpenAlexW3098297172WikidataQ128494832 ScholiaQ128494832MaRDI QIDQ4621255

Rahul Jain, Naqueeb A. Warsi, Anurag Anshu

Publication date: 11 February 2019

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Network design and communication in computer systems (68M10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Channel models (including quantum) in information and communication theory (94A40) Quantum coherence, entanglement, quantum correlations (81P40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On the second-order asymptotics for entanglement-assisted communication
• Completely positive maps and entropy inequalities
• The transition probability in the state space of a \(^*\)-algebra
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Conditional expectation in an operator algebra
• Classical Codes for Quantum Broadcast Channels
• Finite Blocklength Converse Bounds for Quantum Channels
• One-Shot Entanglement-Assisted Quantum and Classical Communication
• Applications of position-based coding to classical communication over quantum channels
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• General formulas for capacity of classical-quantum channels
• On communication over an entanglement-assisted quantum channel
• Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• A coding theorem for the discrete memoryless broadcast channel
• The capacity of the quantum channel with general signal states
• Fidelity for Mixed Quantum States
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Coding theorem and strong converse for quantum channels
• The capacity of the quantum multiple-access channel
• The Theory of Quantum Information
• Building Blocks for Communication Over Noisy Quantum Networks
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• The Quantum Capacity of Channels With Arbitrarily Correlated Noise
• Union bound for quantum information processing
• Classical Communication Over a Quantum Interference Channel
• Quantum Broadcast Channels
• A Father Protocol for Quantum Broadcast Channels
• Sequential decoding of a general classical-quantum channel
• Quantum Information Theory

This page was built for publication: On the near-optimality of one-shot classical communication over quantum channels