Squashed entanglement

Similar documents
arxiv: v1 [quant-ph] 3 Jan 2008

Entanglement Measures and Monotones

Asymptotic Pure State Transformations

Compression and entanglement, entanglement transformations

Instantaneous Nonlocal Measurements

Quantum Teleportation Pt. 1

Lecture: Quantum Information

Quantum Teleportation Pt. 3

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

Entanglement: concept, measures and open problems

Entanglement and Quantum Teleportation

Entanglement: Definition, Purification and measures

Strong converse theorems using Rényi entropies

Lecture 6: Quantum error correction and quantum capacity

Degradable Quantum Channels

Bound entangled states with secret key and their classical counterpart

Lecture 4: Postulates of quantum mechanics

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

Entanglement Manipulation

Single qubit + CNOT gates

Max-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig

Transmitting and Hiding Quantum Information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Theory of Quantum Entanglement

The Minimax Fidelity for Quantum Channels: Theory and Some Applications

Lecture 19 October 28, 2015

Monogamy, Polygamy and other Properties of Entanglement of Purification

Entanglement and information

Maximal Entanglement A New Measure of Entanglement

THE fundamental physical resource for performing various

CS/Ph120 Homework 4 Solutions

Ping Pong Protocol & Auto-compensation

Problem Set: TT Quantum Information

arxiv: v2 [quant-ph] 21 Oct 2013

Group representations and quantum information theory. Aram Harrow (Bristol) NII, Tokyo 5 Feb, 2007

Fundamental rate-loss tradeoff for optical quantum key distribution

How much entanglement is lost along a channel? TQC 2008, 30 Jan 2008

Quantum Dense Coding and Quantum Teleportation

Supplementary Information

A Holevo-type bound for a Hilbert Schmidt distance measure

Quantum information and quantum computing

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Entanglement Measures and Monotones Pt. 2

Lecture 11 September 30, 2015

Quantum Correlations as Necessary Precondition for Secure Communication

Quantum key distribution for the lazy and careless

Probabilistic exact cloning and probabilistic no-signalling. Abstract

1. Basic rules of quantum mechanics

Quantum Information Theory

Single-shot Quantum State Merging

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

CS120, Quantum Cryptography, Fall 2016

Converse bounds for private communication over quantum channels

Ph 219/CS 219. Exercises Due: Friday 20 October 2006

Efficient achievability for quantum protocols using decoupling theorems

Introduction to Quantum Key Distribution

Quantum sampling of mixed states

Lecture 20: Bell inequalities and nonlocality

Strong converse theorems using Rényi entropies

Information-theoretic treatment of tripartite systems and quantum channels. Patrick Coles Carnegie Mellon University Pittsburgh, PA USA

Quantum Gates, Circuits & Teleportation

Lecture 11: Quantum Information III - Source Coding

Trading classical communication, quantum communication, and entanglement in quantum Shannon theory

Introduction to Quantum Information Hermann Kampermann

Time Reversal and Exchange Symmetries of Unitary Gate Capacities

Homework 3 - Solutions

Entanglement and non-locality of pure quantum states

Some Bipartite States Do Not Arise from Channels

On the Relation between Quantum Discord and Purified Entanglement

CS286.2 Lecture 15: Tsirelson s characterization of XOR games

5. Communication resources

b) (5 points) Give a simple quantum circuit that transforms the state

Introduction To Information Theory

Other Topics in Quantum Information

arxiv:quant-ph/ v1 13 Jan 2003

arxiv:quant-ph/ v1 28 Oct 2003

arxiv:quant-ph/ May 2002

Private quantum subsystems and error correction

Quantum Entanglement- Fundamental Aspects

arxiv:quant-ph/ v1 9 May 2005

Grothendieck Inequalities, XOR games, and Communication Complexity

The first law of general quantum resource theories

Distinguishing multi-partite states by local measurements

Distinguishing multi-partite states by local measurements

Channel Steering. Marco Piani 1, 2. University of Waterloo, N2L 3G1 Waterloo ON, Canada. compiled: December 23, 2014

The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

Lecture 2: Quantum bit commitment and authentication

Cryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1

arxiv:quant-ph/ v1 6 Dec 2005

Lecture Notes. Quantum Cryptography Week 2: The Power of Entanglement

arxiv:quant-ph/ v1 5 Nov 2006

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

