By Topic

Achieving the Han-Kobayashi inner bound for the quantum interference channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sen, P. ; Sch. of Technol. & Comput. Sci., Tata Inst. of Fundamental Res., Mumbai, India

We construct an encoding and decoding scheme achieving the Chong-Motani-Garg inner bound [1] for a two sender two receiver interference channel with classical input and quantum output. This automatically gives a similar inner bound for sending classical information through an interference channel with quantum inputs and outputs without entanglement assistance. Our result 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 [3], answers an open question raised recently by Fawzi et al. [4]. Our encoding strategy is the standard random encoding strategy. Our decoding strategy is a sequential strategy where a 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. On the way to our main result, we show that random encoding and sequential decoding strategies suffice to achieve rates up to the mutual information for a single sender single receiver channel, and the standard inner bound for a two sender single receiver multiple access channel, for channels with classical input and quantum output. Besides conceptual simplicity, a sequential decoding strategy is space efficient, and may have additional efficiency advantages in some settings. We prove our inner bounds using two new technical tools - a non-commutative union bound to analyse the decoding error probability, and a geometric notion of approximate interesection of two conditionally typical subspaces.

Published in:

Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on

Date of Conference:

1-6 July 2012