Distinguishing multi-partite states by local measurements

Size: px
Start display at page:

Download "Distinguishing multi-partite states by local measurements"

Transcription

1 Distinguishing multi-partite states by local measurements Guillaume Aubrun / Andreas Winter Université Claude Bernard Lyon 1 / Universitat Autònoma de Barcelona Cécilia Lancien UCBL1 / UAB Madrid OA and QI - June 17 th 2013 Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

2 Outline 1 Introduction 2 Distinguishability norm associated with a single local measurement on a multi-partite system 3 Distinguishability norm associated with whole classes of locally restricted measurements on a multi-partite system 4 Conclusion and open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

3 Outline 1 Introduction 2 Distinguishability norm associated with a single local measurement on a multi-partite system 3 Distinguishability norm associated with whole classes of locally restricted measurements on a multi-partite system 4 Conclusion and open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

4 Distinguishability norms (1) Situation considered System that can be in 2 quantum states, ρ or σ, with respective prior probabilities q and 1 q. Decide in which one it is most likely, based on accessible experimental data, i.e. on the outcomes of a POVM( M = (M x ) x X performed on it. ) Probability of error : P E = 1 ( (qρ ) ) 1 Tr (1 q)σ Mx 2 x X Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

5 Distinguishability norms (1) Situation considered System that can be in 2 quantum states, ρ or σ, with respective prior probabilities q and 1 q. Decide in which one it is most likely, based on accessible experimental data, i.e. on the outcomes of a POVM( M = (M x ) x X performed on it. ) Probability of error : P E = 1 ( (qρ ) ) 1 Tr (1 q)σ Mx 2 x X Distinguishability (semi)-norm associated with the POVM M = (M x ) x X : M := ( ) Tr M x x X Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

6 Distinguishability norms (1) Situation considered System that can be in 2 quantum states, ρ or σ, with respective prior probabilities q and 1 q. Decide in which one it is most likely, based on accessible experimental data, i.e. on the outcomes of a POVM( M = (M x ) x X performed on it. ) Probability of error : P E = 1 ( (qρ ) ) 1 Tr (1 q)σ Mx 2 x X Distinguishability (semi)-norm associated with the POVM M = (M x ) x X : M := ( ) Tr M x x X Set M of POVMs : M := sup M M M Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

7 Distinguishability norms (1) Situation considered System that can be in 2 quantum states, ρ or σ, with respective prior probabilities q and 1 q. Decide in which one it is most likely, based on accessible experimental data, i.e. on the outcomes of a POVM( M = (M x ) x X performed on it. ) Probability of error : P E = 1 ( (qρ ) ) 1 Tr (1 q)σ Mx 2 x X Distinguishability (semi)-norm associated with the POVM M = (M x ) x X : M := ( ) Tr M x x X Set M of POVMs : M := sup M M M Holevo-Helstrom : ALL = 1 := Tr Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

8 Distinguishability norms (2) Problem When only POVMs from a restricted set M are allowed, how much smaller than 1 is M? What kind of restrictions? On a multi-partite system, experimenters are not able to implement any observable (measurements on their own sub-system). M is often defined by these locality constraints (e.g. LOCC SEP PPT). Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

9 Distinguishability norms (2) Problem When only POVMs from a restricted set M are allowed, how much smaller than 1 is M? What kind of restrictions? On a multi-partite system, experimenters are not able to implement any observable (measurements on their own sub-system). M is often defined by these locality constraints (e.g. LOCC SEP PPT). Motivation : Existence of Data-Hiding states (DiVincenzo/Leung/Terhal) Orthogonal states (hence perfectly distinguishable by a suitable measurement) that are barely distinguishable by PPT (and even more so LOCC) measurements. Ex in the bipartite case : Completely symmetric and antisymmetric states on C D C D, σ := 1 1 (1 + F) and α := (1 F). D 2 +D D 2 D := 1 2 σ 1 2 α is s.t. PPT = 2 D = 1. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

10 Outline 1 Introduction 2 Distinguishability norm associated with a single local measurement on a multi-partite system 3 Distinguishability norm associated with whole classes of locally restricted measurements on a multi-partite system 4 Conclusion and open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

11 Local measurements on a multi-partite quantum system Finite-dimensional multi-partite quantum system : H = C d 1 C d K with d := dim H = d 1 d K < + Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

12 Local measurements on a multi-partite quantum system Finite-dimensional multi-partite quantum system : H = C d 1 C d K with d := dim H = d 1 d K < + M = M (1) M (K ) a local POVM on H. Comparison of M with : 1 most natural? 2 most relevant! (norm equivalence with dimension-independent constants of domination) Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

13 Local measurements on a multi-partite quantum system Finite-dimensional multi-partite quantum system : H = C d 1 C d K with d := dim H = d 1 d K < + M = M (1) M (K ) a local POVM on H. Comparison of M with : 1 most natural? 2 most relevant! (norm equivalence with dimension-independent constants of domination) Definition K -partite generalization of the 2-norm : 2(K ) := Tr TrI 2 I [K ] Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

14 Local measurements on a multi-partite quantum system Finite-dimensional multi-partite quantum system : H = C d 1 C d K with d := dim H = d 1 d K < + M = M (1) M (K ) a local POVM on H. Comparison of M with : 1 most natural? 2 most relevant! (norm equivalence with dimension-independent constants of domination) Definition K -partite generalization of the 2-norm : 2(K ) := Tr TrI 2 I [K ] Remark : On a single system, 2(1) = Tr 2 + Tr 2 reduces to 2 = Tr 2 on traceless Hermitians. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

15 Tensor product of local 4-design POVMs (1) M := ( Dp x P x )x X is a t-design POVM on CD if (p x ) x X is a probability distribution and (P x ) x X are rank-1 projectors on C D s.t. p x P t x = ψ ψ t 1 dψ = x X ψ C D, ψ ψ =1 D (D + t 1) U σ. σ S t Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

16 Tensor product of local 4-design POVMs (1) M := ( Dp x P x )x X is a t-design POVM on CD if (p x ) x X is a probability distribution and (P x ) x X are rank-1 projectors on C D s.t. p x P t x = ψ ψ t 1 dψ = x X ψ C D, ψ ψ =1 D (D + t 1) U σ. σ S t Example : U := {D ψ ψ dψ, ψ C D, ψ ψ = 1} -design POVM on C D. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

