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

Quantum entanglement

Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed ‘teleportation stretching’, we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.

/pdf/fundamental-limits-of-repeaterless-quantum-communications-cyaxqy3m5e.pdf

Fundamental limits of repeaterless quantum communications.

Finally, here is a modern, self-contained text on quantum information theory suitable for graduate-level courses. Developing the subject 'from the ground up' it covers classical results as well as major advances of the past decade. Beginning with an extensive overview of classical information theory suitable for the non-expert, the author then turns his attention to quantum mechanics for quantum information theory, and the important protocols of teleportation, super-dense coding and entanglement distribution. He develops all of the tools necessary for understanding important results in quantum information theory, including capacity theorems for classical, entanglement-assisted, private and quantum communication. The book also covers important recent developments such as superadditivity of private, coherent and Holevo information, and the superactivation of quantum capacity. This book will be warmly welcomed by the upcoming generation of quantum information theorists and the already established community of classical information theorists.

/pdf/quantum-information-theory-5795t2zej7.pdf

Quantum Information Theory

This largely self-contained book on the theory of quantum information focuses on precise mathematical formulations and proofs of fundamental facts that form the foundation of the subject. It is intended for graduate students and researchers in mathematics, computer science, and theoretical physics seeking to develop a thorough understanding of key results, proof techniques, and methodologies that are relevant to a wide range of research topics within the theory of quantum information and computation. The book is accessible to readers with an understanding of basic mathematics, including linear algebra, mathematical analysis, and probability theory. An introductory chapter summarizes these necessary mathematical prerequisites, and starting from this foundation, the book includes clear and complete proofs of all results it presents. Each subsequent chapter includes challenging exercises intended to help readers to develop their own skills for discovering proofs concerning the theory of quantum information.

The Theory of Quantum Information

Quantum Information Theory: Noisy Quantum Shannon Theory

Hastings [12] recently provided a proof of the existence of channels which violate the additivity conjecture for minimal output entropy In this paper we present an expanded version of Hastings’ proof In addition to a careful elucidation of the details of the proof, we also present bounds for the minimal dimensions needed to obtain a counterexample

/pdf/comments-on-hastings-additivity-counterexamples-23hqvg759c.pdf

Comments on Hastings’ Additivity Counterexamples

We study the additivity problems for the classical capacity of quantum channels, the minimal output entropy, and its convex closure. We show for each of them that additivity for arbitrary pairs of channels holds if and only if it holds for arbitrary equal pairs, which in turn can be taken to be unital. In a similar sense, weak additivity is shown to imply strong additivity for any convex entanglement monotone. The implications are obtained by considering direct sums of channels (or states) for which we show how to obtain several information theoretic quantities from their values on the summands. This provides a simple and general tool for lifting additivity results.

Simplifying additivity problems using direct sum constructions

This paper contains several new results concerning covariant quantum channels in d ? 2 dimensions. The first part, Sec. 3, based on [4], is devoted to unitarily covariant channels, namely depolarizing and transpose-depolarizing channels. The second part, Sec. 4, based on [10], studies Weyl-covariant channels. These results are preceded by Sec. 2 in which we discuss various representations of general completely positive maps and channels. In the first part of the paper we compute complementary channels for depolarizing and transpose-depolarizing channels. This method easily yields minimal Kraus representations from non-minimal ones. We also study properties of the output purity of the tensor product of a channel and its complementary. In the second part, the formalism of discrete noncommutative Fourier transform is developed and applied to the study of Weyl-covariant maps and channels. We then extend a result in [16] concerning a bound for the maximal output 2-norm of a Weyl-covariant channel. A class of maps which attain the bound is introduced, for which the multiplicativity of the maximal output 2-norm is proven. The complementary channels are described which have the same multiplicativity properties as the Weyl-covariant channels.

http://www.univie.ac.at/nuhag-php/bibtex/open_files/dafuho06_Holevo.pdf

Complementarity and Additivity for Covariant Channels

Recently, Hastings [“A counterexample to additivity of minimum output entropy,” Nat. Phys. 5, 255 (2009); e-print arXiv:0809.3972v3] proved the existence of random unitary channels, which violate the additivity conjecture. In this paper, we use Hastings’ method to derive new bounds for the entanglement of random subspaces of bipartite systems. As an application we use these bounds to prove the existence of nonunital channels, which violate additivity of minimal output entropy.

Entanglement of random subspaces via the Hastings bound

We prove a lemma which allows one to extend results about the additivity of the minimal output entropy from highly symmetric channels to a much larger class. A similar result holds for the maximal output p-norm. Examples are given showing its use in a variety of situations. In particular, we prove the additivity and the multiplicativity for the shifted depolarizing channel.

https://iopscience.iop.org/article/10.1088/0305-4470/38/45/L02/pdf

Motohisa Fukuda

Papers

Comments on Hastings’ Additivity Counterexamples

Simplifying additivity problems using direct sum constructions

Complementarity and Additivity for Covariant Channels

Entanglement of random subspaces via the Hastings bound

Extending additivity from symmetric to asymmetric channels