Quantum Bilinear Optimisation

Size: px
Start display at page:

Download "Quantum Bilinear Optimisation"

Transcription

1 Quantum Bilinear Optimisation ariv: Mario Berta (IQIM Caltech), Omar Fawzi (ENS Lyon), Volkher Scholz (Ghent University) March 7th, 2016 Louisiana State University

2 Quantum Bilinear Optimisation ariv: Mario Berta (IQIM Caltech), Omar Fawzi (ENS Lyon), Volkher Scholz (Ghent University) March 7th, 2016 Louisiana State University Goal: understand the power of quantum assistance and quantum adversaries for operational setups

3 Example: Classical noisy channel coding (vs.) Entanglement-assisted channel coding

4 Classical noisy channel coding (I) Alice Bob i 2 [k] e(x i) x2 W!Y (y x) d(i y) i2[k] Encoder Decoder Given noisy channel W!Y mapping to Y with transition probability: W!Y (y x) 8(x, y) 2 Y The goal is to send k different messages using W while minimising the error probability for decoding: p succ (W, k) := maximize (e,d) subject to 1 W!Y (y x)e(x i)d(i y) bilinear optimisation k x,y,i e(x i) =1 8i 2 [k], d(i y) =1 8y 2 Y x i 0 apple e(x i) apple 1 8(x, i) 2 [k], 0 apple d(i y) apple 1 8(i, y) 2 [k] Y.

5 Classical noisy channel coding (II) p succ (W, k) := maximize (e,d) subject to 1 W!Y (y x)e(x i)d(i y) k e W d x,y,i e(x i) =1 8i 2 [k], d(i y) =1 8y 2 Y x i 0 apple e(x i) apple 1 8(x, i) 2 [k], 0 apple d(i y) apple 1 8(i, y) 2 [k] Y. compared to Shannon s asymptotic independent and identical distributed (iid) channel capacity: Definition: C(W ):=sup n R o lim p succ W n, b2 Rn c =1 n!1 W Answer: C(W ) = max P I( : Y ) mutual information e (n) W d (n) W Encoder Decoder

6 Classical noisy channel coding (II) p succ (W, k) := maximize (e,d) subject to 1 W!Y (y x)e(x i)d(i y) k e W d x,y,i e(x i) =1 8i 2 [k], d(i y) =1 8y 2 Y x i 0 apple e(x i) apple 1 8(x, i) 2 [k], 0 apple d(i y) apple 1 8(i, y) 2 [k] Y. compared to Shannon s asymptotic independent and identical distributed (iid) channel capacity: Definition: C(W ):=sup n R o lim p succ W n, b2 Rn c =1 n!1 W Answer: C(W ) = max P I( : Y ) mutual information e (n) W d (n) W Encoder Decoder

7 Example: Classical noisy channel coding (vs.) Entanglement-assisted channel coding

8 Entanglement-assisted channel coding (I) Alice Bob i 2 [k] E(x i) x2 W!Y (y x) D(i y) i2[k] Encoder i 2H H Decoder p succ(w, k) := maximize (H,,E,D) subject to 1 quantum bilinear optimisation W!Y (y x)h E(x i) D(i y) i k x,y,i E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y.

9 Entanglement-assisted channel coding (I) Alice Bob i 2 [k] E(x i) x2 W!Y (y x) D(i y) i2[k] Encoder i 2H H Decoder p succ(w, k) := maximize (H,,E,D) subject to 1 quantum bilinear optimisation W!Y (y x)h h E(x i) D(i y) i k x,y,i E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. Scalar (commutative) versus matrix (non-commutative) variables: p succ (W, k) := maximize (e,d) 1 k x,y,i W!Y (y x)e(x i)d(i y)

10 Entanglement-assisted channel coding (I) Alice Bob i 2 [k] E(x i) x2 W!Y (y x) D(i y) i2[k] Encoder i 2H H Decoder p succ(w, k) := maximize (H,,E,D) subject to 1 quantum bilinear optimisation W!Y (y x)h h E(x i) D(i y) i k x,y,i E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. Scalar (commutative) versus matrix (non-commutative) variables: p succ (W, k) := maximize (e,d) Unknown if p succ(w, k) is computable! 1 k x,y,i W!Y (y x)e(x i)d(i y)

11 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k)

12 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)]

13 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)]

14 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)] In general, there is a separation: 0 1 1/3 1/ /3 1/3 Z = 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/ /2 p succ (Z, 2) = vs. p succ(z, 2) [Prevedel et al., PRL (2011)]

15 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)] In general, there is a separation: Z = 0 1 1/3 1/ /3 1/3 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/ /2 p succ (Z, 2) = vs. p succ(z, 2) [Prevedel et al., PRL (2011)] > this is also optimal with two-dimensional assistance [Hemenway et al., PRA (2013)] [Williams and Bourdon, ariv: ]

16 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)] In general, there is a separation: Z = However: 0 1 1/3 1/ /3 1/3 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 [0.902, 1] 3 p succ(z, 2) =? 2+2 1/2 p succ (Z, 2) = vs. p succ(z, 2) [Prevedel et al., PRL (2011)] > this is also optimal with two-dimensional assistance [Hemenway et al., PRA (2013)] [Williams and Bourdon, ariv: ]