17 Tensor product of local 4-design POVMs (1) M := ( Dp x P x )x X is a t-design POVM on CD if (p x ) x X is a probability distribution and (P x ) x X are rank-1 projectors on C D s.t. p x P t x = ψ ψ t 1 dψ = x X ψ C D, ψ ψ =1 D (D + t 1) U σ. σ S t Example : U := {D ψ ψ dψ, ψ C D, ψ ψ = 1} -design POVM on C D. Lemma : Moments method M = M (1) M (K ) with M (j) := ( d j p xj P xj )x j X j 4-design POVM on C d j. an Hermitian on H, and S the random variable taking value Tr ( P x1 P xk ) with probability px1 p xk, so that M = d E S. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

18 Tensor product of local 4-design POVMs (1) M := ( Dp x P x )x X is a t-design POVM on CD if (p x ) x X is a probability distribution and (P x ) x X are rank-1 projectors on C D s.t. p x P t x = ψ ψ t 1 dψ = x X ψ C D, ψ ψ =1 D (D + t 1) U σ. σ S t Example : U := {D ψ ψ dψ, ψ C D, ψ ψ = 1} -design POVM on C D. Lemma : Moments method M = M (1) M (K ) with M (j) := ( d j p xj P xj )x j X j 4-design POVM on C d j. ( an Hermitian on H ), and S the random variable taking value Tr P x1 P xk with probability px1 p xk, so that M = d E S. By Jensen : E S E(S 2 ), and by Hölder : E S (E(S2 )) 3 E(S 4 ). Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

19 Tensor product of local 4-design POVMs (1) M := ( Dp x P x )x X is a t-design POVM on CD if (p x ) x X is a probability distribution and (P x ) x X are rank-1 projectors on C D s.t. p x P t x = ψ ψ t 1 dψ = x X ψ C D, ψ ψ =1 D (D + t 1) U σ. σ S t Example : U := {D ψ ψ dψ, ψ C D, ψ ψ = 1} -design POVM on C D. Lemma : Moments method M = M (1) M (K ) with M (j) := ( d j p xj P xj )x j X j 4-design POVM on C d j. ( an Hermitian on H ), and S the random variable taking value Tr P x1 P xk with probability px1 p xk, so that M = d E S. By Jensen : E S E(S 2 ), and by Hölder : E S (E(S2 )) 3 E(S 4 ). (E(S 2 )) 3 So : d E(S 4 M d E(S2 ). ) Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

20 Tensor product of local 4-design POVMs (2) Theorem (L/Winter) M = M (1) M (K ) with M (j) 4-design POVM on C d j. E(S 2 K 1 ) = j=1 d j (d j + 1) ( Tr Tr I ) 2 I [K ] [ E(S 4 K 1 ) j=1 d j (d j + 3) 18K ( Tr Tr I ) 2 I [K ] ] 2 Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

21 Tensor product of local 4-design POVMs (2) Theorem (L/Winter) M = M (1) M (K ) with M (j) 4-design POVM on C d j. E(S 2 K 1 ) = j=1 d j (d j + 1) ( Tr Tr I ) 2 I [K ] [ E(S 4 K 1 ) j=1 d j (d j + 3) 18K ( Tr Tr I ) 2 I [K ] 1 So : 18 K /2 2(K ) M 2(K ). ] 2 Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

22 Tensor product of local 4-design POVMs (2) Theorem (L/Winter) M = M (1) M (K ) with M (j) 4-design POVM on C d j. E(S 2 K 1 ) = j=1 d j (d j + 1) ( Tr Tr I ) 2 I [K ] [ E(S 4 K 1 ) j=1 d j (d j + 3) 18K ( Tr Tr I ) 2 I [K ] 1 So : 18 K /2 2(K ) M 2(K ). Conclusion : If M is a sufficiently symmetric local POVM on H (tensor product of local 4-design POVMs), then M is essentially equivalent to 2(K ) (dimension-independent constants of domination). ] 2 Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

23 Related work and applications Remark : Other 4 th vs 2 nd order moment inequalities may be obtained from hypercontractive inequalities (Montanaro). Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

24 Related work and applications Remark : Other 4 th vs 2 nd order moment inequalities may be obtained from hypercontractive inequalities (Montanaro). Previously known results : Let be a traceless Hermitian on H. K = 1 : M 2 for M a 4-design POVM. Applications in quantum algorithms (Ambainis/Emerson) and quantum dimensionality reduction (Harrow/Montanaro/Short). 1 K = 2 : M for M a tensor product of two 4-design POVMs (Matthews/Wehner/Winter). Applications in entanglement theory (Brandão/Christandl/Yard). Results for any K and non-necessarily traceless useful too? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

25 Implementable POVM with good discriminating power (1) Problem A 4-design POVM on C d must have at least Ω(d 4 ) outcomes. No explicit constructions of 4-design POVMs are known. Minimal number of outcomes for a randomly chosen POVM M on C d so that with high probability M 2(1) (dimension-independently)? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

26 Implementable POVM with good discriminating power (1) Problem A 4-design POVM on C d must have at least Ω(d 4 ) outcomes. No explicit constructions of 4-design POVMs are known. Minimal number of outcomes for a randomly chosen POVM M on C d so that with high probability M 2(1) (dimension-independently)? Strategy : Draw independently P 1,...,P n uniformly distributed rank-1 projectors on C d, set S := n P k and P := ( Pk := S 1/2 P k S 1/2 ) 1 k n. k=1 P is a random POVM on C d with n outcomes s.t. P = n k=1 Tr( Pk ). Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

27 Implementable POVM with good discriminating power (1) Problem A 4-design POVM on C d must have at least Ω(d 4 ) outcomes. No explicit constructions of 4-design POVMs are known. Minimal number of outcomes for a randomly chosen POVM M on C d so that with high probability M 2(1) (dimension-independently)? Strategy : Draw independently P 1,...,P n uniformly distributed rank-1 projectors on C d, set S := n P k and P := ( Pk := S 1/2 P k S 1/2 ) 1 k n. k=1 P is a random POVM on C d with n outcomes s.t. P = n k=1 Theorem (Aubrun/L) ( α > 0, C α > 0 : n C α d 2 P Tr( Pk ) (1) P (1) ) 1 α Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

