284,701 research outputs found
Entropic bounds on coding for noisy quantum channels
In analogy with its classical counterpart, a noisy quantum channel is
characterized by a loss, a quantity that depends on the channel input and the
quantum operation performed by the channel. The loss reflects the transmission
quality: if the loss is zero, quantum information can be perfectly transmitted
at a rate measured by the quantum source entropy. By using block coding based
on sequences of n entangled symbols, the average loss (defined as the overall
loss of the joint n-symbol channel divided by n, when n tends to infinity) can
be made lower than the loss for a single use of the channel. In this context,
we examine several upper bounds on the rate at which quantum information can be
transmitted reliably via a noisy channel, that is, with an asymptotically
vanishing average loss while the one-symbol loss of the channel is non-zero.
These bounds on the channel capacity rely on the entropic Singleton bound on
quantum error-correcting codes [Phys. Rev. A 56, 1721 (1997)]. Finally, we
analyze the Singleton bounds when the noisy quantum channel is supplemented
with a classical auxiliary channel.Comment: 20 pages RevTeX, 10 Postscript figures. Expanded Section II, added 1
figure, changed title. To appear in Phys. Rev. A (May 98
Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks
This paper introduces a new channel selection strategy for reliable
contentionaware data dissemination in multi-hop cognitive radio network. The
key challenge here is to select channels providing a good tradeoff between
connectivity and contention. In other words, channels with good opportunities
for communication due to (1) low primary radio nodes (PRs) activities, and (2)
limited contention of cognitive ratio nodes (CRs) acceding that channel, have
to be selected. Thus, by dynamically exploring residual resources on channels
and by monitoring the number of CRs on a particular channel, SURF allows
building a connected network with limited contention where reliable
communication can take place. Through simulations, we study the performance of
SURF when compared with three other related approaches. Simulation results
confirm that our approach is effective in selecting the best channels for
efficient and reliable multi-hop data dissemination
On the von Neumann capacity of noisy quantum channels
We discuss the capacity of quantum channels for information transmission and
storage. Quantum channels have dual uses: they can be used to transmit known
quantum states which code for classical information, and they can be used in a
purely quantum manner, for transmitting or storing quantum entanglement. We
propose here a definition of the von Neumann capacity of quantum channels,
which is a quantum mechanical extension of the Shannon capacity and reverts to
it in the classical limit. As such, the von Neumann capacity assumes the role
of a classical or quantum capacity depending on the usage of the channel. In
analogy to the classical construction, this capacity is defined as the maximum
von Neumann mutual entropy processed by the channel, a measure which reduces to
the capacity for classical information transmission through quantum channels
(the "Kholevo capacity") when known quantum states are sent. The quantum mutual
entropy fulfills all basic requirements for a measure of information, and
observes quantum data-processing inequalities. We also derive a quantum Fano
inequality relating the quantum loss of the channel to the fidelity of the
quantum code. The quantities introduced are calculated explicitly for the
quantum "depolarizing" channel. The von Neumann capacity is interpreted within
the context of superdense coding, and an "extended" Hamming bound is derived
that is consistent with that capacity.Comment: 15 pages RevTeX with psfig, 13 figures. Revised interpretation of
capacity, added section, changed titl
Recommended from our members
Survey of unified approaches to integrated-service networks
The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data, and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus, allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks including a look at N-ISDN, while focusing on unified approaches to integrated-service networks.The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of "bursts" of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hardwired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network
Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding
In this paper, a transmission protocol is studied for a two relay wireless
network in which simple repetition coding is applied at the relays.
Information-theoretic achievable rates for this transmission scheme are given,
and a space-time V-BLAST signalling and detection method that can approach them
is developed. It is shown through the diversity multiplexing tradeoff analysis
that this transmission scheme can recover the multiplexing loss of the
half-duplex relay network, while retaining some diversity gain. This scheme is
also compared with conventional transmission protocols that exploit only the
diversity of the network at the cost of a multiplexing loss. It is shown that
the new transmission protocol offers significant performance advantages over
conventional protocols, especially when the interference between the two relays
is sufficiently strong.Comment: To appear in the IEEE Transactions on Wireless Communication
- …