DOCSLIB.ORG

Leaking Information to Gain Entanglement Via Log-Singularities

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Leaking Information to Gain Entanglement Via Log-Singularities Leaking information to gain entanglement via log-singularities Vikesh Siddhu Feb 1, 2021, QIP 2021 JILA, CU Boulder Formerly at Carnegie Mellon University arXiv:2003.10367 (log-singularity) arXiv:2011.15116 (Leakage) Theoretical interest and practical need to protecting entanglement from noise • When, at what rate, and by what means can noisy entanglement be distilled back? Fertile ground for exchange of research ideas • Use and make contributions to Shannon Theory, Error-correction, Optimization theory,... What care about it? Entanglement is a fundamental non-classical phenomenon • Would be nice to understand and harness in experiments and real-world applications 1 Fertile ground for exchange of research ideas • Use and make contributions to Shannon Theory, Error-correction, Optimization theory,... What care about it? Entanglement is a fundamental non-classical phenomenon • Would be nice to understand and harness in experiments and real-world applications Theoretical interest and practical need to protecting entanglement from noise • When, at what rate, and by what means can noisy entanglement be distilled back? 1 What care about it? Entanglement is a fundamental non-classical phenomenon • Would be nice to understand and harness in experiments and real-world applications Theoretical interest and practical need to protecting entanglement from noise • When, at what rate, and by what means can noisy entanglement be distilled back? Fertile ground for exchange of research ideas • Use and make contributions to Shannon Theory, Error-correction, Optimization theory,... 1 New ideas that help find state-of-the-art rates for protecting entanglement from noise • Theoretical tool: Singularity in the von-Neumann entropy gives rise to positivity and • non-additivity in rates for protecting entanglement Conceptual surprise: Allowing a noisy channel to leak quantum information to its • environment can boosts its ability to protect entanglement. What we found 2 Theoretical tool: Singularity in the von-Neumann entropy gives rise to positivity and • non-additivity in rates for protecting entanglement Conceptual surprise: Allowing a noisy channel to leak quantum information to its • environment can boosts its ability to protect entanglement. What we found New ideas that help find state-of-the-art rates for protecting entanglement from noise • 2 Conceptual surprise: Allowing a noisy channel to leak quantum information to its • environment can boosts its ability to protect entanglement. What we found New ideas that help find state-of-the-art rates for protecting entanglement from noise • Theoretical tool: Singularity in the von-Neumann entropy gives rise to positivity and • non-additivity in rates for protecting entanglement 2 What we found New ideas that help find state-of-the-art rates for protecting entanglement from noise • Theoretical tool: Singularity in the von-Neumann entropy gives rise to positivity and • non-additivity in rates for protecting entanglement Conceptual surprise: Allowing a noisy channel to leak quantum information to its • environment can boosts its ability to protect entanglement. 2 Asymptotic Quantum Capacity Q( ) = max S B Protection of entanglement can be quantified R R H H RA φRA B A (n) n (n) A H E D H B (n) (k) E encodes and D decodes nS qubits of any RA with vanishing error as n 7! 1 S is an achievable rate for protecting entanglement 3 Protection of entanglement can be quantified R R H H RA φRA B A (n) n (n) A H E D H B (n) (k) E encodes and D decodes nS qubits of any RA with vanishing error as n 7! 1 S is an achievable rate for protecting entanglement Asymptotic Quantum Capacity Q( ) = max S B 3 Sending quantum information and performing quantum error-correction An achievable lower bound on rates for quantum key distribution • Achievable rates and quantum capacity are a fundamental quantities Information theoretic rates for • Preserving entanglement (read distilling EPR pairs) 4 An achievable lower bound on rates for quantum key distribution • Achievable rates and quantum capacity are a fundamental quantities Information theoretic rates for • Preserving entanglement (read distilling EPR pairs) Sending quantum information and performing quantum error-correction 4 Achievable rates and quantum capacity are a fundamental quantities Information theoretic rates for • Preserving entanglement (read distilling EPR pairs) Sending quantum information and performing quantum error-correction An achievable lower bound on rates for quantum key distribution • 4 1. Classical Channel - : i.e. p(y x) N X 7! Y j X Shannon entropy: H(X ) = p(x) log p(x) − x2X Mutual Information: I (X ; Y ) = H(X ) + H(Y ) H(X ; Y ) − Channel Mutual Information: C (1)( ) = max I (X ; Y ) N p(x) 2. Quantum Channel - : a b B 7! von-Neumann entropy: S(a) = Tr(ρa log ρa) − Coherent Information: ∆( ; ρa) = S(b) S(c) B − (1) Channel Coherent Information: Q ( ) = max ∆( ; ρa) B ρa B Shannon like recipe for finding an achievable rate 5 X Shannon entropy: H(X ) = p(x) log p(x) − x2X Mutual Information: I (X ; Y ) = H(X ) + H(Y ) H(X ; Y ) − Channel Mutual Information: C (1)( ) = max I (X ; Y ) N p(x) 2. Quantum Channel - : a b B 7! von-Neumann entropy: S(a) = Tr(ρa log ρa) − Coherent Information: ∆( ; ρa) = S(b) S(c) B − (1) Channel Coherent Information: Q ( ) = max ∆( ; ρa) B ρa B Shannon like recipe for finding an achievable rate 1. Classical Channel - : i.e. p(y x) N X 7! Y j 5 2. Quantum Channel - : a b B 7! von-Neumann entropy: S(a) = Tr(ρa log ρa) − Coherent Information: ∆( ; ρa) = S(b) S(c) B − (1) Channel Coherent Information: Q ( ) = max ∆( ; ρa) B ρa B Shannon like recipe for finding an achievable rate 1. Classical Channel - : i.e. p(y x) N X 7! Y j X Shannon entropy: H(X ) = p(x) log p(x) − x2X Mutual Information: I (X ; Y ) = H(X ) + H(Y ) H(X ; Y ) − Channel Mutual Information: C (1)( ) = max I (X ; Y ) N p(x) 5 von-Neumann entropy: S(a) = Tr(ρa log ρa) − Coherent Information: ∆( ; ρa) = S(b) S(c) B − (1) Channel Coherent Information: Q ( ) = max ∆( ; ρa) B ρa B Shannon like recipe for finding an achievable rate 1. Classical Channel - : i.e. p(y x) N X 7! Y j X Shannon entropy: H(X ) = p(x) log p(x) − x2X Mutual Information: I (X ; Y ) = H(X ) + H(Y ) H(X ; Y ) − Channel Mutual Information: C (1)( ) = max I (X ; Y ) N p(x) 2. Quantum Channel - : a b B 7! 5 Shannon like recipe for finding an achievable rate 1. Classical Channel - : i.e. p(y x) N X 7! Y j X Shannon entropy: H(X ) = p(x) log p(x) − x2X Mutual Information: I (X ; Y ) = H(X ) + H(Y ) H(X ; Y ) − Channel Mutual Information: C (1)( ) = max I (X ; Y ) N p(x) 2. Quantum Channel - : a b B 7! von-Neumann entropy: S(a) = Tr(ρa log ρa) − Coherent Information: ∆( ; ρa) = S(b) S(c) B − (1) Channel Coherent Information: Q ( ) = max ∆( ; ρa) B ρa B 5 1. Classical channel Additivity: C (1)( 0) = C (1)( ) + C (1)( 0) N × N N N Channel Capacity: C( ) = lim C (1)( ×k )=k = C (1)( ) N k7!1 N N Joint Channel Capacity: C( 0) = C( ) + C( 0) N × N N N 2. Quantum channel Non-Additivity: Q(1)( 0) Q(1)( ) + Q(1)( 0) B ⊗ B ≥ B B Quantum Capacity: Q( ) = lim Q(1)( ⊗k )=k Q(1)( ) B k7!1 B ≥ B Joint Quantum Capacity: Q( 0) Q( ) + Q( 0) B ⊗ B ≥ B B The inequalities can be strict Shannon like recipe for finding channel capacity 6 2. Quantum channel Non-Additivity: Q(1)( 0) Q(1)( ) + Q(1)( 0) B ⊗ B ≥ B B Quantum Capacity: Q( ) = lim Q(1)( ⊗k )=k Q(1)( ) B k7!1 B ≥ B Joint Quantum Capacity: Q( 0) Q( ) + Q( 0) B ⊗ B ≥ B B The inequalities can be strict Shannon like recipe for finding channel capacity 1. Classical channel Additivity: C (1)( 0) = C (1)( ) + C (1)( 0) N × N N N Channel Capacity: C( ) = lim C (1)( ×k )=k = C (1)( ) N k7!1 N N Joint Channel Capacity: C( 0) = C( ) + C( 0) N × N N N 6 Shannon like recipe for finding channel capacity 1. Classical channel Additivity: C (1)( 0) = C (1)( ) + C (1)( 0) N × N N N Channel Capacity: C( ) = lim C (1)( ×k )=k = C (1)( ) N k7!1 N N Joint Channel Capacity: C( 0) = C( ) + C( 0) N × N N N 2. Quantum channel Non-Additivity: Q(1)( 0) Q(1)( ) + Q(1)( 0) B ⊗ B ≥ B B Quantum Capacity: Q( ) = lim Q(1)( ⊗k )=k Q(1)( ) B k7!1 B ≥ B Joint Quantum Capacity: Q( 0) Q( ) + Q( 0) B ⊗ B ≥ B B The inequalities can be strict 6 Quantum Capacity ( ) = lim (1)( ⊗k )=k: Q B k7!1 Q B Question : Given a channel is Q( ) > 0? B B Answer : Hard to say, for all n > 1 there is some s.t. B (1)( ⊗n) = 0 but (1)( ⊗n+1) > 0 Q B Q B Question : If ( ) = 0 then is useless? Q B B Answer : Not really, one can have ( ) = ( 0) = 0 but ( 0) > 0 Q B Q B Q B ⊗ B Question : When and why are (1) and non-additive? Q Q Answer : Some examples, but much is unknown Non-additivity introduces some challenges 7 Question : Given a channel is Q( ) > 0? B B Answer : Hard to say, for all n > 1 there is some s.t. B (1)( ⊗n) = 0 but (1)( ⊗n+1) > 0 Q B Q B Question : If ( ) = 0 then is useless? Q B B Answer : Not really, one can have ( ) = ( 0) = 0 but ( 0) > 0 Q B Q B Q B ⊗ B Question : When and why are (1) and non-additive? Q Q Answer : Some examples, but much is unknown Non-additivity introduces some challenges Quantum Capacity ( ) = lim (1)( ⊗k )=k: Q B k7!1 Q B 7 Answer : Hard to say, for all n > 1 there is some s.t.
Load more