28 Implementable POVM with good discriminating power (1) Problem A 4-design POVM on C d must have at least Ω(d 4 ) outcomes. No explicit constructions of 4-design POVMs are known. Minimal number of outcomes for a randomly chosen POVM M on C d so that with high probability M 2(1) (dimension-independently)? Strategy : Draw independently P 1,...,P n uniformly distributed rank-1 projectors on C d, set S := n P k and P := ( Pk := S 1/2 P k S 1/2 ) 1 k n. k=1 P is a random POVM on C d with n outcomes s.t. P = n k=1 Theorem (Aubrun/L) ( α > 0, C α > 0 : n C α d 2 P Tr( Pk ) (1) P (1) ) 1 α Remark : Optimal result since P informationally complete n d 2. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

29 Implementable POVM with good discriminating power (2) Idea of the proof : 1 Large deviation probability of d n 2 Large deviation probability of n k=1 n k=1 Tr(P k ) from 2(1)? Tr( Pk ) from d n n k=1 Tr(P k )? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

30 Implementable POVM with good discriminating power (2) Idea of the proof : 1 Large deviation probability of d n 2 Large deviation probability of n k=1 n k=1 Tr(P k ) from 2(1)? Tr( Pk ) from d n n k=1 Use twice : (i) Moments estimate : p 1, E X p ( cp) p X ψ1 c (ii) Bernstein-type tail bound for sums of i.i.d centered ψ 1 -r.v. (iii) Net argument : individual to global error term Tr(P k )? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

31 Implementable POVM with good discriminating power (2) Idea of the proof : 1 Large deviation probability of d n 2 Large deviation probability of n k=1 n k=1 Tr(P k ) from 2(1)? Tr( Pk ) from d n n k=1 Use twice : (i) Moments estimate : p 1, E X p ( cp) p X ψ1 c (ii) Bernstein-type tail bound for sums of i.i.d centered ψ 1 -r.v. (iii) Net argument : individual to global error term 1 {X k := d Tr ( P k ) U } 1 k n for a given S 2(1) 2 {X k := ψ dp k 1 ψ } 1 k n for a given unit vector ψ Tr(P k )? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

32 Implementable POVM with good discriminating power (2) Idea of the proof : 1 Large deviation probability of d n 2 Large deviation probability of n k=1 n k=1 Tr(P k ) from 2(1)? Tr( Pk ) from d n n k=1 Use twice : (i) Moments estimate : p 1, E X p ( cp) p X ψ1 c (ii) Bernstein-type tail bound for sums of i.i.d centered ψ 1 -r.v. (iii) Net argument : individual to global error term 1 {X k := d Tr ( P k ) U } 1 k n for a given S 2(1) Tr(P k )? 2 {X k := ψ dp k 1 ψ } 1 k n for a given unit vector ψ ( 1 P (1) P 15 ) 8 2(1) 1 C d 2 e cn C d e c n/d Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

33 Outline 1 Introduction 2 Distinguishability norm associated with a single local measurement on a multi-partite system 3 Distinguishability norm associated with whole classes of locally restricted measurements on a multi-partite system 4 Conclusion and open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

34 Bounds on the distinguishability of multi-partite states under LOCC, SEP and PPT measurements Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

35 Bounds on the distinguishability of multi-partite states under LOCC, SEP and PPT measurements A tensor product of 4-design POVMs is a particular LOCC strategy. 1 Consequently : 18 K / K /2 2(K ) LOCC. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

36 Bounds on the distinguishability of multi-partite states under LOCC, SEP and PPT measurements A tensor product of 4-design POVMs is a particular LOCC strategy. 1 Consequently : 18 K / K /2 2(K ) LOCC. On a m-partite Hilbert space, the ball of radius 2 1 m/2 for 2 (centered at 1) is fully separable (Barnum/Gurvits). 2 Consequently : 2 K /2 2 SEP and 2 PPT. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

37 Bounds on the distinguishability of multi-partite states under LOCC, SEP and PPT measurements A tensor product of 4-design POVMs is a particular LOCC strategy. 1 Consequently : 18 K / K /2 2(K ) LOCC. On a m-partite Hilbert space, the ball of radius 2 1 m/2 for 2 (centered at 1) is fully separable (Barnum/Gurvits). 2 Consequently : 2 K /2 2 SEP and 2 PPT. Comparison of LOCC, SEP and PPT with ALL 1 1 d 18 K /2 1 LOCC d 2 K /2 1 SEP PPT 1 d Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

38 Data-Hiding and optimality of the lower bounds Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

39 Data-Hiding and optimality of the lower bounds M := U C d 1 U C d K tensor product of the local uniform POVMs. Tightness of d 1 M? K /2 /2 δk 0 : M d 1 with 2 π < δ < 1 Dependence on K and d of the constant relating the norms is real. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

40 Data-Hiding and optimality of the lower bounds M := U C d 1 U C d K tensor product of the local uniform POVMs. Tightness of d 1 M? K /2 /2 δk 0 : M d 1 with 2 π < δ < 1 Dependence on K and d of the constant relating the norms is real. Tightness of 1 d 1 PPT? If I [K ] : d i = d i = d, then 0 : PPT 2 d+1 1 i I i / I Dependence on d of the constant relating the norms is real. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

