53 research outputs found
Classical communication over a quantum interference channel
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 settings of very strong and strong interference, by exploiting Winter\u27s successive decoding strategy and a novel two-sender quantum simultaneous decoder, respectively. We provide a proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a three-sender quantum simultaneous decoder. 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. © 2012 IEEE
Polar codes in network quantum information theory
Polar coding is a method for communication over noisy classical channels
which is provably capacity-achieving and has an efficient encoding and
decoding. Recently, this method has been generalized to the realm of quantum
information processing, for tasks such as classical communication, private
classical communication, and quantum communication. In the present work, we
apply the polar coding method to network quantum information theory, by making
use of recent advances for related classical tasks. In particular, we consider
problems such as the compound multiple access channel and the quantum
interference channel. The main result of our work is that it is possible to
achieve the best known inner bounds on the achievable rate regions for these
tasks, without requiring a so-called quantum simultaneous decoder. Thus, our
work paves the way for developing network quantum information theory further
without requiring a quantum simultaneous decoder.Comment: 18 pages, 2 figures, v2: 10 pages, double column, version accepted
for publicatio
On simultaneous min-entropy smoothing
In the context of network information theory, one often needs a multiparty
probability distribution to be typical in several ways simultaneously. When
considering quantum states instead of classical ones, it is in general
difficult to prove the existence of a state that is jointly typical. Such a
difficulty was recently emphasized and conjectures on the existence of such
states were formulated. In this paper, we consider a one-shot multiparty
typicality conjecture. The question can then be stated easily: is it possible
to smooth the largest eigenvalues of all the marginals of a multipartite state
{\rho} simultaneously while staying close to {\rho}? We prove the answer is yes
whenever the marginals of the state commute. In the general quantum case, we
prove that simultaneous smoothing is possible if the number of parties is two
or more generally if the marginals to optimize satisfy some non-overlap
property.Comment: 5 page
Joint source-channel coding for a quantum multiple access channel
Suppose that two senders each obtain one share of the output of a classical,
bivariate, correlated information source. They would like to transmit the
correlated source to a receiver using a quantum multiple access channel. In
prior work, Cover, El Gamal, and Salehi provided a combined source-channel
coding strategy for a classical multiple access channel which outperforms the
simpler "separation" strategy where separate codebooks are used for the source
coding and the channel coding tasks. In the present paper, we prove that a
coding strategy similar to the Cover-El Gamal-Salehi strategy and a
corresponding quantum simultaneous decoder allow for the reliable transmission
of a source over a quantum multiple access channel, as long as a set of
information inequalities involving the Holevo quantity hold.Comment: 21 pages, v2: minor changes, accepted into Journal of Physics
Partial decode-forward for quantum relay channels
A relay channel is one in which a Source and Destination use an intermediate
Relay station in order to improve communication rates. We propose the study of
relay channels with classical inputs and quantum outputs and prove that a
"partial decode and forward" strategy is achievable. We divide the channel uses
into many blocks and build codes in a randomized, block-Markov manner within
each block. The Relay performs a standard Holevo-Schumacher-Westmoreland
quantum measurement on each block in order to decode part of the Source's
message and then forwards this partial message in the next block. The
Destination performs a novel "sliding-window" quantum measurement on two
adjacent blocks in order to decode the Source's message. This strategy achieves
non-trivial rates for classical communication over a quantum relay channel.Comment: 7 pages, submission to the 2012 International Symposium on
Information Theory (ISIT 2012), Boston, MA, US
Explicit receivers for pure-interference bosonic multiple access channels
The pure-interference bosonic multiple access channel has two senders and one
receiver, such that the senders each communicate with multiple temporal modes
of a single spatial mode of light. The channel mixes the input modes from the
two users pairwise on a lossless beamsplitter, and the receiver has access to
one of the two output ports. In prior work, Yen and Shapiro found the capacity
region of this channel if encodings consist of coherent-state preparations.
Here, we demonstrate how to achieve the coherent-state Yen-Shapiro region (for
a range of parameters) using a sequential decoding strategy, and we show that
our strategy outperforms the rate regions achievable using conventional
receivers. Our receiver performs binary-outcome quantum measurements for every
codeword pair in the senders' codebooks. A crucial component of this scheme is
a non-destructive "vacuum-or-not" measurement that projects an n-symbol
modulated codeword onto the n-fold vacuum state or its orthogonal complement,
such that the post-measurement state is either the n-fold vacuum or has the
vacuum removed from the support of the n symbols' joint quantum state. This
receiver requires the additional ability to perform multimode optical
phase-space displacements which are realizable using a beamsplitter and a
laser.Comment: v1: 9 pages, 2 figures, submission to the 2012 International
Symposium on Information Theory and its Applications (ISITA 2012), Honolulu,
Hawaii, USA; v2: minor change
- …