4,007 research outputs found
The classical-quantum boundary for correlations: discord and related measures
One of the best signatures of nonclassicality in a quantum system is the
existence of correlations that have no classical counterpart. Different methods
for quantifying the quantum and classical parts of correlations are amongst the
more actively-studied topics of quantum information theory over the past
decade. Entanglement is the most prominent of these correlations, but in many
cases unentangled states exhibit nonclassical behavior too. Thus distinguishing
quantum correlations other than entanglement provides a better division between
the quantum and classical worlds, especially when considering mixed states.
Here we review different notions of classical and quantum correlations
quantified by quantum discord and other related measures. In the first half, we
review the mathematical properties of the measures of quantum correlations,
relate them to each other, and discuss the classical-quantum division that is
common among them. In the second half, we show that the measures identify and
quantify the deviation from classicality in various
quantum-information-processing tasks, quantum thermodynamics, open-system
dynamics, and many-body physics. We show that in many cases quantum
correlations indicate an advantage of quantum methods over classical ones.Comment: Close to the published versio
Quantum coding with finite resources
The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances
On Approaching the Ultimate Limits of Photon-Efficient and Bandwidth-Efficient Optical Communication
It is well known that ideal free-space optical communication at the quantum
limit can have unbounded photon information efficiency (PIE), measured in bits
per photon. High PIE comes at a price of low dimensional information efficiency
(DIE), measured in bits per spatio-temporal-polarization mode. If only temporal
modes are used, then DIE translates directly to bandwidth efficiency. In this
paper, the DIE vs. PIE tradeoffs for known modulations and receiver structures
are compared to the ultimate quantum limit, and analytic approximations are
found in the limit of high PIE. This analysis shows that known structures fall
short of the maximum attainable DIE by a factor that increases linearly with
PIE for high PIE.
The capacity of the Dolinar receiver is derived for binary coherent-state
modulations and computed for the case of on-off keying (OOK). The DIE vs. PIE
tradeoff for this case is improved only slightly compared to OOK with photon
counting. An adaptive rule is derived for an additive local oscillator that
maximizes the mutual information between a receiver and a transmitter that
selects from a set of coherent states. For binary phase-shift keying (BPSK),
this is shown to be equivalent to the operation of the Dolinar receiver.
The Dolinar receiver is extended to make adaptive measurements on a coded
sequence of coherent state symbols. Information from previous measurements is
used to adjust the a priori probabilities of the next symbols. The adaptive
Dolinar receiver does not improve the DIE vs. PIE tradeoff compared to
independent transmission and Dolinar reception of each symbol.Comment: 10 pages, 8 figures; corrected a typo in equation 3
Remote preparation of quantum states
Remote state preparation is the variant of quantum state teleportation in
which the sender knows the quantum state to be communicated. The original paper
introducing teleportation established minimal requirements for classical
communication and entanglement but the corresponding limits for remote state
preparation have remained unknown until now: previous work has shown, however,
that it not only requires less classical communication but also gives rise to a
trade-off between these two resources in the appropriate setting. We discuss
this problem from first principles, including the various choices one may
follow in the definitions of the actual resources. Our main result is a general
method of remote state preparation for arbitrary states of many qubits, at a
cost of 1 bit of classical communication and 1 bit of entanglement per qubit
sent. In this "universal" formulation, these ebit and cbit requirements are
shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then
yields the exact trade-off curve for arbitrary ensembles of pure states and
pure entangled states (including the case of incomplete knowledge of the
ensemble probabilities), based on the recently established quantum-classical
trade-off for quantum data compression. The paper includes an extensive
discussion of our results, including the impact of the choice of model on the
resources, the topic of obliviousness, and an application to private quantum
channels and quantum data hiding.Comment: 21 pages plus 2 figures (eps), revtex4. v2 corrects some errors and
adds obliviousness discussion. v3 has section VI C deleted and various minor
oversights correcte
Tight Bounds on the R\'enyi Entropy via Majorization with Applications to Guessing and Compression
This paper provides tight bounds on the R\'enyi entropy of a function of a
discrete random variable with a finite number of possible values, where the
considered function is not one-to-one. To that end, a tight lower bound on the
R\'enyi entropy of a discrete random variable with a finite support is derived
as a function of the size of the support, and the ratio of the maximal to
minimal probability masses. This work was inspired by the recently published
paper by Cicalese et al., which is focused on the Shannon entropy, and it
strengthens and generalizes the results of that paper to R\'enyi entropies of
arbitrary positive orders. In view of these generalized bounds and the works by
Arikan and Campbell, non-asymptotic bounds are derived for guessing moments and
lossless data compression of discrete memoryless sources.Comment: The paper was published in the Entropy journal (special issue on
Probabilistic Methods in Information Theory, Hypothesis Testing, and Coding),
vol. 20, no. 12, paper no. 896, November 22, 2018. Online available at
https://www.mdpi.com/1099-4300/20/12/89
Asymptotic Performance of Linear Receivers in MIMO Fading Channels
Linear receivers are an attractive low-complexity alternative to optimal
processing for multi-antenna MIMO communications. In this paper we characterize
the information-theoretic performance of MIMO linear receivers in two different
asymptotic regimes. For fixed number of antennas, we investigate the limit of
error probability in the high-SNR regime in terms of the Diversity-Multiplexing
Tradeoff (DMT). Following this, we characterize the error probability for fixed
SNR in the regime of large (but finite) number of antennas.
As far as the DMT is concerned, we report a negative result: we show that
both linear Zero-Forcing (ZF) and linear Minimum Mean-Square Error (MMSE)
receivers achieve the same DMT, which is largely suboptimal even in the case
where outer coding and decoding is performed across the antennas. We also
provide an approximate quantitative analysis of the markedly different behavior
of the MMSE and ZF receivers at finite rate and non-asymptotic SNR, and show
that while the ZF receiver achieves poor diversity at any finite rate, the MMSE
receiver error curve slope flattens out progressively, as the coding rate
increases.
When SNR is fixed and the number of antennas becomes large, we show that the
mutual information at the output of a MMSE or ZF linear receiver has
fluctuations that converge in distribution to a Gaussian random variable, whose
mean and variance can be characterized in closed form. This analysis extends to
the linear receiver case a well-known result previously obtained for the
optimal receiver. Simulations reveal that the asymptotic analysis captures
accurately the outage behavior of systems even with a moderate number of
antennas.Comment: 48 pages, Submitted to IEEE Transactions on Information Theor
Quantum entanglement
All our former experience with application of quantum theory seems to say:
{\it what is predicted by quantum formalism must occur in laboratory}. But the
essence of quantum formalism - entanglement, recognized by Einstein, Podolsky,
Rosen and Schr\"odinger - waited over 70 years to enter to laboratories as a
new resource as real as energy.
This holistic property of compound quantum systems, which involves
nonclassical correlations between subsystems, is a potential for many quantum
processes, including ``canonical'' ones: quantum cryptography, quantum
teleportation and dense coding. However, it appeared that this new resource is
very complex and difficult to detect. Being usually fragile to environment, it
is robust against conceptual and mathematical tools, the task of which is to
decipher its rich structure.
This article reviews basic aspects of entanglement including its
characterization, detection, distillation and quantifying. In particular, the
authors discuss various manifestations of entanglement via Bell inequalities,
entropic inequalities, entanglement witnesses, quantum cryptography and point
out some interrelations. They also discuss a basic role of entanglement in
quantum communication within distant labs paradigm and stress some
peculiarities such as irreversibility of entanglement manipulations including
its extremal form - bound entanglement phenomenon. A basic role of entanglement
witnesses in detection of entanglement is emphasized.Comment: 110 pages, 3 figures, ReVTex4, Improved (slightly extended)
presentation, updated references, minor changes, submitted to Rev. Mod. Phys
- …