Classical communication over a quantum interference channel
Authors:
Preprint
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 setting of "very strong" interference, and we provide a proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a simultaneous decoder for quantum multiple access channels with classical inputs and one quantum output. 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.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- One-Shot Classical-Quantum Capacity and Hypothesis TestingPhysical Review Letters, 2012
- Achieving the Holevo bound via sequential measurementsPhysical Review A, 2012
- Generalized relative entropies and the capacity of classical-quantum channelsJournal of Mathematical Physics, 2009
- The mother of all protocols: restructuring quantum information’s family treeProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2009
- Superadditivity of communication capacity using entangled inputsNature Physics, 2009
- Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1Communications in Mathematical Physics, 2008
- A Quantum Version of Sanov's TheoremCommunications in Mathematical Physics, 2005
- The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum InformationCommunications in Mathematical Physics, 2005
- Sending classical information via noisy quantum channelsPhysical Review A, 1997
- Capacity of the noisy quantum channelPhysical Review A, 1997