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

DOI10.1063/1.5039796MaRDI QIDQ4621255zbMATHOpenAlexWikidataFDO

Authors Anurag Anshu, Rahul Jain, Naqueeb A. Warsi

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) Coding theorems (Shannon theory) (94A24) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Network design and communication in computer systems (68M10) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, quantum multiple-access channel, quantum channel with state and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior work [Anshu, Jain and Warsi, 2017]. In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence (obtained earlier in [Matthews and Wehner, 2014]). Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.

Recommendations

• Applications of position-based coding to classical communication over quantum channels
• Position-based coding and convex splitting for private communication over quantum channels
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• TWO-WAY QUANTUM COMMUNICATION CHANNELS
• Sequential decoding of a general classical-quantum channel

Cites work

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

Cited in

(6)

• One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
• The Power of One Clean Qubit in Communication Complexity
• scientific article; zbMATH DE number 5953454 (Why is no real title available?)
• Analytical Optimization of Local Quantum Operation and Classical Communication
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
• Position-based coding and convex splitting for private communication over quantum channels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621255)