17 Entanglement-assisted channel coding (II) Understand the possible separation: p succ (W, k) versus p succ(w, k) For the asymptotic iid capacity entanglement (quantum) assistance does not help: C(W )=C (W ) [Bennett et al., PRL (1999)] In general, there is a separation: Z = However: 0 1 1/3 1/ /3 1/3 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 [0.902, 1] 3 p succ(z, 2) =? 2+2 1/2 p succ (Z, 2) = vs. p succ(z, 2) [Prevedel et al., PRL (2011)] > this is also optimal with two-dimensional assistance [Hemenway et al., PRA (2013)] [Williams and Bourdon, ariv: ] linear objective function with semidefinite constraints We give a converging hierarchy of semidefinite programming (sdp) relaxations: p succ (W, k) apple p succ(w, k) =sdp 1 (W, k) apple...apple sdp 1 (W, k) < efficiently computable!

18 Hierarchy of semidefinite programming (sdp) relaxations

19 First level semidefinite programming relaxation (I) Quantum bilinear program: p succ(w, k) := maximize (H,,E,D) subject to 1 W!Y (y x)h E(x i) D(i y) i k x,y,i E(x i) =1 H 8i 2 [k], D(i y) =1 H x i 8y 2 Y 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y.

20 First level semidefinite programming relaxation (I) Quantum bilinear program: p succ(w, k) := maximize (H,,E,D) subject to 1 W!Y (y x)h h E(x i) D(i y) i appleh E(x i) D(i y) i k x,y,i with [E(x i),d(i y)] = 0 E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y.

21 First level semidefinite programming relaxation (I) Quantum bilinear program: p succ(w, k) := maximize (H,,E,D) subject to idea: relaxation of this bilinear form 1 W!Y (y x)h h E(x i) D(i y) i appleh E(x i) D(i y) i k x,y,i with [E(x i),d(i y)] = 0 E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. motivated by: NPA hierarchy (Bell inequalities) [Lasserre, SIAM (2001)], [Parrilo, Math. Program. (2003)], [Navascues et al., PRL (2007)], [Doherty et al., IEEE CCC (2008)], [Navascues et al., NJP (2008)], [Pironio et al., SIAM (2010)]

22 First level semidefinite programming relaxation (I) Quantum bilinear program: p succ(w, k) := maximize (H,,E,D) subject to idea: relaxation of this bilinear form 1 W!Y (y x)h h E(x i) D(i y) i appleh E(x i) D(i y) i k x,y,i with [E(x i),d(i y)] = 0 E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. First step: see as the part of the upper-right block of the Gram matrix = u,v h u v i uihv with u = E(x i) u =(i, x) D(j y) u =(j, y) = h E(x i) E(x 0 i 0 ) i h E(x 0 i 0 ) D(j 0 y 0 ) i for i=j h E(x i) D(j y) i h D(j y) D(j 0 y 0 ) i motivated by: NPA hierarchy (Bell inequalities) [Lasserre, SIAM (2001)], [Parrilo, Math. Program. (2003)], [Navascues et al., PRL (2007)], [Doherty et al., IEEE CCC (2008)], [Navascues et al., NJP (2008)], [Pironio et al., SIAM (2010)]

23 First level semidefinite programming relaxation (I) Quantum bilinear program: p succ(w, k) := maximize (H,,E,D) subject to idea: relaxation of this bilinear form 1 W!Y (y x)h h E(x i) D(i y) i appleh E(x i) D(i y) i k x,y,i with [E(x i),d(i y)] = 0 E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. First step: see as the part of the upper-right block of the Gram matrix = u,v h u v i uihv with u = E(x i) u =(i, x) D(j y) u =(j, y) = h E(x i) E(x 0 i 0 ) i h E(x 0 i 0 ) D(j 0 y 0 ) i for i=j h E(x i) D(j y) i h D(j y) D(j 0 y 0 ) i Original constraints can be formulated as positivity conditions on : sdp 1 (W, k) motivated by: NPA hierarchy (Bell inequalities) [Lasserre, SIAM (2001)], [Parrilo, Math. Program. (2003)], [Navascues et al., PRL (2007)], [Doherty et al., IEEE CCC (2008)], [Navascues et al., NJP (2008)], [Pironio et al., SIAM (2010)]

24 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize 1 k W!Y (y x) (i,x),(i,y) x,y,i subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i

25 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize 1 k x,y,i W!Y (y x) (i,x),(i,y) subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i

26 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize 1 k x,y,i W!Y (y x) (i,x),(i,y) subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i Going back to our example: 0 1 1/3 1/ /3 1/3 Z = 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 p succ (Z, 2) = p succ(z, 2) 2+2 1/ (known before, with twodimensional assistance)

27 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize 1 k x,y,i W!Y (y x) (i,x),(i,y) subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i Going back to our example: 0 1 1/3 1/ /3 1/3 Z = 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 p succ (Z, 2) = p succ(z, 2) Relaxation: 2+2 1/ (known before, with twodimensional assistance) p succ(z, 2) apple sdp 1 (Z, 2) = p p 1 6 Four-dimensional assistance: p succ(z, 2)

28 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize new condition > 1 k x,y,i W!Y (y x) (i,x),(i,y) subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i Going back to our example: 0 1 1/3 1/ /3 1/3 Z = 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 (NPA hierarchy and nonsignalling bounds are one) p succ (Z, 2) = p succ(z, 2) Relaxation: 2+2 1/ (known before, with twodimensional assistance) p succ(z, 2) apple sdp 1 (Z, 2) = p p 1 6 Four-dimensional assistance: p succ(z, 2)

