129 research outputs found
Classical codes for quantum broadcast channels
We present two approaches for transmitting classical information over quantum
broadcast channels. The first technique is a quantum generalization of the
superposition coding scheme for the classical broadcast channel. We use a
quantum simultaneous nonunique decoder and obtain a proof of the rate region
stated in [Yard et al., IEEE Trans. Inf. Theory 57 (10), 2011]. Our second
result is a quantum generalization of the Marton coding scheme. The error
analysis for the quantum Marton region makes use of ideas in our earlier work
and an idea recently presented by Radhakrishnan et al. in arXiv:1410.3248. Both
results exploit recent advances in quantum simultaneous decoding developed in
the context of quantum interference channels.Comment: v4: 20 pages, final version to appear in IEEE Transactions on
Information Theor
Classical codes for quantum broadcast channels
We discuss two techniques for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum simultaneous nonunique decoder and obtain a simpler proof of the rate region recently published by Yard et al. in independent work. Our second result is a quantum Marton coding scheme, which gives the best known achievable rate region for quantum broadcast channels. Both results exploit recent advances in quantum simultaneous decoding developed in the context of quantum interference channels. © 2012 IEEE
Applications of position-based coding to classical communication over quantum channels
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 Renyi-2 entropies and
conditional quantum entropies.Comment: 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.0964
- …