41 Data-Hiding and optimality of the lower bounds M := U C d 1 U C d K tensor product of the local uniform POVMs. Tightness of d 1 M? K /2 /2 δk 0 : M d 1 with 2 π < δ < 1 Dependence on K and d of the constant relating the norms is real. Tightness of 1 d 1 PPT? If I [K ] : d i = d i = d, then 0 : PPT 2 d+1 1 i I i / I Dependence on d of the constant relating the norms is real. Remark : In the special case H = (C D ) K (d = D K ) with K fixed and D +, it may be shown by volumic considerations that typically : { SEP 1 1 1/K 1 d, so that : PPT SEP 1 PPT d 1 (Aubrun/L). 1 Data-Hiding Hermitians are exceptionnal. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

42 Outline 1 Introduction 2 Distinguishability norm associated with a single local measurement on a multi-partite system 3 Distinguishability norm associated with whole classes of locally restricted measurements on a multi-partite system 4 Conclusion and open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

43 Conclusions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

44 Conclusions On a composite quantum system, equivalence between the distinguishability norm associated with a sufficiently symmetric local POVM and a multi-partite relative of the 2-norm, with constants of domination that depend on the number of local parties but not on their dimension. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

45 Conclusions On a composite quantum system, equivalence between the distinguishability norm associated with a sufficiently symmetric local POVM and a multi-partite relative of the 2-norm, with constants of domination that depend on the number of local parties but not on their dimension. On a d-dimensional quantum system, random POVMs made of Ω(d 2 ) independent uniformly distributed rank-1 projectors (appropriately renormalized) achieve this same discriminating power with high probability. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

46 Conclusions On a composite quantum system, equivalence between the distinguishability norm associated with a sufficiently symmetric local POVM and a multi-partite relative of the 2-norm, with constants of domination that depend on the number of local parties but not on their dimension. On a d-dimensional quantum system, random POVMs made of Ω(d 2 ) independent uniformly distributed rank-1 projectors (appropriately renormalized) achieve this same discriminating power with high probability. Comparison between M and ALL for various sets M of locally restricted POVMs : Existence of Data-Hiding states Optimality of the constants of domination relating the norms in both their number of party and their dimensional dependence. Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

47 Open questions Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

48 Open questions Performance of LOCC (or at least SEP) measurements? Do there exist constants C > 0 and α < 1 s.t. for any number of parties K and any global dimension d there exists an Hermitian 0 s.t. LOCC C αk d 1? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

49 Open questions Performance of LOCC (or at least SEP) measurements? Do there exist constants C > 0 and α < 1 s.t. for any number of parties K and any global dimension d there exists an Hermitian 0 s.t. LOCC C αk d 1? Starting with a POVM that already behaves like the uniform POVM (e.g. a 4-design POVM), how many rank-1 projectors must be drawn from its probability distribution to get a random POVM that, again, behaves like the uniform POVM (with high probability)? Probably Ω(d 2 ) is not enough, but perhaps Ω(d 2 (logd) β ) or Ω(d 2+ε )...? Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

50 References D.P. DiVincenzo, D. Leung, B.M. Terhal, Quantum Data Hiding, arxiv :quant-ph/ A.W. Harrow, A. Montanaro, A.J. Short, Limitations on quantum dimensionality reduction, arxiv[quant-ph] : A. Ambainis, J. Emerson, Quantum t-designs : t-wise independence in the quantum world, arxiv :quant-ph/ W. Matthews, S. Wehner, A. Winter, Distinguishability of quantum states under restricted families of measurements with an application to data hiding, arxiv : [quant-ph]. F.G.S.L. Brandão, M. Christandl, J.T. Yard, Faithful Squashed Entanglement, arxiv[quant-ph] : H.N. Barnum, L. Gurvits, Separable balls around the maximally mixed multipartite quantum states, arxiv :quant-ph/ C. Lancien, A. Winter, Distinguishing multi-partite states by local measurements, arxiv[quant-ph] : Cécilia Lancien ( UCBL1 / UAB ) Distinguishing multi-partite states Madrid OA and QI - June 17 th / 19

Distinguishing multi-partite states by local measurements

Distinguishing multi-partite states by local measurements Distinguishing multi-partite states by local measurements arxiv[quant-ph]:1206.2884 Ecole Polytechnique Paris / University of Bristol Cécilia Lancien / Andreas Winter AQIS 12 August 24 th 2012 Cécilia

More information

Random Matrix Theory in Quantum Information

Random Matrix Theory in Quantum Information Random Matrix Theory in Quantum Information Some generic aspects of entanglement Université Claude Bernard Lyon 1 & Universitat Autònoma de Barcelona Cécilia Lancien BMC & BAMC 2015 - Cambridge Cécilia

More information

Explicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)

Explicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT) Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum

More information

arxiv: v1 [quant-ph] 28 May 2011

arxiv: v1 [quant-ph] 28 May 2011 Detection of Multiparticle Entanglement: Quantifying the Search for Symmetric Extensions Fernando G.S.L. Brandão 1 and Matthias Christandl 2 1 Departamento de Física, Universidade Federal de Minas Gerais,

More information

Quantum Data Hiding Challenges and Opportuni6es

Quantum Data Hiding Challenges and Opportuni6es Quantum Data Hiding Challenges and Opportuni6es Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Based on joint work with M. Christandl, A. Harrow, M. Horodecki, J. Yard PI, 02/11/2011

More information

Squashed entanglement

Squashed entanglement 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

More information

QMA(2) workshop Tutorial 1. Bill Fefferman (QuICS)

QMA(2) workshop Tutorial 1. Bill Fefferman (QuICS) QMA(2) workshop Tutorial 1 Bill Fefferman (QuICS) Agenda I. Basics II. Known results III. Open questions/next tutorial overview I. Basics I.1 Classical Complexity Theory P Class of problems efficiently

More information

Unitary Process Discrimination with Error Margin

Unitary Process Discrimination with Error Margin Unitary Process Discrimination with Error Margin DEX-SMI Workshop on Quantum Statistical Inference March 2-4, 2009, National Institute of Informatics (NII), Tokyo A. Hayashi (Fukui) T. Hashimoto (Fukui),

More information

Detecting pure entanglement is easy, so detecting mixed entanglement is hard

Detecting pure entanglement is easy, so detecting mixed entanglement is hard A quantum e-meter Detecting pure entanglement is easy, so detecting mixed entanglement is hard Aram Harrow (University of Washington) and Ashley Montanaro (University of Cambridge) arxiv:1001.0017 Waterloo

More information

CS286.2 Lecture 13: Quantum de Finetti Theorems

CS286.2 Lecture 13: Quantum de Finetti Theorems CS86. Lecture 13: Quantum de Finetti Theorems Scribe: Thom Bohdanowicz Before stating a quantum de Finetti theorem for density operators, we should define permutation invariance for quantum states. Let

More information

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

Ph 219/CS 219. Exercises Due: Friday 20 October 2006 1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and

More information

Nets vs hierarchies for hard optimization problems

Nets vs hierarchies for hard optimization problems Nets vs hierarchies for hard optimization problems Aram Harrow arxiv:1509.05065 (with Fernando Brandão) in preparation (with Anand Natarajan and Xiaodi Wu) QuiCS QMA(2) 1.8.2016 outline 1. separable states

More information

Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory

Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory Toulouse, 18-22 January 2015 1. Antonio Acín (ICFO-The Institute of Photonic Sciences, Barcelona) Non-commutative polynomial

More information

Semidefinite programming strong converse bounds for quantum channel capacities

Semidefinite programming strong converse bounds for quantum channel capacities Semidefinite programming strong converse bounds for quantum channel capacities Xin Wang UTS: Centre for Quantum Software and Information Joint work with Runyao Duan and Wei Xie arxiv:1610.06381 & 1601.06888

