Applications of position-based coding to classical communication over quantum channels
Abstract
Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.
- Publication:
-
Journal of Physics A Mathematical General
- Pub Date:
- November 2018
- DOI:
- 10.1088/1751-8121/aae290
- arXiv:
- arXiv:1704.01361
- Bibcode:
- 2018JPhA...51R4002Q
- Keywords:
-
- Quantum Physics;
- Computer Science - Information Theory
- E-Print:
- v4: 44 pages, v4 includes a simpler proof for an upper bound on one-shot entanglement-assisted capacity, also found recently and independently in arXiv:1804.09644