arxiv: v2 [quant-ph] 26 Mar 2012

arxiv: v2 [quant-ph] 16 Nov 2018

arxiv: v7 [quant-ph] 20 Mar 2017

Entropy in Classical and Quantum Information Theory

arxiv:quant-ph/ v2 17 Sep 2002

Quantum Entanglement: Detection, Classification, and Quantification

Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel

Transcription:

Squashed Entanglement based on Squashed Entanglement - An Additive Entanglement Measure (M. Christandl, A. Winter, quant-ph/0308088), and A paradigm for entanglement theory based on quantum communication (J. Oppenheim arxiv:0801.0458)

(Classical) intrinsic information The intrinsic information between two random variables X, Y, given a third r.v. Z, is given by I (X ; Y Z) := inf(i (X ; Y Z)) Z with Z governed by a conditional probability distribution P Z Z. Idea: two parties have access to X and Y, and want to generate a secret key even if an adversary has access to some additional knowledge (Z).

(Classical) intrinsic information The intrinsic information between two random variables X, Y, given a third r.v. Z, is given by I (X ; Y Z) := inf(i (X ; Y Z)) Z with Z governed by a conditional probability distribution P Z Z. Idea: two parties have access to X and Y, and want to generate a secret key even if an adversary has access to some additional knowledge (Z). Mauer, Wolf 1999: The intrinsic information upper-bounds the rate at which the key can be extracted.

A quantum analogue (Christandl, Winter, quant-ph/0308088) Replace classical mutual conditional infos with quantum, P Z Z with quantum channel: E sq (ρ AB ) = ( ) 1 inf Λ:B(H C ) B(H E ) 2 I (A; B E) : ρabe = (id Λ) Ψ Ψ ABC Here, Ψ ABC is a purification of ρ AB, and ρ ABE is simply a tripartite extension; ρ AB = Tr E (ρ ABE ).

A quantum analogue (Christandl, Winter, quant-ph/0308088) Replace classical mutual conditional infos with quantum, P Z Z with quantum channel: E sq (ρ AB ) = ( ) 1 inf Λ:B(H C ) B(H E ) 2 I (A; B E) : ρabe = (id Λ) Ψ Ψ ABC Here, Ψ ABC is a purification of ρ AB, and ρ ABE is simply a tripartite extension; ρ AB = Tr E (ρ ABE ). E sq (ρ AB ) is the squashed entanglement.

Equivalently, ( ) 1 E sq (ρ AB ) = inf ρ ABE 2 I (A; B E) : Tr E (ρ ABE ) = ρ AB (equivalence follows by the equivalence of purifications up to a unitary map)

Equivalently, ( ) 1 E sq (ρ AB ) = inf ρ ABE 2 I (A; B E) : Tr E (ρ ABE ) = ρ AB (equivalence follows by the equivalence of purifications up to a unitary map) Sanity check: If ρ AB = ψ ψ AB, all tripartite extensions are given by ρ AB ρ E, so E sq (ρ AB ) = S(ρ A ) = E( ψ ).

Some basic properties E sq has basic properties we want in an entanglement measure, e.g.:

Some basic properties E sq has basic properties we want in an entanglement measure, e.g.: does not increase under LOCC is convex is continuous (by Alicki-Fannes theorem, quant-ph/0312081 [or Lecture 10])

Some basic properties E sq has basic properties we want in an entanglement measure, e.g.: does not increase under LOCC is convex is continuous (by Alicki-Fannes theorem, quant-ph/0312081 [or Lecture 10]) It s also superadditive, and additive on tensor products.

Relations to other entanglement measures Recall that the intrinsic information upper-bounds the rate at which the key can be extracted given an adversary has access to some information.

Relations to other entanglement measures Recall that the intrinsic information upper-bounds the rate at which the key can be extracted given an adversary has access to some information. Prop. E D (ρ AB ) E sq (ρ AB ), where E D is the distillable entanglement. (Recall E D (ρ) is the limiting ratio n/m of n Bell pairs created from m copies of ρ with LOCC.)

Relations to other entanglement measures Recall that the intrinsic information upper-bounds the rate at which the key can be extracted given an adversary has access to some information. Prop. E D (ρ AB ) E sq (ρ AB ), where E D is the distillable entanglement. (Recall E D (ρ) is the limiting ratio n/m of n Bell pairs created from m copies of ρ with LOCC.) The squashed entanglement is an analogous upper-bound (viewing maximally entangled states as secret quantum correlations).