More information

Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, (2013).

Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, (2013). 1 / 24 Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, 032324 (2013). G. Tóth 1,2,3 and D. Petz 4,5 1 Theoretical Physics, University of the Basque Country UPV/EHU,

More information

Some Bipartite States Do Not Arise from Channels

Some Bipartite States Do Not Arise from Channels Some Bipartite States Do Not Arise from Channels arxiv:quant-ph/0303141v3 16 Apr 003 Mary Beth Ruskai Department of Mathematics, Tufts University Medford, Massachusetts 0155 USA marybeth.ruskai@tufts.edu

More information

Bound entangled states with secret key and their classical counterpart

Bound entangled states with secret key and their classical counterpart Bound entangled states with secret key and their classical counterpart Māris Ozols Graeme Smith John Smolin February 6, 2014 A brief summary Main result A new construction of bound entangled states with

More information

Solutions Final exam 633

Solutions Final exam 633 Solutions Final exam 633 S.J. van Enk (Dated: June 9, 2008) (1) [25 points] You have a source that produces pairs of spin-1/2 particles. With probability p they are in the singlet state, ( )/ 2, and with

More information

Maximally Entangled States

Maximally Entangled States Maximally Entangled States Neelarnab Raha B.Sc. Hons. in Math-CS 1st Year, Chennai Mathematical Institute July 11, 2016 Abstract In this article, we study entangled quantum states and their measures, not

More information

Semidefinite programming strong converse bounds for quantum channel capacities

Semidefinite programming strong converse bounds for quantum channel capacities Semidefinite programming strong converse bounds for quantum channel capacities Xin Wang UTS: Centre for Quantum Software and Information Joint work with Wei Xie, Runyao Duan (UTS:QSI) QIP 2017, Microsoft

More information

Remarks on the Additivity Conjectures for Quantum Channels

Remarks on the Additivity Conjectures for Quantum Channels Contemporary Mathematics Remarks on the Additivity Conjectures for Quantum Channels Christopher King Abstract. In this article we present the statements of the additivity conjectures for quantum channels,

More information

arxiv: v2 [quant-ph] 21 Oct 2013

arxiv: v2 [quant-ph] 21 Oct 2013 Genuine hidden quantum nonlocality Flavien Hirsch, 1 Marco Túlio Quintino, 1 Joseph Bowles, 1 and Nicolas Brunner 1, 1 Département de Physique Théorique, Université de Genève, 111 Genève, Switzerland H.H.

More information

Genuine three-partite entangled states with a hidden variable model

Genuine three-partite entangled states with a hidden variable model Genuine three-partite entangled states with a hidden variable model Géza Tóth 1,2 and Antonio Acín 3 1 Max-Planck Institute for Quantum Optics, Garching, Germany 2 Research Institute for Solid State Physics

More information

A Holevo-type bound for a Hilbert Schmidt distance measure

A Holevo-type bound for a Hilbert Schmidt distance measure Journal of Quantum Information Science, 205, *,** Published Online **** 204 in SciRes. http://www.scirp.org/journal/**** http://dx.doi.org/0.4236/****.204.***** A Holevo-type bound for a Hilbert Schmidt

More information

1 Quantum states and von Neumann entropy

1 Quantum states and von Neumann entropy Lecture 9: Quantum entropy maximization CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: February 15, 2016 1 Quantum states and von Neumann entropy Recall that S sym n n

More information

Generalized Bell Inequality and Entanglement Witness

Generalized Bell Inequality and Entanglement Witness Nonlocal Seminar 2005 Bratislava, April 29th 2005 Reinhold A. Bertlmann Generalized Bell Inequality and Entanglement Witness Institute for Theoretical Physics University of Vienna Motivation Composite

More information

arxiv: v4 [quant-ph] 28 Oct 2009

arxiv: v4 [quant-ph] 28 Oct 2009 Max- Relative Entropy of Entanglement, alias Log Robustness arxiv:0807.2536v4 [quant-ph] 28 Oct 2009 Nilanjana Datta, Statistical Laboratory, DPMMS, University of Cambridge, Cambridge CB3 0WB, UK (Dated:

More information

On the power of unentangled measurements on two antiparallel spins

On the power of unentangled measurements on two antiparallel spins On the power of unentangled measurements on two antiparallel spins arxiv:quant-ph/0611201v1 19 Nov 2006 T. Vértesi Institute of Nuclear Research of the Hungarian Academy of Sciences, H-4001 Debrecen, P.O.

More information

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance. 9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance

More information

Quantum Statistics -First Steps

Quantum Statistics -First Steps Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.

More information

Maximal vectors in Hilbert space and quantum entanglement

Maximal vectors in Hilbert space and quantum entanglement Maximal vectors in Hilbert space and quantum entanglement William Arveson arveson@math.berkeley.edu UC Berkeley Summer 2008 arxiv:0712.4163 arxiv:0801.2531 arxiv:0804.1140 Overview Quantum Information

More information

Fundamental rate-loss tradeoff for optical quantum key distribution

Fundamental rate-loss tradeoff for optical quantum key distribution Fundamental rate-loss tradeoff for optical quantum key distribution Masahiro Takeoka (NICT) Saikat Guha (BBN) Mark M. Wilde (LSU) Quantum Krispy Kreme Seminar @LSU January 30, 2015 Outline Motivation Main

More information

arxiv: v1 [quant-ph] 11 Aug 2014

arxiv: v1 [quant-ph] 11 Aug 2014 arxiv:1408.2340v1 [quant-ph] 11 Aug 2014 QUANTUM CHANNELS WITH POLYTOPIC IMAGES AND IMAGE ADDITIVITY MOTOHISA FUKUDA, ION NECHITA, AND MICHAEL M. WOLF Abstract. We study quantum channels with respect to

More information

Entanglement: Definition, Purification and measures

Entanglement: Definition, Purification and measures Entanglement: Definition, Purification and measures Seminar in Quantum Information processing 3683 Gili Bisker Physics Department Technion Spring 006 Gili Bisker Physics Department, Technion Introduction

More information

Restricted Numerical Range and some its applications

Restricted Numerical Range and some its applications Restricted Numerical Range and some its applications Karol Życzkowski in collaboration with P. Gawron, J. Miszczak, Z. Pucha la (Gliwice), L. Skowronek (Kraków), M.D. Choi (Toronto), C. Dunkl (Virginia)

More information

On the distinguishability of random quantum states

On the distinguishability of random quantum states 1 1 Department of Computer Science University of Bristol Bristol, UK quant-ph/0607011 Distinguishing quantum states Distinguishing quantum states This talk Question Consider a known ensemble E of n quantum

More information

Lecture 3. Random Fourier measurements

Lecture 3. Random Fourier measurements Lecture 3. Random Fourier measurements 1 Sampling from Fourier matrices 2 Law of Large Numbers and its operator-valued versions 3 Frames. Rudelson s Selection Theorem Sampling from Fourier matrices Our

More information

Schur-Weyl duality, quantum data compression, tomography

Schur-Weyl duality, quantum data compression, tomography PHYSICS 491: Symmetry and Quantum Information April 25, 2017 Schur-Weyl duality, quantum data compression, tomography Lecture 7 Michael Walter, Stanford University These lecture notes are not proof-read

More information

Quantum entanglement and symmetry

Quantum entanglement and symmetry Journal of Physics: Conference Series Quantum entanglement and symmetry To cite this article: D Chrucisi and A Kossaowsi 2007 J. Phys.: Conf. Ser. 87 012008 View the article online for updates and enhancements.

More information

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

Ph 219/CS 219. Exercises Due: Friday 3 November 2006 Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure

More information

Quantum Entanglement- Fundamental Aspects

Quantum Entanglement- Fundamental Aspects Quantum Entanglement- Fundamental Aspects Debasis Sarkar Department of Applied Mathematics, University of Calcutta, 92, A.P.C. Road, Kolkata- 700009, India Abstract Entanglement is one of the most useful

More information

The Lovász ϑ-function in Quantum Mechanics

The Lovász ϑ-function in Quantum Mechanics The Lovász ϑ-function in Quantum Mechanics Zero-error Quantum Information and Noncontextuality Simone Severini UCL Oxford Jan 2013 Simone Severini (UCL) Lovász ϑ-function in Quantum Mechanics Oxford Jan

More information

Lecture 22: Introduction to Quantum Tomography

Lecture 22: Introduction to Quantum Tomography Quantum Computation CMU 15-859BB, Fall 2015) Lecture 22: Introduction to Quantum Tomography November 23, 2015 Lecturer: John Wright Scribe: Tom Tseng 1 Motivation When conducting research in quantum physics,

