Elements of information theory
Elements of information theory
Quantum computation and quantum information
Quantum computation and quantum information
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
Entanglement-assisted communication of classical and quantum information
IEEE Transactions on Information Theory
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
IEEE Transactions on Information Theory
Network Information Theory
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
The capacity of the quantum multiple-access channel
IEEE Transactions on Information Theory
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
IEEE Transactions on Information Theory
A new achievable rate region for the interference channel
IEEE Transactions on Information Theory
General formulas for capacity of classical-quantum channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
IEEE Transactions on Information Theory
Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Resource Framework for Quantum Shannon Theory
IEEE Transactions on Information Theory
Multiparty quantum protocols for assisted entanglement distillation
Multiparty quantum protocols for assisted entanglement distillation
| Hi-index | 0.00 |
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.