Proof sketch: E D (ρ AB ) E sq (ρ AB ) Start with an arbitrary distillation protocol, taking (ρ AB ) n LOCC Ψ AB such that Ψ AB k k AB 1 ε, where k is a rank-k maximally entangled state.

Proof sketch: E D (ρ AB ) E sq (ρ AB ) Start with an arbitrary distillation protocol, taking (ρ AB ) n LOCC Ψ AB such that Ψ AB k k AB 1 ε, where k is a rank-k maximally entangled state. By superadditivity and monotonicity under LOCC, ne sq (ρ AB ) E sq (Ψ AB ).

Proof sketch: E D (ρ AB ) E sq (ρ AB ) Start with an arbitrary distillation protocol, taking (ρ AB ) n LOCC Ψ AB such that Ψ AB k k AB 1 ε, where k is a rank-k maximally entangled state. By superadditivity and monotonicity under LOCC, ne sq (ρ AB ) E sq (Ψ AB ). Note E sq ( k k ) = log k (since k is maximally entangled), and using Fannes inequality, one can show that for any extension Ψ ABE, 1 2I (A; B E) log k f (ɛ) log(k) for some function f with lim ɛ 0 f (ɛ) = 0.

Proof sketch: E D (ρ AB ) E sq (ρ AB ) Start with an arbitrary distillation protocol, taking (ρ AB ) n LOCC Ψ AB such that Ψ AB k k AB 1 ε, where k is a rank-k maximally entangled state. By superadditivity and monotonicity under LOCC, ne sq (ρ AB ) E sq (Ψ AB ). Note E sq ( k k ) = log k (since k is maximally entangled), and using Fannes inequality, one can show that for any extension Ψ ABE, 1 2I (A; B E) log k f (ɛ) log(k) for some function f with lim ɛ 0 f (ɛ) = 0. Hence E sq (ρ AB ) 1 n (1 f (ɛ)) log k.

Relations to other entanglement measures Recall that the entanglement of formation is given by E F (ρ AB ) = inf ρ= p i E( ψ i ) = inf 1 p i I ( ψ i A ; ψ i B ) i p i ψ i ψ i 2 i i

Relations to other entanglement measures Recall that the entanglement of formation is given by E F (ρ AB ) = inf ρ= p i E( ψ i ) = inf 1 p i I ( ψ i A ; ψ i B ) i p i ψ i ψ i 2 Consider the following extension i i ρ ABE = i p i ψ i ψ i AB i i E

Relations to other entanglement measures Recall that the entanglement of formation is given by E F (ρ AB ) = inf ρ= p i E( ψ i ) = inf 1 p i I ( ψ i A ; ψ i B ) i p i ψ i ψ i 2 Consider the following extension i i ρ ABE = i p i ψ i ψ i AB i i E Then 1 2 i p i I ( ψ i A ; ψ i B ) = 1 I (A; B E). 2

Relations to other entanglement measures Hence the entanglement of formation can be thought of as the infinum of I (A; B E) over a certain type of tripartite extensions.

Relations to other entanglement measures Hence the entanglement of formation can be thought of as the infinum of I (A; B E) over a certain type of tripartite extensions. It follows that E sq (ρ AB ) E F (ρ AB ).

Relations to other entanglement measures Hence the entanglement of formation can be thought of as the infinum of I (A; B E) over a certain type of tripartite extensions. It follows that E sq (ρ AB ) E F (ρ AB ). Invoking additivity, the entanglement cost E C (ρ AB 1 ) = lim n n E F ((ρ AB ) n ) is also bounded below by E sq (ρ AB ).

Another interpretation of squashed entanglement (Oppenheim, arxiv:0801.0458) Suppose Alice and Bob share a state ρ AB, and Alice wants to send her part to Eve. How many qubits does she need? We allow Alice and Eve to have as much side information (e.g., ancillas) as they like.

Another interpretation of squashed entanglement (Oppenheim, arxiv:0801.0458) Suppose Alice and Bob share a state ρ AB, and Alice wants to send her part to Eve. How many qubits does she need? We allow Alice and Eve to have as much side information (e.g., ancillas) as they like. However, the amount of useful information is limited, since Alice s share of the state may be entangled with Bob s.