More information

Asymptotic Pure State Transformations

Asymptotic Pure State Transformations Asymptotic Pure State Transformations PHYS 500 - Southern Illinois University April 18, 2017 PHYS 500 - Southern Illinois University Asymptotic Pure State Transformations April 18, 2017 1 / 15 Entanglement

More information

arxiv: v2 [quant-ph] 2 Apr 2011

arxiv: v2 [quant-ph] 2 Apr 2011 A Quasipolynomial-Time Algorithm for the Quantum Separability Problem Fernando G.S.L. Brandão Universidade Federal de Minas Gerais Matthias Christandl ETH Zurich Jon Yard Los Alamos National Laboratory

More information

The Principles of Quantum Mechanics: Pt. 1

The Principles of Quantum Mechanics: Pt. 1 The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018

More information

Chapter 5. Density matrix formalism

Chapter 5. Density matrix formalism Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature

More information

Entropy in Classical and Quantum Information Theory

Entropy in Classical and Quantum Information Theory Entropy in Classical and Quantum Information Theory William Fedus Physics Department, University of California, San Diego. Entropy is a central concept in both classical and quantum information theory,

More information

arxiv: v3 [quant-ph] 25 Aug 2013

arxiv: v3 [quant-ph] 25 Aug 2013 Quantum Information and Computation, Vol. 0, No. 0 (2003) 000 000 c Rinton Press ENTANGLEMENT DISTILLATION BY EXTENDIBLE MAPS arxiv:09.779v3 [quant-ph] 25 Aug 203 LUKASZ PANKOWSKI Institute of Theoretical

More information

The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector

The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector 1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input

More information

INSTITUT FOURIER. Quantum correlations and Geometry. Dominique Spehner

INSTITUT FOURIER. Quantum correlations and Geometry. Dominique Spehner i f INSTITUT FOURIER Quantum correlations and Geometry Dominique Spehner Institut Fourier et Laboratoire de Physique et Modélisation des Milieux Condensés, Grenoble Outlines Entangled and non-classical

More information

arxiv: v2 [quant-ph] 23 Aug 2013

arxiv: v2 [quant-ph] 23 Aug 2013 Building one-time memories from isolated qubits arxiv:1304.5007v2 [quant-ph] 23 Aug 2013 Yi-Kai Liu Applied and Computational Mathematics Division National Institute of Standards and Technology Gaithersburg,

More information

From the Kochen-Specker theorem to noncontextuality inequalities without assuming determinism