29 First level semidefinite programming relaxation (II) First level relaxation: p succ (W, k) apple p succ(w, k) apple sdp 1 (W, k) sdp 1 (W, k) = maximize new condition > 1 k x,y,i W!Y (y x) (i,x),(i,y) subject to 2 Pos(1 + k + k Y ), ;,; =1 with; the empty symbol u,v 0 8u, v 2 [k] [ Y [k] [ {;} w,(i,x) = w,; 8i 2 [k],w 2 [k] [ Y [k] [ {;} x w,(i,y) = w,; 8y 2 Y,w 2 [k] [ Y [k] [ {;}. i Going back to our example: 0 1 1/3 1/ /3 1/3 Z = 1/3 0 1/3 0 B 0 1/3 0 1/3 1/ /3A 0 1/3 1/3 0 (NPA hierarchy and nonsignalling bounds are one) p succ (Z, 2) = p succ(z, 2) Relaxation: 2+2 1/ (known before, with twodimensional assistance) p succ(z, 2) apple sdp 1 (Z, 2) = p p 1 6 Four-dimensional assistance: p succ(z, 2) > further work [Barman and Fawzi., ariv: ]

30 General Quantum Bilinear Optimisation and more applications

31 General Quantum Bilinear Optimisation p succ(w, k) := maximize (H,,E,D) subject to 1 W!Y (y x)h E(x i) D(i y) i k x,y,i E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. and more applications

32 General Quantum Bilinear Optimisation p succ(w, k) := maximize (H,,E,D) subject to idea: relaxation of this bilinear form 1 W!Y (y x)h E(x i) D(i y) i appleh E(x i) D(i y) i k x,y,i with [E(x i),d(i y)] = 0 E(x i) =1 H 8i 2 [k], D(i y) =1 H 8y 2 Y x i 0 apple E(x i) apple 1 H 8(x, i) 2 [k], 0 apple D(i y) apple 1 H 8(i, y) 2 [k] Y. and more applications

33 Example: Randomness (vs.) Quantum-Proof Randomness

34 Quantum Cryptography (I) Privacy amplification: weak source of randomness 2 {0, 1} n Ext Z (up to 0) (with min-entropy k ) uniform random bits Z 2 {0, 1} m Example: two-universal hashing

35 Quantum Cryptography (I) Privacy amplification: weak source of randomness 2 {0, 1} n Ext (with min-entropy k ) What happens for quantum adversaries? weak source of randomness relative to E Ext E Z Z E uniform random bits Z 2 {0, 1} m (up to 0) uniform random bits relative to E (up to 0) Example: two-universal hashing

36 Quantum Cryptography (I) Privacy amplification: weak source of randomness 2 {0, 1} n Ext Z (up to 0) (with min-entropy k ) randomness extractor uniform random bits Z 2 {0, 1} m What happens for quantum adversaries? weak source of randomness relative to E Ext Z quantum-proof E randomness extractor E uniform random bits relative to E (up to 0) Example: two-universal hashing

37 Quantum Cryptography (I) Privacy amplification: weak source of randomness 2 {0, 1} n Ext Z (up to 0) (with min-entropy k ) randomness extractor uniform random bits Z 2 {0, 1} m What happens for quantum adversaries? weak source of randomness relative to E Ext Z quantum-proof E randomness extractor E uniform random bits relative to E (up to 0) Example: two-universal hashing Motivation: quantum key distribution, two-party cryptography, quantum-safe / quantum-proof / post-quantum

38 Quantum Cryptography (I) Privacy amplification: weak source of randomness 2 {0, 1} n Ext Z (up to 0) (with min-entropy k ) randomness extractor uniform random bits Z 2 {0, 1} m What happens for quantum adversaries? weak source of randomness relative to E Ext Z quantum-proof E randomness extractor E uniform random bits relative to E (up to 0) Example: two-universal hashing Motivation: quantum key distribution, two-party cryptography, quantum-safe / quantum-proof / post-quantum Classical versus quantum error (the ): C(Ext,k) versus Q(Ext,k) computable?

39 Quantum Cryptography (II) For randomness extractors: classical versus quantum adversaries C(Ext,k) versus Q(Ext,k) computable? classical bilinear optimisation versus quantum bilinear optimisation scalar variables versus matrix variables

40 Quantum Cryptography (II) For randomness extractors: classical versus quantum adversaries C(Ext,k) versus Q(Ext,k) computable? classical bilinear optimisation versus quantum bilinear optimisation scalar variables versus matrix variables Converging hierarchy of semidefinite programming relaxations: C(Ext,k) apple Q(Ext,k)=sdp 1 (Ext,k) apple...apple sdp 1 (Ext,k) < efficiently computable! > upper bounding the power of quantum adversaries see ariv: for more (including references)

41 Conclusion / Outlook Understand quantum assistance (noisy channel coding) and quantum adversaries (randomness extractors) using optimisation methods Converging hierarchy of semidefinite programming relaxations: C apple Q =sdp 1 apple...apple sdp 1

42 Conclusion / Outlook Understand quantum assistance (noisy channel coding) and quantum adversaries (randomness extractors) using optimisation methods Converging hierarchy of semidefinite programming relaxations: C apple Q =sdp 1 apple...apple sdp 1 Improvement over NPA hierarchy for non-local games (Bell inequalities), first level also in [Sikora and Varvitsiotis, ariv: ] First outer hierarchy for optimisations over the completely positive semidefinite cone (symmetric matrices that admit a Gram representation by positive semidefinite matrices, [Laurent and Piovesan, ariv: ]) > quantum graph parameters

43 Conclusion / Outlook Understand quantum assistance (noisy channel coding) and quantum adversaries (randomness extractors) using optimisation methods Converging hierarchy of semidefinite programming relaxations: C apple Q =sdp 1 apple...apple sdp 1 Improvement over NPA hierarchy for non-local games (Bell inequalities), first level also in [Sikora and Varvitsiotis, ariv: ] First outer hierarchy for optimisations over the completely positive semidefinite cone (symmetric matrices that admit a Gram representation by positive semidefinite matrices, [Laurent and Piovesan, ariv: ]) > quantum graph parameters Study zero-error information theory Study full cryptographic protocols as optimisations Study SDP relaxation for quantum channel coding, work in progress (same authors)

44 Conclusion / Outlook Understand quantum assistance (noisy channel coding) and quantum adversaries (randomness extractors) using optimisation methods Converging hierarchy of semidefinite programming relaxations: C apple Q =sdp 1 apple...apple sdp 1 Improvement over NPA hierarchy for non-local games (Bell inequalities), first level also in [Sikora and Varvitsiotis, ariv: ] First outer hierarchy for optimisations over the completely positive semidefinite cone (symmetric matrices that admit a Gram representation by positive semidefinite matrices, [Laurent and Piovesan, ariv: ]) > quantum graph parameters Study zero-error information theory Study full cryptographic protocols as optimisations Study SDP relaxation for quantum channel coding, work in progress (same authors) Any other ideas what to quantise? Thanks!

Quantum Technologies for Cryptography

Quantum Technologies for Cryptography University of Sydney 11 July 2018 Quantum Technologies for Cryptography Mario Berta (Department of Computing) marioberta.info Quantum Information Science Understanding quantum systems (e.g., single atoms

More information

Classical and Quantum Channel Simulations

Classical and Quantum Channel Simulations Classical and Quantum Channel Simulations Mario Berta (based on joint work with Fernando Brandão, Matthias Christandl, Renato Renner, Joseph Renes, Stephanie Wehner, Mark Wilde) Outline Classical Shannon

More information

Quantum to Classical Randomness Extractors

Quantum to Classical Randomness Extractors Quantum to Classical Randomness Extractors Mario Berta, Omar Fawzi, Stephanie Wehner - Full version preprint available at arxiv: 1111.2026v3 08/23/2012 - CRYPTO University of California, Santa Barbara

More information

Entropy Accumulation in Device-independent Protocols

Entropy Accumulation in Device-independent Protocols Entropy Accumulation in Device-independent Protocols QIP17 Seattle January 19, 2017 arxiv: 1607.01796 & 1607.01797 Rotem Arnon-Friedman, Frédéric Dupuis, Omar Fawzi, Renato Renner, & Thomas Vidick Outline

More information

Device-independent Quantum Key Distribution and Randomness Generation. Stefano Pironio Université Libre de Bruxelles

Device-independent Quantum Key Distribution and Randomness Generation. Stefano Pironio Université Libre de Bruxelles Device-independent Quantum Key Distribution and Randomness Generation Stefano Pironio Université Libre de Bruxelles Tropical QKD, Waterloo, June 14-17, 2010 Device-independent security proofs establish

More information

Non-commutative polynomial optimization

Non-commutative polynomial optimization Non-commutative polynomial optimization S. Pironio 1, M. Navascuès 2, A. Acín 3 1 Laboratoire d Information Quantique (Brussels) 2 Department of Mathematics (Bristol) 3 ICFO-The Institute of Photonic Sciences

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

More Randomness From Noisy Sources

More Randomness From Noisy Sources More Randomness From Noisy Sources Jean-Daniel Bancal and Valerio Scarani,2 Centre for Quantum Technologies, National University of Singapore 3 Science Drive 2, Singapore 7543 2 Department of Physics,

More information

CS 867/QIC 890 Semidefinite Programming in Quantum Information Winter Topic Suggestions

CS 867/QIC 890 Semidefinite Programming in Quantum Information Winter Topic Suggestions CS 867/QIC 890 Semidefinite Programming in Quantum Information Winter 2017 Topic Suggestions Each student registered in this course is required to choose a topic connecting semidefinite programming with

More information

Converse bounds for private communication over quantum channels

Converse bounds for private communication over quantum channels Converse bounds for private communication over quantum channels Mark M. Wilde (LSU) joint work with Mario Berta (Caltech) and Marco Tomamichel ( Univ. Sydney + Univ. of Technology, Sydney ) arxiv:1602.08898

More information

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

Cryptography CS 555. Topic 25: Quantum Crpytography. CS555 Topic 25 1 Cryptography CS 555 Topic 25: Quantum Crpytography CS555 Topic 25 1 Outline and Readings Outline: What is Identity Based Encryption Quantum cryptography Readings: CS555 Topic 25 2 Identity Based Encryption

More information

Quantum key distribution for the lazy and careless

Quantum key distribution for the lazy and careless Quantum key distribution for the lazy and careless Noisy preprocessing and twisted states Joseph M. Renes Theoretical Quantum Physics, Institut für Angewandte Physik Technische Universität Darmstadt Center

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

Transmitting and Hiding Quantum Information

Transmitting and Hiding Quantum Information 2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents

More information

Simple and Tight Bounds for Information Reconciliation and Privacy Amplification

Simple and Tight Bounds for Information Reconciliation and Privacy Amplification Simple and Tight Bounds for Information Reconciliation and Privacy Amplification Renato Renner 1 and Stefan Wolf 2 1 Computer Science Department, ETH Zürich, Switzerland. renner@inf.ethz.ch. 2 Département

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

Introduction to Quantum Key Distribution

Introduction to Quantum Key Distribution Fakultät für Physik Ludwig-Maximilians-Universität München January 2010 Overview Introduction Security Proof Introduction What is information? A mathematical concept describing knowledge. Basic unit is

More information

Unconditionally secure deviceindependent

Unconditionally secure deviceindependent Unconditionally secure deviceindependent quantum key distribution with only two devices Roger Colbeck (ETH Zurich) Based on joint work with Jon Barrett and Adrian Kent Physical Review A 86, 062326 (2012)

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

Privacy Amplification Theorem for Noisy Main Channel

Privacy Amplification Theorem for Noisy Main Channel Privacy Amplification Theorem for Noisy Main Channel Valeri Korjik, Guillermo Morales-Luna, and Vladimir B. Balakirsky Telecommunications, CINVESTAV-IPN, Guadalajara Campus Prol. López Mateos Sur No. 590,

More information

Privacy Amplification Theorem for Noisy Main Channel

Privacy Amplification Theorem for Noisy Main Channel Privacy Amplification Theorem for Noisy Main Channel Valeri Korjik 1, Guillermo Morales-Luna 2, and Vladimir B. Balakirsky 3 1 Telecommunications, CINVESTAV-IPN, Guadalajara Campus Prol. López Mateos Sur

More information

Quantum Sphere-Packing Bounds and Moderate Deviation Analysis for Classical-Quantum Channels

Quantum Sphere-Packing Bounds and Moderate Deviation Analysis for Classical-Quantum Channels Quantum Sphere-Packing Bounds and Moderate Deviation Analysis for Classical-Quantum Channels (, ) Joint work with Min-Hsiu Hsieh and Marco Tomamichel Hao-Chung Cheng University of Technology Sydney National

More information

Tsirelson s problem and linear system games

Tsirelson s problem and linear system games IQC, University of Waterloo January 20th, 2017 includes joint work with Richard Cleve and Li Liu A speculative question Conventional wisdom: Finite time / volume / energy / etc. =) can always describe

More information

Quantum rate distortion, reverse Shannon theorems, and source-channel separation

Quantum rate distortion, reverse Shannon theorems, and source-channel separation Quantum rate distortion, reverse Shannon theorems, and source-channel separation ilanjana Datta, Min-Hsiu Hsieh, Mark Wilde (1) University of Cambridge,U.K. (2) McGill University, Montreal, Canada Classical

More information

arxiv: v2 [quant-ph] 17 Feb 2015

arxiv: v2 [quant-ph] 17 Feb 2015 uantum-proof randomness extractors via operator space theory Mario Berta, 1, Omar Fawzi, 2,3,4, and Volkher B. Scholz 4, 1 Institute for uantum Information and Matter, Caltech, Pasadena, CA 91125, USA

More information

Quantum sampling of mixed states

Quantum sampling of mixed states Quantum sampling of mixed states Philippe Lamontagne January 7th Philippe Lamontagne Quantum sampling of mixed states January 7th 1 / 9 The setup Philippe Lamontagne Quantum sampling of mixed states January

More information

(Quantum?) Processes and Correlations with no definite causal order

(Quantum?) Processes and Correlations with no definite causal order (Quantum?) Processes and Correlations with no definite causal order Cyril Branciard Institut Néel - Grenoble, France!! Workshop on Quantum Nonlocality, Causal Structures and Device-Independent Quantum

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

Perfectly secure cipher system.

Perfectly secure cipher system. Perfectly secure cipher system Arindam Mitra Lakurdhi, Tikarhat Road, Burdwan 713102 India Abstract We present a perfectly secure cipher system based on the concept of fake bits which has never been used

More information

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

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139 Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense

More information

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security

Quantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security Areas for Discussion Joseph Spring Department of Computer Science MSc Distributed Systems and Security Introduction Photons Quantum Key Distribution Protocols BB84 A 4 state QKD Protocol B9 A state QKD

More information

Global Optimization with Polynomials

Global Optimization with Polynomials Global Optimization with Polynomials Geoffrey Schiebinger, Stephen Kemmerling Math 301, 2010/2011 March 16, 2011 Geoffrey Schiebinger, Stephen Kemmerling (Math Global 301, 2010/2011) Optimization with

More information

On Composite Quantum Hypothesis Testing

On Composite Quantum Hypothesis Testing University of York 7 November 207 On Composite Quantum Hypothesis Testing Mario Berta Department of Computing with Fernando Brandão and Christoph Hirche arxiv:709.07268 Overview Introduction 2 Composite

More information

Quantum Teleportation Pt. 1

Quantum Teleportation Pt. 1 Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the

More information

Ping Pong Protocol & Auto-compensation

Ping Pong Protocol & Auto-compensation Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol

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

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

Common Information. Abbas El Gamal. Stanford University. Viterbi Lecture, USC, April 2014

Common Information. Abbas El Gamal. Stanford University. Viterbi Lecture, USC, April 2014 Common Information Abbas El Gamal Stanford University Viterbi Lecture, USC, April 2014 Andrew Viterbi s Fabulous Formula, IEEE Spectrum, 2010 El Gamal (Stanford University) Disclaimer Viterbi Lecture 2

More information

Lecture 15: Thu Feb 28, 2019

Lecture 15: Thu Feb 28, 2019 Lecture 15: Thu Feb 28, 2019 Announce: HW5 posted Lecture: The AWGN waveform channel Projecting temporally AWGN leads to spatially AWGN sufficiency of projection: irrelevancy theorem in waveform AWGN:

More information

Quantum Information Theory and Cryptography

Quantum Information Theory and Cryptography Quantum Information Theory and Cryptography John Smolin, IBM Research IPAM Information Theory A Mathematical Theory of Communication, C.E. Shannon, 1948 Lies at the intersection of Electrical Engineering,

More information

PERFECTLY secure key agreement has been studied recently

PERFECTLY secure key agreement has been studied recently IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 499 Unconditionally Secure Key Agreement the Intrinsic Conditional Information Ueli M. Maurer, Senior Member, IEEE, Stefan Wolf Abstract

More information

Towards Solving Bilevel Optimization Problems in Quantum Information Theory

Towards Solving Bilevel Optimization Problems in Quantum Information Theory Towards Solving Bilevel Optimization Problems in Quantum Information Theory ICFO-The Institute of Photonic Sciences and University of Borås 22 January 2016 Workshop on Linear Matrix Inequalities, Semidefinite

More information

Lecture 4 Channel Coding

Lecture 4 Channel Coding Capacity and the Weak Converse Lecture 4 Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 15, 2014 1 / 16 I-Hsiang Wang NIT Lecture 4 Capacity

More information

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

Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki *Perimeter Institute for Theoretical Physics Collaboration with Masato Koashi

More information

Lecture 11: Quantum Information III - Source Coding

Lecture 11: Quantum Information III - Source Coding CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that

More information

Key distillation from quantum channels using two-way communication protocols

Key distillation from quantum channels using two-way communication protocols Key distillation from quantum channels using two-way communication protocols Joonwoo Bae and Antonio Acín ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, 08860 Castelldefels, Barcelona,

More information

Noisy Diffie-Hellman protocols

Noisy Diffie-Hellman protocols Noisy Diffie-Hellman protocols Carlos Aguilar 1, Philippe Gaborit 1, Patrick Lacharme 1, Julien Schrek 1 and Gilles Zémor 2 1 University of Limoges, France, 2 University of Bordeaux, France. Classical

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

Extractors and the Leftover Hash Lemma

Extractors and the Leftover Hash Lemma 6.889 New Developments in Cryptography March 8, 2011 Extractors and the Leftover Hash Lemma Instructors: Shafi Goldwasser, Yael Kalai, Leo Reyzin, Boaz Barak, and Salil Vadhan Lecturer: Leo Reyzin Scribe:

More information

Information-theoretic Secrecy A Cryptographic Perspective

Information-theoretic Secrecy A Cryptographic Perspective Information-theoretic Secrecy A Cryptographic Perspective Stefano Tessaro UC Santa Barbara WCS 2017 April 30, 2017 based on joint works with M. Bellare and A. Vardy Cryptography Computational assumptions

More information

Entanglement and Quantum Teleportation

Entanglement and Quantum Teleportation Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,

More information

Lecture 4 Noisy Channel Coding

Lecture 4 Noisy Channel Coding Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem

More information

Privacy Amplification in the Isolated Qubits Model

Privacy Amplification in the Isolated Qubits Model Privacy Amplification in the Isolated Qubits Model Yi-Kai Liu Applied and Computational Mathematics Division National Institute of Standards and Technology Gaithersburg, MD, USA yi-kai.liu@nist.gov Abstract.

More information

Privacy Amplification Secure Against Active Adversaries

Privacy Amplification Secure Against Active Adversaries Privacy Amplification Secure Against Active Adversaries Ueli Manrer Stefan Wolf Department of Computer Science Swiss Federal Institute of Technology (ETH Ziirich) CH-8092 Ziirich, Switzerland E-mail addresses:

More information

Lecture 6: Quantum error correction and quantum capacity

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 hannon theory. It is a fundamentally quantum theorem

More information

Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels

Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Group Secret Key Agreement over State-Dependent Wireless Broadcast Channels Mahdi Jafari Siavoshani Sharif University of Technology, Iran Shaunak Mishra, Suhas Diggavi, Christina Fragouli Institute of

More information

Discrete Memoryless Channels with Memoryless Output Sequences

Discrete Memoryless Channels with Memoryless Output Sequences Discrete Memoryless Channels with Memoryless utput Sequences Marcelo S Pinho Department of Electronic Engineering Instituto Tecnologico de Aeronautica Sao Jose dos Campos, SP 12228-900, Brazil Email: mpinho@ieeeorg

More information

Quantum Setting with Applications

Quantum Setting with Applications in the Quantum Setting with Applications Frédéric Dupuis 1 Serge Fehr 2 Philippe Lamontagne 3 Louis Salvail 3 2 CWI, Amsterdam, The Netherlands 1 Faculty of Informatics, Masaryk University, Brno, Czech

More information

Entropies & Information Theory

Entropies & Information Theory Entropies & Information Theory LECTURE I Nilanjana Datta University of Cambridge,U.K. See lecture notes on: http://www.qi.damtp.cam.ac.uk/node/223 Quantum Information Theory Born out of Classical Information

More information

Broadband energy entangled photons and their potential for space applications. André Stefanov University of Bern, Switzerland

Broadband energy entangled photons and their potential for space applications. André Stefanov University of Bern, Switzerland Broadband energy entangled photons and their potential for space applications André Stefanov University of Bern, Switzerland Quantum Technology in Space, Malta, 29.03.2016 SPDC for quantum communication

More information

Quantum correlations with indefinite causal order

Quantum correlations with indefinite causal order Faculty of Physics, University of Vienna & Institute for Quantum Optics and Quantum Information, Vienna Quantum correlations with indefinite causal order Ognyan Oreshkov, Fabio Costa, Časlav Brukner Nature

More information

protocols such as protocols in quantum cryptography and secret-key agreement by public discussion [8]. Before we formalize the main problem considered

protocols such as protocols in quantum cryptography and secret-key agreement by public discussion [8]. Before we formalize the main problem considered Privacy Amplication Secure Against Active Adversaries? Ueli Maurer Stefan Wolf Department of Computer Science Swiss Federal Institute of Technology (ETH Zurich) CH-8092 Zurich, Switzerland E-mail addresses:

More information

National University of Singapore Department of Electrical & Computer Engineering. Examination for

National University of Singapore Department of Electrical & Computer Engineering. Examination for National University of Singapore Department of Electrical & Computer Engineering Examination for EE5139R Information Theory for Communication Systems (Semester I, 2014/15) November/December 2014 Time Allowed:

More information

Gaussian Bosonic Channels: conjectures, proofs, and bounds

Gaussian Bosonic Channels: conjectures, proofs, and bounds IICQI14 Gaussian Bosonic Channels: conjectures, proofs, and bounds Vittorio Giovannetti NEST, Scuola Normale Superiore and Istituto Nanoscienze-CNR A. S. Holevo (Steklov, Moskov) R. Garcia-Patron (University

More information

Tsirelson s problem and linear system games

Tsirelson s problem and linear system games IQC, University of Waterloo October 10th, 2016 includes joint work with Richard Cleve and Li Liu Non-local games x Referee y Win/lose based on outputs a, b and inputs x, y Alice Bob Alice and Bob must

More information

Mario Berta Curriculum Vitae

Mario Berta Curriculum Vitae Mario Berta Curriculum Vitae Place of Birth Nationality Affiliation Address Email Personal Information Winterthur, Zürich, Switzerland Swiss Imperial College London, Department of Computing Huxley Building

More information

Quantum Information Transfer and Processing Miloslav Dušek

Quantum Information Transfer and Processing Miloslav Dušek Quantum Information Transfer and Processing Miloslav Dušek Department of Optics, Faculty of Science Palacký University, Olomouc Quantum theory Quantum theory At the beginning of 20 th century about the

More information

Analysis of the Influenceof the Rate of Spies Measure on the Quantum Transmission

Analysis of the Influenceof the Rate of Spies Measure on the Quantum Transmission Science Journal Of Mathematics and Statistics ISSN: 2276-6324 http://www.sjpub.org/sjms.html Author(s) 2012. CC Attribution 3.0 License. Research Article Published By Science Journal Publication International

More information

Entanglement and information

Entanglement and information Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit

More information

arxiv: v2 [quant-ph] 28 Jun 2017

arxiv: v2 [quant-ph] 28 Jun 2017 Device-Independent Bounds on Detection Efficiency Jochen Szangolies, Hermann Kampermann, and Dagmar Bruß Institut für Theoretische Physik III, Heinrich-Heine-Universität Düsseldorf, D-40225 Düsseldorf,

More information

Mario Berta Curriculum Vitae

Mario Berta Curriculum Vitae Mario Berta Curriculum Vitae Place of Birth Nationality Affiliation Address Email Personal Information Winterthur, Zürich, Switzerland Swiss Department of Computing Imperial College London Huxley Building

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

Speaker s name and affiliation Rotem Arnon- Friedman (ETH Zürich) de Finetti reductions in the context of non-local games

Speaker s name and affiliation Rotem Arnon- Friedman (ETH Zürich) de Finetti reductions in the context of non-local games Speaker s name and affiliation Rotem Arnon- Friedman (ETH Zürich) Ulrik L. Andersen (Technical Denmark) Cédric Bamps (Université Libre de Bruxelles) Jean-Daniel Bancal (National Singapore) Mario Berta

More information

Quantification of Gaussian quantum steering. Gerardo Adesso

Quantification of Gaussian quantum steering. Gerardo Adesso Quantification of Gaussian quantum steering Gerardo Adesso Outline Quantum steering Continuous variable systems Gaussian entanglement Gaussian steering Applications Steering timeline EPR paradox (1935)

More information

Security of Device-Independent Quantum Key Distribution Protocols

Security of Device-Independent Quantum Key Distribution Protocols Security of Device-Independent Quantum Key Distribution Protocols Chirag Dhara 1, Lluis Masanes 1, Stefano Pironio 2, and Antonio Acín 1,3(B) 1 ICFO Institut de Ciències Fotòniques, Castelldefels, 08860

More information

Secret Key Agreement: General Capacity and Second-Order Asymptotics. Masahito Hayashi Himanshu Tyagi Shun Watanabe

Secret Key Agreement: General Capacity and Second-Order Asymptotics. Masahito Hayashi Himanshu Tyagi Shun Watanabe Secret Key Agreement: General Capacity and Second-Order Asymptotics Masahito Hayashi Himanshu Tyagi Shun Watanabe Two party secret key agreement Maurer 93, Ahlswede-Csiszár 93 X F Y K x K y ArandomvariableK

More information

arxiv: v3 [quant-ph] 1 Mar 2018

arxiv: v3 [quant-ph] 1 Mar 2018 Local Randomness: Examples and Application Honghao Fu 1 and Carl A. Miller 1,2 1 Department of Computer Science, Institute for Advanced Computer Studies and Joint Institute for Quantum Information and

More information

ASPECIAL case of the general key agreement scenario defined

ASPECIAL case of the general key agreement scenario defined IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 4, APRIL 2003 839 Secret-Key Agreement Over Unauthenticated Public Channels Part III: Privacy Amplification Ueli Maurer, Fellow, IEEE, and Stefan Wolf

More information

Linear conic formulations for two-party correlations and values of nonlocal games

Linear conic formulations for two-party correlations and values of nonlocal games Linear conic formulations for two-party correlations and values of nonlocal games Jamie Sikora 1 and Antonios Varvitsiotis 1,2 1 Centre for Quantum Technologies, National University of Singapore, and MajuLab,

More information

Cryptography and Security Final Exam

Cryptography and Security Final Exam Cryptography and Security Final Exam Serge Vaudenay 29.1.2018 duration: 3h no documents allowed, except one 2-sided sheet of handwritten notes a pocket calculator is allowed communication devices are not

More information

Secret-Key Agreement over Unauthenticated Public Channels Part I: Definitions and a Completeness Result

Secret-Key Agreement over Unauthenticated Public Channels Part I: Definitions and a Completeness Result Secret-Key Agreement over Unauthenticated Public Channels Part I: Definitions and a Completeness Result Ueli Maurer, Fellow, IEEE Stefan Wolf Abstract This is the first part of a three-part paper on secret-key

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

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe

SHARED INFORMATION. Prakash Narayan with. Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe SHARED INFORMATION Prakash Narayan with Imre Csiszár, Sirin Nitinawarat, Himanshu Tyagi, Shun Watanabe 2/40 Acknowledgement Praneeth Boda Himanshu Tyagi Shun Watanabe 3/40 Outline Two-terminal model: Mutual

More information

arxiv:quant-ph/ v1 13 Jan 2003

arxiv:quant-ph/ v1 13 Jan 2003 Deterministic Secure Direct Communication Using Ping-pong protocol without public channel Qing-yu Cai Laboratory of Magentic Resonance and Atom and Molecular Physics, Wuhan Institute of Mathematics, The

More information

Multi-Particle Entanglement & It s Application in Quantum Networks

Multi-Particle Entanglement & It s Application in Quantum Networks Lecture Note 5 Multi-Particle Entanglement & It s Application in Quantum Networks 07.06.006 Polarization Entangled Photons ( ) ( ) ± = Ψ ± = Φ ± ± H V V H V V H H [P. G. Kwiat et al., Phys. Rev. Lett.

More information

On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings

On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 2 2017 On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings Sabine Burgdorf

More information

arxiv: v1 [quant-ph] 7 Jun 2016

arxiv: v1 [quant-ph] 7 Jun 2016 PERFECT COMMUTING-OPERATOR STRATEGIES FOR LINEAR SYSTEM GAMES arxiv:1606.02278v1 [quant-ph] 7 Jun 2016 RICHARD CLEVE, LI LIU, AND WILLIAM SLOFSTRA Abstract. Linear system games are a generalization of

More information

Information Theoretic Limits of Randomness Generation

Information Theoretic Limits of Randomness Generation Information Theoretic Limits of Randomness Generation Abbas El Gamal Stanford University Shannon Centennial, University of Michigan, September 2016 Information theory The fundamental problem of communication

More information

A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols

A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols A Genetic Algorithm to Analyze the Security of Quantum Cryptographic Protocols Walter O. Krawec walter.krawec@gmail.com Iona College Computer Science Department New Rochelle, NY USA IEEE WCCI July, 2016

More information

Cryptography and Security Final Exam

Cryptography and Security Final Exam Cryptography and Security Final Exam Solution Serge Vaudenay 29.1.2018 duration: 3h no documents allowed, except one 2-sided sheet of handwritten notes a pocket calculator is allowed communication devices

More information

Asymptotic Analysis of a Three State Quantum Cryptographic Protocol

Asymptotic Analysis of a Three State Quantum Cryptographic Protocol Asymptotic Analysis of a Three State Quantum Cryptographic Protocol Walter O. Krawec walter.krawec@gmail.com Iona College Computer Science Department New Rochelle, NY USA IEEE ISIT July, 2016 Quantum Key

More information

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech

Quantum Entanglement and Cryptography. Deepthi Gopal, Caltech + Quantum Entanglement and Cryptography Deepthi Gopal, Caltech + Cryptography Concisely: to make information unreadable by anyone other than the intended recipient. The sender of a message scrambles/encrypts

More information

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

Information-theoretic treatment of tripartite systems and quantum channels. Patrick Coles Carnegie Mellon University Pittsburgh, PA USA Information-theoretic treatment of tripartite systems and quantum channels Patrick Coles Carnegie Mellon University Pittsburgh, PA USA ArXiv: 1006.4859 a c b Co-authors Li Yu Vlad Gheorghiu Robert Griffiths

More information

Quantum Teleportation Pt. 3

Quantum Teleportation Pt. 3 Quantum Teleportation Pt. 3 PHYS 500 - Southern Illinois University March 7, 2017 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 3 March 7, 2017 1 / 9 A Bit of History on Teleportation

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 joint work with Mark M. Wilde and Nilanjana Datta arxiv:1506.02635 5 January 2016 Table of Contents 1 Weak vs. strong converse 2 Rényi entropies

More information

Degradable Quantum Channels

Degradable Quantum Channels Degradable Quantum Channels Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA May 27, 2010 References The capacity of a quantum channel for simultaneous transmission of classical

More information

Uniformly Additive Entropic Formulas

Uniformly Additive Entropic Formulas Uniformly Additive Entropic Formulas Andrew Cross, Ke Li, Graeme Smith JILA and Department of Physics, University of Colorado Boulder QMATH2016 Georgia Tech October 9, 2016 Information theory: optimal

More information

Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.

Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Kwiat Physics 403 talk: December 2, 2014 Entanglement is a feature of compound

More information

Mario Berta Curriculum Vitae

Mario Berta Curriculum Vitae Mario Berta Curriculum Vitae Place of Birth Nationality Affiliation Address Email Personal Information Winterthur, Zürich, Switzerland Swiss Imperial College London, Department of Computing Huxley Building

More information

The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego

The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego 10/15/01 1 Outline The Shannon Statue A Miraculous Technology Information Theory

More information