Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication

DOI10.1007/S11128-012-0410-YMaRDI QIDQ1937286zbMATH OpenOpenAlexFDO

Authors Shen Chen Xu, Mark M. Wilde

Publication date 28 February 2013

Published in Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

quantum information theoryentanglement-assisted communicationBosonic channelquantum multiple access channelquantum simultaneous decoding

Mathematics Subject Classification ID

Communication theory (94A05) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Bennett et al. showed that allowing shared entanglement between a sender and receiver before communication begins dramatically simplifies the theory of quantum channels, and these results suggest that it would be worthwhile to study other scenarios for entanglement-assisted classical communication. In this vein, the present paper makes several contributions to the theory of entanglement-assisted classical communication. First, we rephrase the Giovannetti-Lloyd-Maccone sequential decoding argument as a more general "packing lemma" and show that it gives an alternate way of achieving the entanglement-assisted classical capacity. Next, we show that a similar sequential decoder can achieve the Hsieh-Devetak-Winter region for entanglement-assisted classical communication over a multiple access channel. Third, we prove the existence of a quantum simultaneous decoder for entanglement-assisted classical communication over a multiple access channel with two senders. This result implies a solution of the quantum simultaneous decoding conjecture for unassisted classical communication over quantum multiple access channels with two senders, but the three-sender case still remains open (Sen recently and independently solved this unassisted two-sender case with a different technique). We then leverage this result to recover the known regions for unassisted and assisted quantum communication over a quantum multiple access channel, though our proof exploits a coherent quantum simultaneous decoder. Finally, we determine an achievable rate region for communication over an entanglement-assisted bosonic multiple access channel and compare it with the Yen-Shapiro outer bound for unassisted communication over the same channel.

Recommendations

• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Applications of position-based coding to classical communication over quantum channels
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Sequential decoding of a general classical-quantum channel
• On entanglement-assisted classical capacity

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5320291 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 5223157 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Resource Framework for Quantum Shannon Theory
• A new achievable rate region for the interference channel
• Assisted entanglement distillation
• Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
• 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
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Entanglement-Assisted Communication of Classical and Quantum Information
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• General formulas for capacity of classical-quantum channels
• Information theory. Coding theorems for discrete memoryless systems
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• On entanglement-assisted classical capacity
• Quantum Feedback Channels
• Smooth Entropies and the Quantum Information Spectrum
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The capacity of the quantum multiple-access channel
• Trading classical communication, quantum communication, and entanglement in quantum Shannon theory

Cited in

(4)

• Entanglement-assisted private communication over quantum broadcast channels
• Applications of position-based coding to classical communication over quantum channels
• Sequential decoding of a general classical-quantum channel
• On the near-optimality of one-shot classical communication over quantum channels

This page was built for publication: Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication

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