DOCSLIB.ORG

Positivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Positivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels Positivity and nonadditivity of quantum capacities using generalized erasure channels Vikesh Siddhu∗ and Robert B. Griffiths† Department of Physics, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, U.S.A. Date: 1 March 2020 Abstract The positivity and nonadditivity of the one-letter quantum capacity (maximum coherent information) Q(1) is studied for two simple examples of complementary quantum channel pairs (B, C). They are produced by a process, we call it gluing, for combining two or more channels to form a composite. (We discuss various other forms of gluing, some of which may be of interest for applications outside those considered in this paper.) An amplitude-damping qubit channel with damping probability 0 ≤ p ≤ 1 glued to a perfect channel is an example of what we call a generalized erasure channel characterized by an erasure probability λ along with p. A second example, using a phase-damping rather than amplitude- damping qubit channel, results in the dephrasure channel of Ledtizky et al. [Phys. Rev. Lett. 121, 160501 (2018)]. In both cases we find the global maximum and minimum of the entropy bias or coherent (1) (1) information, which determine Q (Bg) and Q (Cg), respectively, and the ranges in the (p, λ) parameter space where these capacities are positive or zero, confirming previous results for the dephrasure channel. (1) The nonadditivity of Q (Bg) for two channels in parallel occurs in a well defined region of the (p, λ) plane for the amplitude-damping case, whereas for the dephrasure case we extend previous results to (1) additional values of p and λ at which nonadditivity occurs. For both cases, Q (Cg) shows a peculiar (1) behavior: When p = 0, Cg is an erasure channel with erasure probability 1 − λ, so Q (Cg) is zero for (1) λ ≤ 1/2. However, for any p > 0, no matter how small, Q (Cg) is positive, though it may be extremely small, for all λ > 0. Despite the simplicity of these models we still lack an intuitive understanding of the (1) (1) nonadditivity of Q (Bg) and the positivity of Q (Cg). Contents 1 Introduction 2 2 Preliminaries 3 3 Glued Isometries and Channels4 4 Generalized Erasure Channel Pair6 5 Applications 8 5.1 Generalized Erasure using Qubit Amplitude Damping Channel . .8 5.2 Generalized Erasure with Qubit Dephasing Channel . 10 5.3 Incomplete Erasure Channel . 11 6 Summary and Conclusions 12 arXiv:2003.00583v1 [quant-ph] 1 Mar 2020 A Appendix. Concatenation and antidegradable channels 14 (1) (1) B Appendix. Asymptotic estimates of Q (Bg) and Q (Cg) 15 ∗[email protected] †[email protected] 1 1 Introduction Understanding the capacity of a noisy quantum channel to transmit information is a central and chal- lenging problem in quantum information theory. In contrast to the case of a classical channel one can define several capacities for a quantum channel, among them the capacity to transmit classical information [1,2], the private capacity [3], and—the subject of the present paper—the quantum capacity, a measure of its ability to transmit quantum information. The asymptotic capacity C of a classical channel was shown by Shan- non [4] to be equal to the mutual information between input and output, when maximized over probability distributions of the input. An analog of this mutual information for a quantum channel B is the entropy bias or coherent information ∆(B, ρ)[5], the difference of the von Neumann entropies of the outputs of B and its complementary channel C for a given input density operator ρ. Maximizing this over ρ yields a non-negative real number, the single-letter quantum capacity (sometimes also called the channel coherent information) Q(1)(B). (A quantum channel B of the kind considered here is always a member of a complementary pair of channels (B, C), C the complement B and vice versa, generated by a single isometry as discussed in Sec.2.) A significant difference between quantum and classical channels is that when two classical channels are placed in parallel the capacity C of the combination is simply the sum of the individual capacities, whereas in the quantum case when channel B is placed in parallel with B0 one has only an inequality: Q(1)(B ⊗ B0) ≥ Q(1)(B) + Q(1)(B0). (1) This inequality can be strict, i.e., Q(1) can be nonadditive [6]. Nonadditivity makes it difficult to calculate the asymptotic quantum capacity Q(B) of a channel B, the limit as n → ∞ of Q(1)(B⊗n)/n [3,7,8]. In addition, due to nonadditivity the asymptotic capacity Q(B ⊗ B0) of two quantum channels B and B0 used in parallel may be greater than Q(B) + Q(B0)[9, 10], which implies that the asymptotic Q, unlike its classical counterpart C, does not completely capture a channel’s ability to transmit quantum information. The mathematical or physical principles behind nonadditivity are at present not well understood. Simple examples of nonadditivity are hard to construct. One source of difficulty is finding the global maximum of a function ∆(B, ρ) which in general is not a concave function of ρ. It both B and B0 are channels that are either degradable or antidegradable (see comments at the end of Sec.2) it is known that (1) is an equality, and therefore Q(B) = Q(1)(B), and Q(B ⊗ B0) = Q(B) + Q(B0)[11, 12]. For an antidegradable channel Q(1)(B) = Q(B) = 0, and the same is true for entanglement- binding channels [13]. But apart from special cases such as these it is in general not easy to determine whether Q(1) or Q is positive or zero [14, 15]. For the case of two identical channels in parallel, B0 = B, a simple example of nonadditivity has recently been constructed by Leditzky et al. [16] using what they call the dephrasure channel. To show nonadditivity (1) they first find Q (B), and then make a guess or ansatz ρˆ2 for a bipartite input density operator for which ⊗2 (1) ⊗2 (1) ∆(B , ρˆ2), a lower bound for Q (B ), is larger than 2Q (B). The ansatz approach can be extended to ⊗n (1) ⊗n n identical channels in parallel in an obvious way to look for cases where ∆(B , ρˆn) (and hence Q (B )) exceeds nQ(1)(B). This approach has been successfully applied for n ≥ 5 to the qubit depolarizing channel [6] where Q(1) is known, and to other qubit Pauli channels [17, 18] where Q(1) is believed to be known. Our exploration of some of these issues begins with a general procedure for combining several quantum channels to form a new channel through a process we call gluing. It differs from the familiar procedures of placing channels in parallel or series, and it puts together in a single overall structure concepts such as subchannels and convex combinations of channels. A particular type of gluing results in what we call a block diagonal channel pair, an instance of which is the much-studied and well-understood erasure channel [19] with erasure probability 0 ≤ λ ≤ 1, whose complement is also an erasure channel. The erasure channel can be regarded as the result of gluing together two perfect channels as discussed in Sec.4. When one of the perfect channel pairs is replaced by an arbitrary complementary channel pair (B1, C1) the result is a generalized erasure channel pair (Bg, Cg). The Bg channel can be viewed as a concatenation of B1 with an erasure channel, and Cg as an “incomplete erasure” channel. We study two cases of such generalized erasure channel pairs. In the first, B1 is a qubit-to-qubit amplitude damping channel, as is its complement C1. In the second, B1 is a qubit-to-qubit phase-damping channel whose complement is a measure-and-prepare channel; here Bg is the dephrasure channel. In both cases the qubit channel pair (B1, C1) depends on a parameter 0 ≤ p ≤ 1, and thus (Bg, Cg) depends on two parameters, (1) (1) p and the erasure probability λ. For all values of these parameters we compute Q (Bg) and Q (Cg) by 2 performing a global optimization and find the (p, λ) values for which they are positive. The dependence of (1) Q (Cg) on these parameters is rather surprising—see Fig.4 and the accompanying discussion—and worth further study. In both the amplitude and phase damping cases we find nonadditivity, a strict inequality in (1), when both 0 B and B are Bg. Our results in the amplitude damping case indicate that nonadditivity occurs over a well- defined region in the space (p, λ) of parameters, as shown in Fig.2. For the phase-damping case, where Bg is the dephrasure channel, our numerical results confirm and also extend the region of nonadditivity identified in [16], but without finding its precise boundaries. In addition we have carried out a limited exploration of higher-order nonadditivity by using various ansatzes, but without finding anything very interesting. The remainder of this paper is structured as follows. Section2 contains preliminary definitions and notation: in particular our use of isometries to construct a channel pair, and the use of projective decompo- sitions of the identity (PDIs) to identify orthogonal subspaces. Definitions of the entropy bias ∆(B, ρ) and the single-letter quantum capacity Q(1)(B) of a channel B, and (anti)degradable channels are also found in this section. Various gluing procedures for combining two or more channels are discussed at some length in Sec.3. The particular procedure that yields a block diagonal channel pair (see eq.
Load more

Recommended publications
  • Lecture 6: Quantum Error Correction and Quantum Capacity
    Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde∗ The quantum capacity theorem is one of the most important theorems in quantum Shannon theory. It is a fundamentally \quantum" theorem in that it demonstrates that a fundamentally quantum information quantity, the coherent information, is an achievable rate for quantum com- munication over a quantum channel. The fact that the coherent information does not have a strong analog in classical Shannon theory truly separates the quantum and classical theories of information. The no-cloning theorem provides the intuition behind quantum error correction. The goal of any quantum communication protocol is for Alice to establish quantum correlations with the receiver Bob. We know well now that every quantum channel has an isometric extension, so that we can think of another receiver, the environment Eve, who is at a second output port of a larger unitary evolution. Were Eve able to learn anything about the quantum information that Alice is attempting to transmit to Bob, then Bob could not be retrieving this information|otherwise, they would violate the no-cloning theorem. Thus, Alice should figure out some subspace of the channel input where she can place her quantum information such that only Bob has access to it, while Eve does not. That the dimensionality of this subspace is exponential in the coherent information is perhaps then unsurprising in light of the above no-cloning reasoning. The coherent information is an entropy difference H(B) − H(E)|a measure of the amount of quantum correlations that Alice can establish with Bob less the amount that Eve can gain.
    [Show full text]
  • Lecture 18 — October 26, 2015 1 Overview 2 Quantum Entropy
    PHYS 7895: Quantum Information Theory Fall 2015 Lecture 18 | October 26, 2015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. 1 Overview In the previous lecture, we discussed classical entropy and entropy inequalities. In this lecture, we discuss several information measures that are important for quantifying the amount of information and correlations that are present in quantum systems. The first fundamental measure that we introduce is the von Neumann entropy. It is the quantum generalization of the Shannon entropy, but it captures both classical and quantum uncertainty in a quantum state. The von Neumann entropy gives meaning to a notion of the information qubit. This notion is different from that of the physical qubit, which is the description of a quantum state of an electron or a photon. The information qubit is the fundamental quantum informational unit of measure, determining how much quantum information is present in a quantum system. The initial definitions here are analogous to the classical definitions of entropy, but we soon discover a radical departure from the intuitive classical notions from the previous chapter: the conditional quantum entropy can be negative for certain quantum states. In the classical world, this negativity simply does not occur, but it takes a special meaning in quantum information theory. Pure quantum states that are entangled have stronger-than-classical correlations and are examples of states that have negative conditional entropy. The negative of the conditional quantum entropy is so important in quantum information theory that we even have a special name for it: the coherent information.
    [Show full text]
  • Quantum Information Science
    Quantum Information Science Seth Lloyd Professor of Quantum-Mechanical Engineering Director, WM Keck Center for Extreme Quantum Information Theory (xQIT) Massachusetts Institute of Technology Article Outline: Glossary I. Definition of the Subject and Its Importance II. Introduction III. Quantum Mechanics IV. Quantum Computation V. Noise and Errors VI. Quantum Communication VII. Implications and Conclusions 1 Glossary Algorithm: A systematic procedure for solving a problem, frequently implemented as a computer program. Bit: The fundamental unit of information, representing the distinction between two possi- ble states, conventionally called 0 and 1. The word ‘bit’ is also used to refer to a physical system that registers a bit of information. Boolean Algebra: The mathematics of manipulating bits using simple operations such as AND, OR, NOT, and COPY. Communication Channel: A physical system that allows information to be transmitted from one place to another. Computer: A device for processing information. A digital computer uses Boolean algebra (q.v.) to processes information in the form of bits. Cryptography: The science and technique of encoding information in a secret form. The process of encoding is called encryption, and a system for encoding and decoding is called a cipher. A key is a piece of information used for encoding or decoding. Public-key cryptography operates using a public key by which information is encrypted, and a separate private key by which the encrypted message is decoded. Decoherence: A peculiarly quantum form of noise that has no classical analog. Decoherence destroys quantum superpositions and is the most important and ubiquitous form of noise in quantum computers and quantum communication channels.
    [Show full text]
  • On the Complementary Quantum Capacity of the Depolarizing Channel
    On the complementary quantum capacity of the depolarizing channel Debbie Leung1 and John Watrous2 1Institute for Quantum Computing and Department of Combinatorics and Optimization, University of Waterloo 2Institute for Quantum Computing and School of Computer Science, University of Waterloo October 2, 2018 The qubit depolarizing channel with noise parameter η transmits an input qubit perfectly with probability 1 − η, and outputs the completely mixed state with probability η. We show that its complementary channel has positive quantum capacity for all η > 0. Thus, we find that there exists a single parameter family of channels having the peculiar property of having positive quantum capacity even when the outputs of these channels approach a fixed state independent of the input. Comparisons with other related channels, and implications on the difficulty of studying the quantum capacity of the depolarizing channel are discussed. 1 Introduction It is a fundamental problem in quantum information theory to determine the capacity of quantum channels to transmit quantum information. The quantum capacity of a channel is the optimal rate at which one can transmit quantum data with high fidelity through that channel when an asymptotically large number of channel uses is made available. In the classical setting, the capacity of a classical channel to transmit classical data is given by Shannon’s noisy coding theorem [12]. Although the error correcting codes that allow one to approach the capacity of a channel may involve increasingly large block lengths, the capacity expression itself is a simple, single letter formula involving an optimization over input distributions maximizing the input/output mutual information over one use of the channel.
    [Show full text]
  • Quantum Information Chapter 10. Quantum Shannon Theory
    Quantum Information Chapter 10. Quantum Shannon Theory John Preskill Institute for Quantum Information and Matter California Institute of Technology Updated June 2016 For further updates and additional chapters, see: http://www.theory.caltech.edu/people/preskill/ph219/ Please send corrections to [email protected] Contents 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 2 10.1.1 Shannon entropy and data compression 2 10.1.2 Joint typicality, conditional entropy, and mutual infor- mation 6 10.1.3 Distributed source coding 8 10.1.4 The noisy channel coding theorem 9 10.2 Von Neumann Entropy 16 10.2.1 Mathematical properties of H(ρ) 18 10.2.2 Mixing, measurement, and entropy 20 10.2.3 Strong subadditivity 21 10.2.4 Monotonicity of mutual information 23 10.2.5 Entropy and thermodynamics 24 10.2.6 Bekenstein’s entropy bound. 26 10.2.7 Entropic uncertainty relations 27 10.3 Quantum Source Coding 30 10.3.1 Quantum compression: an example 31 10.3.2 Schumacher compression in general 34 10.4 Entanglement Concentration and Dilution 38 10.5 Quantifying Mixed-State Entanglement 45 10.5.1 Asymptotic irreversibility under LOCC 45 10.5.2 Squashed entanglement 47 10.5.3 Entanglement monogamy 48 10.6 Accessible Information 50 10.6.1 How much can we learn from a measurement? 50 10.6.2 Holevo bound 51 10.6.3 Monotonicity of Holevo χ 53 10.6.4 Improved distinguishability through coding: an example 54 10.6.5 Classical capacity of a quantum channel 58 ii Contents iii 10.6.6 Entanglement-breaking channels 62 10.7 Quantum Channel Capacities and Decoupling
    [Show full text]
  • The Squashed Entanglement of a Quantum Channel
    The squashed entanglement of a quantum channel Masahiro Takeoka∗y Saikat Guhay Mark M. Wildez January 22, 2014 Abstract This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed en- tanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Chri- standl, Winter, et al., establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1 + η)=(1 − η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1=(1 − η)). Thus, in the high-loss regime for which η 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.
    [Show full text]
  • Quantum Channel Capacities
    Quantum Channel Capacities Graeme Smith IBM TJ Watson Research Center 1101 Kitchawan Road Yorktown NY 10598 [email protected] Abstract—A quantum communication channel can be put to must consider the quantum capacity of our channel, and if we many uses: it can transmit classical information, private classical have access to arbitrary quantum correlations between sender information, or quantum information. It can be used alone, with and receiver the relevant capacity is the entanglement assisted shared entanglement, or together with other channels. For each of these settings there is a capacity that quantifies a channel’s capacity. In general, these capacities are all different, which potential for communication. In this short review, I summarize gives a variety of inequivalent ways to quantify the value of what is known about the various capacities of a quantum channel, a quantum channel for communication. including a discussion of the relevant additivity questions. I The communication capacities of a quantum channel are also give some indication of potentially interesting directions for not nearly as well understood as their classical counterparts, future research. and many basic questions about quantum capacities remain open. The purpose of this paper is to give an introduction to a I. INTRODUCTION quantum channel’s capacities, summarize what we know about The capacity of a noisy communication channel for noise- them, and point towards some important unsolved problems. less information transmission is a central quantity in the study of information theory [1]. This capacity establishes the II. QUANTUM STATES AND CHANNELS ultimate boundary between communication rates which are The states of least uncertainty in quantum mechanics are achievable in principle and those which are not.
    [Show full text]
  • Reverse Coherent Information
    Reverse Coherent Information Ra´ul Garc´ıa-Patr´on,1 Stefano Pirandola,1 Seth Lloyd,1 and Jeffrey H. Shapiro1 1Research Laboratory of Electronics, MIT, Cambridge, MA 02139 In this letter we define a family of entanglement distribution protocols assisted by feedback clas- sical communication that gives an operational interpretation to reverse coherent information, i.e., the symmetric counterpart of the well known coherent information. This lead to the definition of a new entanglement distribution capacity that exceeds the unassisted capacity for some interesting channels. PACS numbers: 03.67.-a, 03.67.Hk Shannon’s great result was proving that sending in- The channel Λ is called degradable if there exists a formation through a noisy channel can be achieved map that transforms Bob’s output ρ into the en- N M B with vanishing error, in the limit of many uses of the vironment state ρE, i.e., (ρB) = ρE, where ρE = channel [1]. Shannon’s key idea was to add redundancy Tr [ φ φ ] and φ M is the purification of ρ . RB | ih |RBE | iRBE RB to the message in order to compensate for the channel’s Similarly if there is a map such that (ρE) = ρB the noise. He showed that the channel’s communication ca- channel is called antidegradableG and (Λ)G = 0. pacity ( ) between two partners, called Alice and Bob, Having free access to a classical communicationQ chan- is givenC byN the maximal mutual information between Al- nel Alice and Bob can improve the quantum communi- ice’s input a and Bob’s output b = (a), i.e., cation protocol, as opposed to Shannon’s theory where N using feedback gives no improvement [7].
    [Show full text]
  • Quantum Information Can Be Negative
    Quantum information can be negative Michal Horodecki1, Jonathan Oppenheim 2 & Andreas Winter3 1Institute of Theoretical Physics and Astrophysics, University of Gda´nsk, 80–952 Gda´nsk, Poland 2Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cam- bridge CB3 0WA, U.K. 3Department of Mathematics, University of Bristol, Bristol BS8 1TW, U.K. Submitted Feb. 20th, 2005 Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communica- tion measures the partial information one system needs conditioned on it’s prior information. It turns out to be given by an extremely simple formula, the conditional entropy. In the classi- cal case, partial information must always be positive, but we find that in the quantum world this physical quantity can be negative. If the partial information is positive, its sender needs to communicate this number of quantum bits to the receiver; if it is negative, the sender and receiver instead gain the corresponding potential for future quantum communication. We in- troduce a primitive quantum state merging which optimally transfers partial information. We show how it enables a systematic understanding of quantum network theory, and discuss sev- eral important applications including distributed compression, multiple access channels and multipartite assisted entanglement distillation (localizable entanglement). Negative channel capacities also receive a natural interpretation. ’Ignorance is strength’ is one of the three cyn- of information originating from a source is the ical mottos of Big Brother in George Orwell’s memory required to faithfully represent its out- 1984.
    [Show full text]
  • Quantum Entropy and Its Applications to Quantum Communication and Statistical Physics
    Entropy 2010, 12, 1194-1245; doi:10.3390/e12051194 OPEN ACCESS entropy ISSN 1099-4300 www.mdpi.com/journal/entropy Review Quantum Entropy and Its Applications to Quantum Communication and Statistical Physics Masanori Ohya ? and Noboru Watanabe ? Department of Information Sciences, Tokyo University of Science, Noda City, Chiba 278-8510, Japan ? Author to whom correspondence should be addressed; E-Mails: [email protected] (M.O.); [email protected] (N.W.). Received: 10 February 2010 / Accepted: 30 April 2010 / Published: 7 May 2010 Abstract: Quantum entropy is a fundamental concept for quantum information recently developed in various directions. We will review the mathematical aspects of quantum entropy (entropies) and discuss some applications to quantum communication, statistical physics. All topics taken here are somehow related to the quantum entropy that the present authors have been studied. Many other fields recently developed in quantum information theory, such as quantum algorithm, quantum teleportation, quantum cryptography, etc., are totally discussed in the book (reference number 60). Keywords: quantum entropy; quantum information 1. Introduction Theoretical foundation supporting today’s information-oriented society is Information Theory founded by Shannon [1] about 60 years ago. Generally, this theory can treat the efficiency of the information transmission by using measures of complexity, that is, the entropy, in the commutative system of signal space. The information theory is based on the entropy theory that is formulated mathematically. Before Shannon’s work, the entropy was first introduced in thermodynamics by Clausius and in statistical mechanics by Boltzmann. These entropies are the criteria to characterize a property of the physical systems.
    [Show full text]
  • The Critical Points of Coherent Information on the Manifold of Positive Definite Matrices
    The Critical Points of Coherent Information on the Manifold of Positive Definite Matrices by Alireza Tehrani A Thesis presented to The University of Guelph In partial fulfilment of requirements for the degree of Master of Science in Mathematics Guelph, Ontario, Canada c Alireza Tehrani, January, 2020 ABSTRACT THE CRITICAL POINTS OF COHERENT INFORMATION ON THE MANIFOLD OF POSITIVE DEFINITE MATRICES Alireza Tehrani Advisors: University of Guelph, 2020 Dr. Bei Zeng Dr. Rajesh Pereira The coherent information of quantum channels plays a important role in quantum infor- mation theory as it can be used to calculate the quantum capacity of a channel. However, it is a non-linear, non-differentiable optimization problem. This thesis discusses that by restricting to the space of positive definite density matrices and restricting the class of quan- tum channels to be strictly positive, the coherent information becomes differentiable. This allows the computation of the Riemannian gradient and Hessian of the coherent information. It will be shown that the maximally mixed state is a critical point for the n-shot coherent information of the Pauli, dephrasure and Pauli-erasure channels. In addition, the classifica- tion of the maximally mixed state as a local maxima/minima and saddle-point will be solved for the one shot coherent information. The hope of this work is to provide a new avenue to explore the quantum capacity problem. Dedication To those who have inspired or encouraged me: Brother, Father, Randy, Farnaz and Paul. iii Acknowledgements I want to express my gratitude and thanks to Dr. Zeng for the guidance, advice and direction that was provided and for giving me the opportunity to work in quantum information theory and to be part of IQC and the Peng Cheng Laborotory.
    [Show full text]
  • Quantum Information Chapter 10. Quantum Shannon Theory
    Quantum Information Chapter 10. Quantum Shannon Theory John Preskill Institute for Quantum Information and Matter California Institute of Technology Updated January 2018 For further updates and additional chapters, see: http://www.theory.caltech.edu/people/preskill/ph219/ Please send corrections to [email protected] Contents page v Preface vi 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 1 10.1.1Shannonentropyanddatacompression 2 10.1.2 Joint typicality, conditional entropy, and mutual information 4 10.1.3 Distributed source coding 6 10.1.4 The noisy channel coding theorem 7 10.2 Von Neumann Entropy 12 10.2.1 Mathematical properties of H(ρ) 14 10.2.2Mixing,measurement,andentropy 15 10.2.3 Strong subadditivity 16 10.2.4Monotonicityofmutualinformation 18 10.2.5Entropyandthermodynamics 19 10.2.6 Bekenstein’s entropy bound. 20 10.2.7Entropicuncertaintyrelations 21 10.3 Quantum Source Coding 23 10.3.1Quantumcompression:anexample 24 10.3.2 Schumacher compression in general 27 10.4 EntanglementConcentrationandDilution 30 10.5 QuantifyingMixed-StateEntanglement 35 10.5.1 AsymptoticirreversibilityunderLOCC 35 10.5.2 Squashed entanglement 37 10.5.3 Entanglement monogamy 38 10.6 Accessible Information 39 10.6.1 Howmuchcanwelearnfromameasurement? 39 10.6.2 Holevo bound 40 10.6.3 Monotonicity of Holevo χ 41 10.6.4 Improved distinguishability through coding: an example 42 10.6.5 Classicalcapacityofaquantumchannel 45 10.6.6 Entanglement-breaking channels 49 10.7 Quantum Channel Capacities and Decoupling 50 10.7.1 Coherent information and the
    [Show full text]