Quantum interference channels

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 2 figures, submitted to the 2011 Allerton Conference on Communication, Control, and Computing; v3 has a proof for a

Scientific paper

10.1109/Allerton.2011.6120224

The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce and study the quantum interference channel, a generalization of a two-input, two-output memoryless channel to the setting of quantum Shannon theory. We discuss three different coding strategies and obtain corresponding achievable rate regions for quantum interference channels. We calculate the capacity regions in the special cases of "very strong" and "strong" interference. The achievability proof in the case of "strong" interference exploits a novel quantum simultaneous decoder for two-sender quantum multiple access channels. We formulate a conjecture regarding the existence of a quantum simultaneous decoder in the three-sender case and use it to state the rates achievable by a quantum Han-Kobayashi strategy.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum interference channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum interference channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum interference channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-377810

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.