Classical communication over a quantum interference channel
arXiv:1102.2624 · doi:10.1109/TIT.2012.2188620
Abstract
Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity of such channels is known exactly in the settings of "very strong" and "strong" interference, while the Han-Kobayashi coding strategy gives the best known achievable rate region in the general case. Here, we introduce and study the quantum interference channel, a natural generalization of the interference channel to the setting of quantum information theory. We restrict ourselves for the most part to channels with two classical inputs and two quantum outputs in order to simplify the presentation of our results (though generalizations of our results to channels with quantum inputs are straightforward). We are able to determine the exact classical capacity of this channel in the settings of "very strong" and "strong" interference, by exploiting Winter's successive decoding strategy and a novel two-sender quantum simultaneous decoder, respectively. We provide a proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a three-sender quantum simultaneous decoder. This conjecture holds for a special class of quantum multiple access channels with average output states that commute, and we discuss some other variations of the conjecture that hold. Finally, we detail a connection between the quantum interference channel and prior work on the capacity of bipartite unitary gates.
21 pages, 6 figures, v5: Accepted for publication in the IEEE Transactions on Information Theory
References in corpus (6)
- Quantum information can be negative
- Coding Theorem and Strong Converse for Quantum Channels
- The mother of all protocols: Restructuring quantum information's family tree
- A Generalization of Quantum Stein's Lemma
- The quantum capacity with symmetric side channels
- Generalized relative entropies and the capacity of classical-quantum channels
Cited by in corpus (14)
- Universal Limitations on Quantum Key Distribution over a Network
- Fundamental limits on the capacities of bipartite quantum interactions
- Applications of position-based coding to classical communication over quantum channels
- Classical codes for quantum broadcast channels
- Fundamental limitations to information transfer in accelerated frames
- Polar codes in network quantum information theory
- On simultaneous min-entropy smoothing
- On the near-optimality of one-shot classical communication over quantum channels
- Bounding the forward classical capacity of bipartite quantum channels
- A Quantum Multiparty Packing Lemma and the Relay Channel
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
- Optimized protocols for duplex quantum transduction
- Joint source-channel coding for a quantum multiple access channel
- Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations