Classical Capacity of Quantum Binary Adder Channels
  We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the general theory of quantum multiple access channels, and we may apply the established formulas for the capacity region to it. However, the binary adder channel is of particular interest classically, which motivates our generalizing it to the quantum domain. It turns out to be a very nice case study not only of multi-user quantum information theory, but also on the role entanglement plays there. It turns out that the analogous classical situation, the multi-user channel supported by shared randomness, is not distinct from the channel without shared randomness, as far as rates are concerned. However, we discuss the effect the new resource has on error probabilities, in an appendix.   We focus specially on the effect entanglement between the senders as well as between senders and receiver has on the capacity region. Interestingly, in some of these cases one can devise rather simple codes meeting the capacity bounds, even in a zero-error model, which is in marked difference to code construction in the classical case. 
Gleb V. Klimovitch, Andreas Winter