From the Kochen-Specker theorem to noncontextuality inequalities without assuming determinism From the Kochen-Specker theorem to noncontextuality inequalities without assuming determinism Ravi Kunjwal, IMSc, Chennai July 15, 2015 Quantum Physics and Logic 2015, Oxford (based on arxiv:1506.04150

More information

Valerio Cappellini. References

Valerio Cappellini. References CETER FOR THEORETICAL PHYSICS OF THE POLISH ACADEMY OF SCIECES WARSAW, POLAD RADOM DESITY MATRICES AD THEIR DETERMIATS 4 30 SEPTEMBER 5 TH SFB TR 1 MEETIG OF 006 I PRZEGORZAłY KRAKÓW Valerio Cappellini

More information

Structured Hadamard matrices and quantum information

Structured Hadamard matrices and quantum information Structured Hadamard matrices and quantum information Karol Życzkowski in collaboration with Adam G asiorowski, Grzegorz Rajchel (Warsaw) Dardo Goyeneche (Concepcion/ Cracow/ Gdansk) Daniel Alsina, José

More information

Problem Sheet 1. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X : Ω R be defined by 1 if n = 1

Problem Sheet 1. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X : Ω R be defined by 1 if n = 1 Problem Sheet 1 1. Let Ω = {1, 2, 3}. Let F = {, {1}, {2, 3}, {1, 2, 3}}, F = {, {2}, {1, 3}, {1, 2, 3}}. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X :

More information

arxiv:quant-ph/ v2 11 Jan 2006

arxiv:quant-ph/ v2 11 Jan 2006 Locking of accessible information and implications for the security of quantum cryptography Robert König and Renato Renner Centre for Quantum Computation University of Cambridge United Kingdom Andor Bariska

More information

arxiv: v1 [quant-ph] 3 Feb 2009

arxiv: v1 [quant-ph] 3 Feb 2009 arxiv:0902.0395v1 [quant-ph] 3 Feb 2009 Simplified and robust conditions for optimum testing of multiple hypotheses in quantum detection theory Jon Tyson Harvard University Feb 2, 2009 Abstract Strengthening

More information

arxiv: v3 [quant-ph] 10 Aug 2018

arxiv: v3 [quant-ph] 10 Aug 2018 Enhanced entanglement criterion via symmetric informationally complete measurements arxiv:85.3955v3 [quant-ph] Aug 8 Jiangwei Shang,,, Ali Asadian,, 3, 4, Huangun Zhu, 5, 6, 7, 8, 9, and Otfried Gühne,

More information

CS/Ph120 Homework 4 Solutions

CS/Ph120 Homework 4 Solutions CS/Ph10 Homework 4 Solutions November 3, 016 Problem 1: Robustness of GHZ and W states, part Solution: Due to Bolton Bailey a For the GHZ state, we have T r N GHZ N GHZ N = 1 0 N 1 0 N 1 + 1 N 1 1 N 1

More information

Introduction to Quantum Information Hermann Kampermann

Introduction to Quantum Information Hermann Kampermann Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................

More information

arxiv: v2 [quant-ph] 20 Jun 2018

arxiv: v2 [quant-ph] 20 Jun 2018 Ultimate data hiding in quantum mechanics and beyond arxiv:703.0339v [quant-ph] 0 Jun 08 Ludovico Lami, Carlos Palazuelos,, 3 and Andreas Winter 4, 5 Física Teòrica: Informació i Fenòmens Quàntics, Departament

More information

Information quantique, calcul quantique :

Information quantique, calcul quantique : Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour

More information

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing

More information

Limitations on separable measurements by convex optimization

Limitations on separable measurements by convex optimization Limitations on separable measurements by convex optimization (Full paper available at arxiv:1408.6981) Somshubhro Bandyopadhyay 1 Alessandro Cosentino 2,3 Nathaniel Johnston 2,4 Vincent Russo 2,3 John

More information

Entanglement: concept, measures and open problems

Entanglement: concept, measures and open problems Entanglement: concept, measures and open problems Division of Mathematical Physics Lund University June 2013 Project in Quantum information. Supervisor: Peter Samuelsson Outline 1 Motivation for study

More information

A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks

A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks Marco Tomamichel, Masahito Hayashi arxiv: 1208.1478 Also discussing results of: Second Order Asymptotics for Quantum

More information

Quantum de Finetti theorems for local measurements

Quantum de Finetti theorems for local measurements Quantum de Finetti theorems for local measurements methods to analyze SDP hierarchies Fernando Brandão (UCL) Aram Harrow (MIT) arxiv:1210.6367 motivation/warmup nonlinear optimization --> convex optimization

More information

Unambiguous Discrimination Between Linearly Dependent States With Multiple Copies

Unambiguous Discrimination Between Linearly Dependent States With Multiple Copies Unambiguous Discrimination Between Linearly Dependent States With Multiple Copies Anthony Chefles Department of Physical Sciences, University of Hertfordshire, Hatfield AL10 9AB, Herts, UK arxiv:quant-ph/0105016v3

More information

Strong converse theorems using Rényi entropies

Strong converse theorems using Rényi entropies Strong converse theorems using Rényi entropies Felix Leditzky a, Mark M. Wilde b, and Nilanjana Datta a a Statistical Laboratory, Centre for Mathematical Sciences, University of Cambridge, Cambridge C3

More information

1. Basic rules of quantum mechanics

1. Basic rules of quantum mechanics 1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled

More information

quantum information and convex optimization Aram Harrow (MIT)

quantum information and convex optimization Aram Harrow (MIT) quantum information and convex optimization Aram Harrow (MIT) Simons Institute 25.9.2014 outline 1. quantum information, entanglement, tensors 2. optimization problems from quantum mechanics 3. SDP approaches

More information

arxiv: v2 [quant-ph] 17 Aug 2017

arxiv: v2 [quant-ph] 17 Aug 2017 Absolutely separating quantum maps and channels arxiv:1703.00344v [quant-ph] 17 Aug 017 1. Introduction S N Filippov 1,, K Yu Magadov 1 and M A Jivulescu 3 1 Moscow Institute of Physics and Technology,

More information

arxiv: v2 [quant-ph] 16 Nov 2018

arxiv: v2 [quant-ph] 16 Nov 2018 aaacxicdvhlsgmxfe3hv62vvswncwelkrmikdlgi7cqc1yfwyro+mthmasibkjlgg+wk3u/s2/wn8wfsxs1qsjh3nuosckjhcuhb8fry5+yxfpejyawv1bx2jxnm8tto1hftcs23ui7aohciwcjnxieojjf/xphvrdcxortlqhqykdgj6u6ako5kjmwo5gtsc0fi/qtgbvtaxmolcnxuap7gqihlspyhdblqgbicil5q1atid3qkfhfqqo+1ki6e5f+cyrt/txh1f/oj9+skd2npbhlnngojzmpd8k9tyjdw0kykioniem9jfmxflvtjmjlaseio9n9llpk/ahkfldycthdga3aj3t58/gwfolthsqx2olgidl87cdyigsjusbud182x0/7nbjs9utoacgfz/g1uj2phuaubx9u6fyy7kljdts8owchowj1dsarmc6qvbi39l78ta8bw9nvoovjv1tsanx9rbsmy8zw==

More information

Entanglement Manipulation

Entanglement Manipulation Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the

More information

New Variants of the Quantum de Fine4 Theorem with Applica:ons

New Variants of the Quantum de Fine4 Theorem with Applica:ons New Variants of the Quantum de Fine4 Theorem with Applica:ons Fernando G.S.L. Brandão ETH Zürich Based on joint work with Aram Harrow Arxiv:1210.6367 Shanghai, 27/08/2012 Symmetric States ρ AB1...B n D(A

More information

On PPT States in C K C M C N Composite Quantum Systems

On PPT States in C K C M C N Composite Quantum Systems Commun. Theor. Phys. (Beijing, China) 42 (2004) pp. 25 222 c International Academic Publishers Vol. 42, No. 2, August 5, 2004 On PPT States in C K C M C N Composite Quantum Systems WANG Xiao-Hong, FEI

More information

Efficient achievability for quantum protocols using decoupling theorems

Efficient achievability for quantum protocols using decoupling theorems Efficient achievability for quantum protocols using decoupling theorems Christoph Hirche and Ciara Morgan Institut für Theoretische Physik Leibniz Universität Hannover Appelstraße, D-3067 Hannover, Germany

More information

Entanglement Measures and Monotones

Entanglement Measures and Monotones Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying

More information

1-Bit Matrix Completion

1-Bit Matrix Completion 1-Bit Matrix Completion Mark A. Davenport School of Electrical and Computer Engineering Georgia Institute of Technology Yaniv Plan Mary Wootters Ewout van den Berg Matrix Completion d When is it possible

More information

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

CS286.2 Lecture 15: Tsirelson s characterization of XOR games CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,

More information

Bipartite Continuous-Variable Entanglement. Werner Vogel Universität Rostock, Germany

Bipartite Continuous-Variable Entanglement. Werner Vogel Universität Rostock, Germany Bipartite Continuous-Variable Entanglement Werner Vogel Universität Rostock, Germany Contents Introduction NPT criterion for CV entanglement Negativity of partial transposition Criteria based on moments

More information

Quantum state discrimination with post-measurement information!

Quantum state discrimination with post-measurement information! Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE! Quantum states! A state is a mathematical object describing the

More information

arxiv:quant-ph/ v1 13 Mar 2007

arxiv:quant-ph/ v1 13 Mar 2007 Quantumness versus Classicality of Quantum States Berry Groisman 1, Dan Kenigsberg 2 and Tal Mor 2 1. Centre for Quantum Computation, DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce

More information

Lecture 4: Purifications and fidelity

Lecture 4: Purifications and fidelity CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 4: Purifications and fidelity Throughout this lecture we will be discussing pairs of registers of the form (X, Y), and the relationships

More information

Lecture: Quantum Information

Lecture: Quantum Information Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers

More information

Lecture 2: November 9

Lecture 2: November 9 Semidefinite programming and computational aspects of entanglement IHP Fall 017 Lecturer: Aram Harrow Lecture : November 9 Scribe: Anand (Notes available at http://webmitedu/aram/www/teaching/sdphtml)

More information

Classical data compression with quantum side information

Classical data compression with quantum side information Classical data compression with quantum side information I Devetak IBM TJ Watson Research Center, Yorktown Heights, NY 10598, USA arxiv:quant-ph/0209029v3 18 Apr 2003 A Winter Department of Computer Science,

More information

ENTANGLEMENT BREAKING QUANTUM CHANNELS AND THE PPT-SQUARED CONJECTURE

ENTANGLEMENT BREAKING QUANTUM CHANNELS AND THE PPT-SQUARED CONJECTURE ENTANGLEMENT BREAKING QUANTUM CHANNELS AND THE PPT-SQUARED CONJECTURE NICHOLAS A. MANOR Abstract. Entanglement is a valuable resource in quantum information, therefore we would like to better understand

More information

Lecture 21: HSP via the Pretty Good Measurement

Lecture 21: HSP via the Pretty Good Measurement Quantum Computation (CMU 5-859BB, Fall 205) Lecture 2: HSP via the Pretty Good Measurement November 8, 205 Lecturer: John Wright Scribe: Joshua Brakensiek The Average-Case Model Recall from Lecture 20

More information

Algebraic Theory of Entanglement

Algebraic Theory of Entanglement Algebraic Theory of (arxiv: 1205.2882) 1 (in collaboration with T.R. Govindarajan, A. Queiroz and A.F. Reyes-Lega) 1 Physics Department, Syracuse University, Syracuse, N.Y. and The Institute of Mathematical

More information

Entanglement, mixedness, and spin-flip symmetry in multiple-qubit systems

Entanglement, mixedness, and spin-flip symmetry in multiple-qubit systems Boston University OpenBU College of General Studies http://open.bu.edu BU Open Access Articles 2003-08-01 Entanglement, mixedness, and spin-flip symmetry in multiple-qubit systems Jaeger, Gregg AMER PHYSICAL

More information

arxiv: v1 [quant-ph] 3 Jan 2008

arxiv: v1 [quant-ph] 3 Jan 2008 A paradigm for entanglement theory based on quantum communication Jonathan Oppenheim 1 1 Department of Applied Mathematics and Theoretical Physics, University of Cambridge U.K. arxiv:0801.0458v1 [quant-ph]

More information

Using Friendly Tail Bounds for Sums of Random Matrices

Using Friendly Tail Bounds for Sums of Random Matrices Using Friendly Tail Bounds for Sums of Random Matrices Joel A. Tropp Computing + Mathematical Sciences California Institute of Technology jtropp@cms.caltech.edu Research supported in part by NSF, DARPA,

More information

Theory of Quantum Entanglement

Theory of Quantum Entanglement Theory of Quantum Entanglement Shao-Ming Fei Capital Normal University, Beijing Universität Bonn, Bonn Richard Feynman 1980 Certain quantum mechanical effects cannot be simulated efficiently on a classical

More information

STAT 200C: High-dimensional Statistics

STAT 200C: High-dimensional Statistics STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d

More information

Tensors and complexity in quantum information science

Tensors and complexity in quantum information science Tensors in CS and geometry workshop, Nov. 11 (2014) Tensors and complexity in quantum information science Akimasa Miyake 1 CQuIC, University of New Mexico Outline Subject: math of tensors physics of

More information

Minimum Uncertainty for Entangled States

Minimum Uncertainty for Entangled States Minimum Uncertainty for Entangled States Tabish Qureshi Centre for Theoretical Physics Jamia Millia Islamia New Delhi - 110025. www.ctp-jamia.res.in Collaborators: N.D. Hari Dass, Aditi Sheel Tabish Qureshi

More information

Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement

Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement Commun. Math. Phys. 8, 79 0 (00) Digital Object Identifier (DOI) 0.007/s000-00-0877-6 Communications in Mathematical Physics Unextendible Product ases, Uncompletable Product ases and ound Entanglement

More information

Calculation of Generalized Pauli Constraints

Calculation of Generalized Pauli Constraints Calculation of Generalized Pauli Constraints Murat Altunbulak Department of Mathematics Dokuz Eylul University April, 2016 Notations Notations Quantum States Quantum system A is described by a complex

More information