Another interpretation of squashed entanglement (Oppenheim, arxiv:0801.0458) Suppose Alice and Bob share a state ρ AB, and Alice wants to send her part to Eve. How many qubits does she need? We allow Alice and Eve to have as much side information (e.g., ancillas) as they like. However, the amount of useful information is limited, since Alice s share of the state may be entangled with Bob s. Let Q A E (ρ AB ) be the rate of communication required to send ρ A to a receiver who holds ρ C, with ρ A held by the sender.

State redistribution and merging (Oppenheim, arxiv:0805.1065, and Lecture 16) Using state merging, the minimum amount of quantum communication required is Q A C = 1 I (A : B C) 2 E (entanglement) = 1 2 I (A : A ) 1 I (A : C) 2

State redistribution and merging (Oppenheim, arxiv:0805.1065, and Lecture 16) Using state merging, the minimum amount of quantum communication required is Q A C = 1 I (A : B C) 2 E (entanglement) = 1 2 I (A : A ) 1 I (A : C) 2 To clear up some confusion: in terms of the merging mother protocol, Bob is the reference here.

Back to squashed entanglement Allowing arbitrary side information, the entanglement E is certainly attainable.

Back to squashed entanglement Allowing arbitrary side information, the entanglement E is certainly attainable. So, let ρ S be the side information shared between Alice and Eve (so that ρ ABS is pure), with Alice s share being ρ A and Eve s ρ C.

Back to squashed entanglement Allowing arbitrary side information, the entanglement E is certainly attainable. So, let ρ S be the side information shared between Alice and Eve (so that ρ ABS is pure), with Alice s share being ρ A and Eve s ρ C. Then inf Q A ρ C = inf A C ρ A C 1 I (A : B C) 2 = inf Λ:B(S) B(C) = E sq (ρ AB ) 1 I (A : B Λ(S)) 2

Back to squashed entanglement Allowing arbitrary side information, the entanglement E is certainly attainable. So, let ρ S be the side information shared between Alice and Eve (so that ρ ABS is pure), with Alice s share being ρ A and Eve s ρ C. Then inf Q A ρ C = inf A C ρ A C 1 I (A : B C) 2 = inf Λ:B(S) B(C) = E sq (ρ AB ) 1 I (A : B Λ(S)) 2 So the squashed entanglement is the fastest rate Alice can send a state to Eve given arbitrary side information.

Sanity check If ρ AB = ψ ψ, E sq (ρ(ab)) = E( ψ ). Likewise, any pure state extension ρ ABS must have S completely uncorrelated with AB.

Sanity check If ρ AB = ψ ψ, E sq (ρ(ab)) = E( ψ ). Likewise, any pure state extension ρ ABS must have S completely uncorrelated with AB. If Alice and Bob share a separable state ρ AB, written as a convex combination of separable pure states, E sq (ρ AB ) = 0:

Sanity check If ρ AB = ψ ψ, E sq (ρ(ab)) = E( ψ ). Likewise, any pure state extension ρ ABS must have S completely uncorrelated with AB. If Alice and Bob share a separable state ρ AB, written as a convex combination of separable pure states, E sq (ρ AB ) = 0: The extension ρ ABE = i p i ψ i ψ i A φ i φ i B i i E has zero quantum conditional mutual information.

Sanity check If ρ AB = ψ ψ, E sq (ρ(ab)) = E( ψ ). Likewise, any pure state extension ρ ABS must have S completely uncorrelated with AB. If Alice and Bob share a separable state ρ AB, written as a convex combination of separable pure states, E sq (ρ AB ) = 0: The extension ρ ABE = i p i ψ i ψ i A φ i φ i B i i E has zero quantum conditional mutual information. Of course, the rate also vanishes - teleportation does the trick.

Why squashed entanglement?

Why squashed entanglement? Christandl and Winter: Our name for this functional comes from the idea that the right choice of a conditioning system reduces the quantum mutual information between A and B, thus squashing out the nonquantum correlations.

Why squashed entanglement? Christandl and Winter: Our name for this functional comes from the idea that the right choice of a conditioning system reduces the quantum mutual information between A and B, thus squashing out the nonquantum correlations. Oppenheim defines the puffed entanglement as the supremum of I (A : B E) over all extensions E, with the operational interpretation of the rate required given the side information is as useless as possible.

Thank you! Questions?