1,918 research outputs found
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
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
A Rate-Splitting Based Bound-Approaching Transmission Scheme for the Two-User Symmetric Gaussian Interference Channel with Common Messages
This paper is concerned with a rate-splitting based transmission strategy for the two-user symmetric Gaussian interference channel that contains common messages only. Each transmitter encodes its common message into multiple layers by multiple codebooks that drawn from one separate code book, and transmits the superposition of the messages corresponding to these layers; each receiver decodes the messages from all layers of the two users successively. Two schemes are proposed for decoding order and optimal power allocation among layers respectively. With the proposed decoding order scheme, the sum-rate can be increased by rate-splitting, especially at the optimal number of rate-splitting, using average power allocation in moderate and weak interference regime. With the two proposed schemes at the receiver and the transmitter respectively, the sum-rate achieves the inner bound of HK without time-sharing. Numerical results show that the proposed optimal power allocation scheme with the proposed decoding order can achieve significant improvement of the performance over equal power allocation, and achieve the sum-rate within two bits per channel use (bits/channel use) of the sum capacity
Network information theory for classical-quantum channels
Network information theory is the study of communication problems involving
multiple senders, multiple receivers and intermediate relay stations. The
purpose of this thesis is to extend the main ideas of classical network
information theory to the study of classical-quantum channels. We prove coding
theorems for quantum multiple access channels, quantum interference channels,
quantum broadcast channels and quantum relay channels.
A quantum model for a communication channel describes more accurately the
channel's ability to transmit information. By using physically faithful models
for the channel outputs and the detection procedure, we obtain better
communication rates than would be possible using a classical strategy. In this
thesis, we are interested in the transmission of classical information, so we
restrict our attention to the study of classical-quantum channels. These are
channels with classical inputs and quantum outputs, and so the coding theorems
we present will use classical encoding and quantum decoding. We study the
asymptotic regime where many copies of the channel are used in parallel, and
the uses are assumed to be independent. In this context, we can exploit
information-theoretic techniques to calculate the maximum rates for error-free
communication for any channel, given the statistics of the noise on that
channel. These theoretical bounds can be used as a benchmark to evaluate the
rates achieved by practical communication protocols.
Most of the results in this thesis consider classical-quantum channels with
finite dimensional output systems, which are analogous to classical discrete
memoryless channels. In the last chapter, we will show some applications of our
results to a practical optical communication scenario, in which the information
is encoded in continuous quantum degrees of freedom, which are analogous to
classical channels with Gaussian noise.Comment: Ph.D. Thesis, McGill University, School of Computer Science, July
2012, 223 pages, 18 figures, 36 TikZ diagram
Quantum interference channels
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.Comment: 10 pages, 2 figures, submitted to the 2011 Allerton Conference on
Communication, Control, and Computing; v3 has a proof for a two-sender
quantum simultaneous decoder and as a result, we get the capacity for
channels with strong interferenc
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
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
- …