Pith. sign in

REVIEW

Quantum interference channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1102.2955 v3 pith:5GX2EKBE submitted 2011-02-15 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords quantuminterferencechannelchannelsstrongachievablecasedecoder
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Pith tools