Recommended publications
  • Pilot Quantum Error Correction for Global
    Pilot Quantum Error Correction for Global- Scale Quantum Communications Laszlo Gyongyosi*1,2, Member, IEEE, Sandor Imre1, Member, IEEE 1Quantum Technologies Laboratory, Department of Telecommunications Budapest University of Technology and Economics 2 Magyar tudosok krt, H-1111, Budapest, Hungary 2Information Systems Research Group, Mathematics and Natural Sciences Hungarian Academy of Sciences H-1518, Budapest, Hungary *[email protected] Real global-scale quantum communications and quantum key distribution systems cannot be implemented by the current fiber and free-space links. These links have high attenuation, low polarization-preserving capability or extreme sensitivity to the environment. A potential solution to the problem is the space-earth quantum channels. These channels have no absorption since the signal states are propagated in empty space, however a small fraction of these channels is in the atmosphere, which causes slight depolarizing effect. Furthermore, the relative motion of the ground station and the satellite causes a rotation in the polarization of the quantum states. In the current approaches to compensate for these types of polarization errors, high computational costs and extra physical apparatuses are required. Here we introduce a novel approach which breaks with the traditional views of currently developed quantum-error correction schemes. The proposed solution can be applied to fix the polarization errors which are critical in space-earth quantum communication systems. The channel coding scheme provides capacity-achieving communication over slightly depolarizing space-earth channels. I. Introduction Quantum error-correction schemes use different techniques to correct the various possible errors which occur in a quantum channel. In the first decade of the 21st century, many revolutionary properties of quantum channels were discovered [12-16], [19-22] however the efficient error- correction in quantum systems is still a challenge.
    [Show full text]
  • Some Open Problems in Quantum Information Theory
    Some Open Problems in Quantum Information Theory Mary Beth Ruskai∗ Department of Mathematics, Tufts University, Medford, MA 02155 [email protected] June 14, 2007 Abstract Some open questions in quantum information theory (QIT) are described. Most of them were presented in Banff during the BIRS workshop on Operator Structures in QIT 11-16 February 2007. 1 Extreme points of CPT maps In QIT, a channel is represented by a completely-positive trace-preserving (CPT) map Φ: Md1 7→ Md2 , which is often written in the Choi-Kraus form X † X † Φ(ρ) = AkρAk with AkAk = Id1 . (1) k k The state representative or Choi matrix of Φ is 1 X Φ(|βihβ|) = d |ejihek|Φ(|ejihek|) (2) jk where |βi is a maximally entangled Bell state. Choi [3] showed that the Ak can be obtained from the eigenvectors of Φ(|βihβ|) with non-zero eigenvalues. The operators Ak in (1) are known to be defined only up to a partial isometry and are often called Kraus operators. When a minimal set is obtained from Choi’s prescription using eigenvectors of (2), they are defined up to mixing of those from degenerate eigenvalues ∗Partially supported by the National Science Foundation under Grant DMS-0604900 1 and we will refer to them as Choi-Kraus operators. Choi showed that Φ is an extreme † point of the set of CPT maps Φ : Md1 7→ Md2 if and only if the set {AjAk} is linearly independent in Md1 . This implies that the Choi matrix of an extreme CPT map has rank at most d1.
    [Show full text]
  • 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]
  • Capacity Estimates Via Comparison with TRO Channels
    Commun. Math. Phys. 364, 83–121 (2018) Communications in Digital Object Identifier (DOI) https://doi.org/10.1007/s00220-018-3249-y Mathematical Physics Capacity Estimates via Comparison with TRO Channels Li Gao1 , Marius Junge1, Nicholas LaRacuente2 1 Department of Mathematics, University of Illinois, Urbana, IL 61801, USA. E-mail: [email protected]; [email protected] 2 Department of Physics, University of Illinois, Urbana, IL 61801, USA. E-mail: [email protected] Received: 1 November 2017 / Accepted: 27 July 2018 Published online: 8 September 2018 – © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract: A ternary ring of operators (TRO) in finite dimensions is an operator space as an orthogonal sum of rectangular matrices. TROs correspond to quantum channels that are diagonal sums of partial traces, we call TRO channels. TRO channels have simple, single-letter entropy expressions for quantum, private, and classical capacity. Using operator space and interpolation techniques, we perturbatively estimate capacities, capacity regions, and strong converse rates for a wider class of quantum channels by comparison to TRO channels. 1. Introduction Channel capacity, introduced by Shannon in his foundational paper [45], is the ultimate rate at which information can be reliably transmitted over a communication channel. During the last decades, Shannon’s theory on noisy channels has been adapted to the framework of quantum physics. A quantum channel has various capacities depending on different communication tasks, such as quantum capacity for transmitting qubits, and private capacity for transmitting classical bits with physically ensured security. The coding theorems, which characterize these capacities by entropic expressions, were major successes in quantum information theory (see e.g.
    [Show full text]
  • QIP 2010 Tutorial and Scientific Programmes
    QIP 2010 15th – 22nd January, Zürich, Switzerland Tutorial and Scientific Programmes asymptotically large number of channel uses. Such “regularized” formulas tell us Friday, 15th January very little. The purpose of this talk is to give an overview of what we know about 10:00 – 17:10 Jiannis Pachos (Univ. Leeds) this need for regularization, when and why it happens, and what it means. I will Why should anyone care about computing with anyons? focus on the quantum capacity of a quantum channel, which is the case we understand best. This is a short course in topological quantum computation. The topics to be covered include: 1. Introduction to anyons and topological models. 15:00 – 16:55 Daniel Nagaj (Slovak Academy of Sciences) 2. Quantum Double Models. These are stabilizer codes, that can be described Local Hamiltonians in quantum computation very much like quantum error correcting codes. They include the toric code This talk is about two Hamiltonian Complexity questions. First, how hard is it to and various extensions. compute the ground state properties of quantum systems with local Hamiltonians? 3. The Jones polynomials, their relation to anyons and their approximation by Second, which spin systems with time-independent (and perhaps, translationally- quantum algorithms. invariant) local interactions could be used for universal computation? 4. Overview of current state of topological quantum computation and open Aiming at a participant without previous understanding of complexity theory, we will discuss two locally-constrained quantum problems: k-local Hamiltonian and questions. quantum k-SAT. Learning the techniques of Kitaev and others along the way, our first goal is the understanding of QMA-completeness of these problems.
    [Show full text]
  • EU–US Collaboration on Quantum Technologies Emerging Opportunities for Research and Standards-Setting
    Research EU–US collaboration Paper on quantum technologies International Security Programme Emerging opportunities for January 2021 research and standards-setting Martin Everett Chatham House, the Royal Institute of International Affairs, is a world-leading policy institute based in London. Our mission is to help governments and societies build a sustainably secure, prosperous and just world. EU–US collaboration on quantum technologies Emerging opportunities for research and standards-setting Summary — While claims of ‘quantum supremacy’ – where a quantum computer outperforms a classical computer by orders of magnitude – continue to be contested, the security implications of such an achievement have adversely impacted the potential for future partnerships in the field. — Quantum communications infrastructure continues to develop, though technological obstacles remain. The EU has linked development of quantum capacity and capability to its recovery following the COVID-19 pandemic and is expected to make rapid progress through its Quantum Communication Initiative. — Existing dialogue between the EU and US highlights opportunities for collaboration on quantum technologies in the areas of basic scientific research and on communications standards. While the EU Quantum Flagship has already had limited engagement with the US on quantum technology collaboration, greater direct cooperation between EUPOPUSA and the Flagship would improve the prospects of both parties in this field. — Additional support for EU-based researchers and start-ups should be provided where possible – for example, increasing funding for representatives from Europe to attend US-based conferences, while greater investment in EU-based quantum enterprises could mitigate potential ‘brain drain’. — Superconducting qubits remain the most likely basis for a quantum computer. Quantum computers composed of around 50 qubits, as well as a quantum cloud computing service using greater numbers of superconducting qubits, are anticipated to emerge in 2021.
    [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]
  • The Quantum Capacity with Symmetric Side Channels Graeme Smith, John A
    1 The quantum capacity with symmetric side channels Graeme Smith, John A. Smolin and Andreas Winter Abstract— We present an upper bound for the quantum chan- environment-assisted quantum capacity [11], [12]. The multi- nel capacity that is both additive and convex. Our bound can be letter formulas available for the other capacities, including the interpreted as the capacity of a channel for high-fidelity quantum quantum capacity, provide, at best, partial characterizations. communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, For instance, it was shown in [13], [3], [4], [5] that the which we call symmetric side channels, consists of all channels capacity for noiseless quantum communication of a quantum mapping symmetrically to their output and environment. The channel N is given by bound seems to be quite tight, and for degradable quantum chan- nels it coincides with the unassisted channel capacity. Using this 1 ⊗n Q(N ) = lim max I(AiB )! : (1) n!1 AB⊗n symmetric side channel capacity, we find new upper bounds on n jφiA(A0)⊗n the capacity of the depolarizing channel. We also briefly indicate an analogous notion for distilling entanglement using the same In this expression, N is a quantum channel mapping quantum class of (one-way) channels, yielding one of the few entanglement states on the vector space A0 to states on the space B, measures that is monotonic under local operations with one- 0 and jφi 0 ⊗n is a pure quantum state on n copies of A way classical communication (1-LOCC), but not under the more A(A ) general class of local operations with classical communication together with a reference system A.
    [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]
  • Experimental Observation of Coherent-Information Superadditivity in a Dephrasure Channel
    Experimental observation of coherent-information superadditivity in a dephrasure channel 1, 2 1, 2 3, 1, 2 1, 2 1, 2 1, 2 Shang Yu, Yu Meng, Raj B. Patel, ∗ Yi-Tao Wang, Zhi-Jin Ke, Wei Liu, Zhi-Peng Li, 1, 2 1, 2 1, 2, 1, 2, 1, 2 Yuan-Ze Yang, Wen-Hao Zhang, Jian-Shun Tang, † Chuan-Feng Li, ‡ and Guang-Can Guo 1CAS Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei, 230026, China 2CAS Center For Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, 230026, P.R. China 3Clarendon Laboratory, Department of Physics, Oxford University, Parks Road OX1 3PU Oxford, United Kingdom We present an experimental approach to construct a dephrasure channel, which contains both dephasing and erasure noises, and can be used as an efficient tool to study the superadditivity of coherent information. By using a three-fold dephrasure channel, the superadditivity of coherent information is observed, and a substantial gap is found between the zero single-letter coherent information and zero quantum capacity. Particularly, we find that when the coherent information of n channel uses is zero, in the case of larger number of channel uses, it will become positive. These phenomena exhibit a more obvious superadditivity of coherent information than previous works, and demonstrate a higher threshold for non-zero quantum capacity. Such novel channels built in our experiment also can provide a useful platform to study the non-additive properties of coherent information and quantum channel capacity. Introduction.—Channel capacity is at the heart of in- capacity [16, 17].
    [Show full text]