Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding
arXiv:1109.0802
Abstract
In this paper, we study the power of sequential decoding strategies for several channels with classical input and quantum output. In our sequential decoding strategies, the receiver loops through all candidate messages trying to project the received state onto a `typical' subspace for the candidate message under consideration, stopping if the projection succeeds for a message, which is then declared as the guess of the receiver for the sent message. We show that even such a conceptually simple strategy can be used to achieve rates up to the mutual information for a single sender single receiver channel called cq-channel henceforth, as well as the standard inner bound for a two sender single receiver multiple access channel, called ccq-MAC in this paper. Our decoding scheme for the ccq-MAC uses a new kind of conditionally typical projector which is constructed using a geometric result about how two subspaces interact structurally. As the main application of our methods, we construct an encoding and decoding scheme achieving the Chong-Motani-Garg inner bound for a two sender two receiver interference channel with classical input and quantum output, called ccqq-IC henceforth. This matches the best known inner bound for the interference channel in the classical setting. Achieving the Chong-Motani-Garg inner bound, which is known to be equivalent to the Han-Kobayashi inner bound, answers an open question raised recently by Fawzi et al. (arxiv:1102.2624). Our encoding scheme is the same as that of Chong-Motani-Garg, and our decoding scheme is sequential.
34 pages
References in corpus (2)
Cited by in corpus (16)
- Polar codes for classical-quantum channels
- Optical codeword demodulation with error rates below standard quantum limit using a conditional nulling receiver
- The information-theoretic costs of simulating quantum measurements
- Principles of Quantum Communication Theory: A Modern Approach
- Provably accurate simulation of gauge theories and bosonic systems
- Polar coding to achieve the Holevo capacity of a pure-loss optical channel
- Quantum union bounds for sequential projective measurements
- Polar codes in network quantum information theory
- On simultaneous min-entropy smoothing
- The Classical-Quantum Channel with Random State Parameters Known to the Sender
- Partial decode-forward for quantum relay channels
- Towards efficient decoding of classical-quantum polar codes
- Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs
- Polar codes in quantum information theory
- Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting
- High probability decoupling via approximate unitary designs and efficient relative thermalisation