A meta-converse for private communication over quantum channels

Size: px
Start display at page:

Download "A meta-converse for private communication over quantum channels"

Transcription

1 A meta-coverse for private commuicatio over quatum chaels Mario Berta with Mark M. Wilde ad Marco Tomamichel IEEE Trasactios o Iformatio Theory, 63(3), (2017) Beyod IID Sigapore - July 17, 2017 Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

2 Setup I Give a quatu chael N ad a quatum key distributio (QKD) protocol that uses it times, how much key ca be geerated? A 1 N B1 A 2 N B2 A N B KA LOCC A1 B1 LOCC A2 B2 LOCC LOCC A B LOCC K B No-asymptotic private capacity: maximum rate of ε-close secret key achievable usig the chael times with two-way public classical commuicatio assistace (passive adversary) ˆP N (, ε) := sup { P : (, P, ε) is achievable for N usig LOCC }. (1) Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

3 Setup II Practical questio: how to characterize ˆP N (, ε) for all 1 ad ε (0, 1)? The aswers give the fudametal limitatios of QKD. Upper bouds o ˆP N (, ε) ca be used as bechmarks for quatum repeaters [Lütkehaus]. Today, I will preset the tightest kow upper boud o ˆP N (, ε) for may chaels of practical iterest. Iterestig special case: sigle-mode phase-isesitive bosoic Gaussia chaels. Techical level: quatum Shao theory with geeral 1 ad ε 0. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

4 Overview 1 Mai Results i Examples 2 Proof Idea: Meta Coverse 3 Coclusio Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

5 Mai Results i Examples Mai Result: Gaussia Chaels I Coverse bouds for sigle-mode phase-isesitive bosoic Gaussia chaels, most importatly the photo loss chael L η : ˆb = ηâ + 1 ηê (2) where trasmissivity η [0, 1] ad eviromet i vacuum state. Previous asymptotic result from [Piradola et al. 2017] i the ifiite eergy limit ( ) P 1 (L η ) := lim lim ε 0 ˆP 1 N η (, ε) log, (3) 1 η ( which is actually tight i the asymptotic limit, i.e., P (N η ) = log 1 1 η Drawback: a asymptotic statemet, ad thus says little for practical protocols (called a weak coverse boud). ). Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

6 Mai Results i Examples Mai Result: Gaussia Chaels II We show the o-asymptotic coverse boud ( where C(ε) := log log ( ) 1 ˆP 1 L η (, ε) log + C(ε) 1 η, (4) 1+ε 1 ε ) (other choices possible). Ca be used to assess the performace of ay practical quatum repeater which uses a loss chael times for desired security ε. Other variatios of this boud are possible if η is ot the same for each chael use, if η is chose adversarially, etc. We give similar bouds for the quatum-limited amplifier chael (tight), thermalizig chaels, amplifier chaels, ad additive oise chaels. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

7 Mai Results i Examples Mai Result: Dephasig Chaels I Previous asymptotic result for the qubit dephasig chael Z γ : ρ (1 γ) ρ + γzρz with γ (0, 1) is [Beett et al. 1996, Piradola et al. 2017] P 1 (Z γ ) := lim lim ε 0 ˆP Z γ (, ε) = 1 h(γ), (5) with the biary etropy h(γ) := γ log γ (1 γ) log(1 γ). By combiig with [Tomamichel et al. 2016] we show the expasio 1 ˆP v(γ) Z γ (, ε) = 1 h(γ) + Φ 1 (ε) + log ( ) O, (6) with Φ the cumulative stadard Gaussia distributio ad the biary etropy variace v(γ) := γ(log γ + h(γ)) 2 + (1 γ)(log(1 γ) + h(γ)) 2. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

8 Mai Results i Examples Mai Result: Dephasig Chaels II For the dephasig parameter γ = 0.1 we get (figure from [Tomamichel et al. 2016]): Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

9 Mai Results i Examples Mai Result: Erasure Chaels For the qubit erasure chael E p : ρ (1 p)ρ + p e e with p (0, 1) we show by combiig with [Tomamichel et al. 2016] the expasio ( ) 1 ˆP p(1 p) E p (, ε) = 1 p + Φ 1 1 (ε) + O. (7) For the erasure parameter p = 0.25 we get for ε = 1% (figure from [Tomamichel et al. 2016]): Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

10 Proof Idea: Meta Coverse I Proof Idea: Meta Coverse Meta coverse approach from classical chael codig [Polyaskiy et al. 2010], uses coectio to hypothesis testig. I the quatum regime, e.g., for classical commuicatio [Tomamichel & Ta 2015] or quatum commuicatio [Tomamichel et al & 2016]. We exted this approach to private commuicatio. Hypothesis testig relative etropy defied for a state ρ, positive semi-defiite operator σ, ad ε [0, 1] as D ε H(ρ σ) := log if { Tr[Λσ] : 0 Λ I Tr[Λρ] 1 ε }. (8) The ε-relative etropy of etaglemet is defied as E ε R(A; B) ρ := if DH(ρ ε AB σ AB), (9) σ AB S(A:B) where S(A :B) is the set of separable states (cf. relative etropy of etaglemet). Chael s ε-relative etropy of etaglemet is the give as E ε R(N ) := sup ER(A; ε B) ρ, (10) ψ AA H AA where ρ AB := N A B(ψ AA ). Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

11 Proof Idea: Meta Coverse Proof Idea: Meta Coverse II Goal is the creatio of log K bits of key, i.e., states γ ABE with (M A M B )(γ ABE ) = 1 i i A i i B σ E (11) K i for some state σ E ad measuremet chaels M A, M B. I oe-to-oe correspodece with pure states γ AA BB E such that [Horodecki et al & 2009] γ ABA B = U ABA B (Φ AB θ A B )U ABA B, (12) where Φ AB maximally etagled, U ABA B = i,j i i A j j B U ij A B with each U ij A B a uitary, ad θ A B a state. Work i the latter, bipartite picture where the adversary is removed. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

12 Proof Idea: Meta Coverse Proof Idea: Meta Coverse III For separable states σ AA BB (useless for private commuicatio) ad a state with log K bits of key we have [Horodecki et al. 2009] γ AA BB Tr{γ AA BB σ AA BB } 1 K. (13) The mootoicity of the chael s ε-relative etropy of etaglemet E ε R(N ) with respect to LOCC together with (13) implies the meta coverse ˆP N (1, ε) E ε R(N ) (LOCC pre- ad post-processig assistace). (14) For chael uses this gives ˆP N (, ε) E ε R ( N ). (15) Fiite block-legth versio of relative etropy of etaglemet upper boud [Horodoecki et al & 2009]. The ext step is to evaluate the meta coverse for specific chaels of iterest. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

13 Proof Idea: Meta Coverse Proof Idea: Meta Coverse IV For teleportatio-simulable chaels N A B with associated state ω AB [Beett et al. 1996, Piradola et al. 2017] the meta coverse holds for geeral LOCC assistace ad expads as 1 ˆP V ε ( ) N E (, ε) E R(A; B) ω + R (A; B) ω Φ 1 log (ε) + O, (16) where V ε E R (A; B) ρ { maxσab Π S V (ρ AB σ AB) for ε < 1/2 mi σab Π S V (ρ AB σ AB) for ε 1/2 } (17) with Π S S(A : B) the set of separable states achievig miimum i the relative etropy of etaglemet E R(A; B) ρ := if D(ρAB σab). (18) σ AB S(A:B) Here, we have the cumulative stadard Gaussia distributio Φ, the relative etropy D(ρ σ) := Tr [ρ (log ρ log σ)], ad the relative etropy variace V (ρ σ) := Tr [ ρ (log ρ log σ D(ρ σ)) 2]. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

14 Extra: Gaussia Formulas Proof Idea: Meta Coverse For Gaussia chaels we eed formulas for the relative etropy D(ρ σ) ad the relative etropy variace V (ρ σ). From [Che 2005, Piradola et al. 2017] ad [Wilde et al. 2016], respectively: writig zero-mea Gaussia states i expoetial form as { ρ = Zρ 1/2 exp 1 } 2 ˆxT G ρˆx with (19) Z ρ := det(v ρ + iω/2), G ρ := 2iΩ arcoth(2v ρ iω), (20) ad V ρ the Wiger fuctio covariace matrix for ρ, we have D(ρ σ) = 1 2 ( log ( Zσ Z ρ ) ) Tr [ V ρ ] (21) V (ρ σ) = 1 2 Tr{ V ρ V ρ } + 1 Tr{ Ω Ω}, (22) 8 where := G ρ G σ. Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

15 Coclusio Coclusio Our meta coverse ˆP N (1, ε) E ε R(N ) gives bouds for the private trasmissio capabilities of quatum chaels. These give the fudametal limitatios of QKD ad thus ca be used as bechmarks for quatum repeaters. Improve our boud for the photo loss chael ( ) 1 ˆP L 1 η (, ε) log + C(ε) with C(ε) = log log 1 η ( ) to C (ε) := log? 1 1 ε ( ) 1 + ε 1 ε Correspodig matchig achievability? (Tight aalysis of radom codig i ifiite dimesios eeded.) Tight fiite-eergy bouds for sigle-mode phase-isesitive bosoic Gaussia chaels? Uderstad more chaels, for example such with P > 0 but zero quatum capacity [Horodecki et al. 2008]? (23) Mario Berta A meta-coverse for private commuicatio Beyod IID Sigapore - July 17, / 15

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

Asymptotic Coupling and Its Applications in Information Theory

Asymptotic Coupling and Its Applications in Information Theory Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM

More information

Lecture 11: Channel Coding Theorem: Converse Part

Lecture 11: Channel Coding Theorem: Converse Part EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig

More information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for

More information

Entropies & Information Theory

Entropies & Information Theory Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

More information

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220 ECE 564/645 - Digital Commuicatio Systems (Sprig 014) Fial Exam Friday, May d, 8:00-10:00am, Marsto 0 Overview The exam cosists of four (or five) problems for 100 (or 10) poits. The poits for each part

More information

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Lecture 7: October 18, 2017

Lecture 7: October 18, 2017 Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem

More information

Large Deviations Performance Analysis for Biometrics Recognition

Large Deviations Performance Analysis for Biometrics Recognition J.A. O Sulliva, 2002 Allerto Coferece Large Deviatios erformace Aalysis for Biometrics Recogitio Joseph A. O Sulliva ad Natalia Schmid Electroic Systems ad Sigals Research Laboratory Departmet of Electrical

More information

Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH

Lecture 7: MIMO Architectures Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH : Theoretical Foudatios of Wireless Commuicatios 1 Thursday, May 19, 2016 12:30-15:30, Coferece Room SIP 1 Textbook: D. Tse ad P. Viswaath, Fudametals of Wireless Commuicatio 1 / 1 Overview Lecture 6:

More information

Information Theory and Coding

Information Theory and Coding Sol. Iformatio Theory ad Codig. The capacity of a bad-limited additive white Gaussia (AWGN) chael is give by C = Wlog 2 ( + σ 2 W ) bits per secod(bps), where W is the chael badwidth, is the average power

More information

Spring Information Theory Midterm (take home) Due: Tue, Mar 29, 2016 (in class) Prof. Y. Polyanskiy. P XY (i, j) = α 2 i 2j

Spring Information Theory Midterm (take home) Due: Tue, Mar 29, 2016 (in class) Prof. Y. Polyanskiy. P XY (i, j) = α 2 i 2j Sprig 206 6.44 - Iformatio Theory Midterm (take home) Due: Tue, Mar 29, 206 (i class) Prof. Y. Polyaskiy Rules. Collaboratio strictly prohibited. 2. Write rigorously, prove all claims. 3. You ca use otes

More information

18.S096: Homework Problem Set 1 (revised)

18.S096: Homework Problem Set 1 (revised) 8.S096: Homework Problem Set (revised) Topics i Mathematics of Data Sciece (Fall 05) Afoso S. Badeira Due o October 6, 05 Exteded to: October 8, 05 This homework problem set is due o October 6, at the

More information

Summary. Recap ... Last Lecture. Summary. Theorem

Summary. Recap ... Last Lecture. Summary. Theorem Last Lecture Biostatistics 602 - Statistical Iferece Lecture 23 Hyu Mi Kag April 11th, 2013 What is p-value? What is the advatage of p-value compared to hypothesis testig procedure with size α? How ca

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Last time, we talked about how Equation (1) can simulate Equation (2). We asserted that Equation (2) can also simulate Equation (1).

Last time, we talked about how Equation (1) can simulate Equation (2). We asserted that Equation (2) can also simulate Equation (1). 6896 Quatum Complexity Theory Sept 23, 2008 Lecturer: Scott Aaroso Lecture 6 Last Time: Quatum Error-Correctio Quatum Query Model Deutsch-Jozsa Algorithm (Computes x y i oe query) Today: Berstei-Vazirii

More information

32 estimating the cumulative distribution function

32 estimating the cumulative distribution function 32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

More information

This section is optional.

This section is optional. 4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore

More information

arxiv: v3 [quant-ph] 19 Jun 2018

arxiv: v3 [quant-ph] 19 Jun 2018 Theory of chael simulatio ad bouds for private commuicatio Stefao Piradola, 1 Samuel L. Braustei, 1 Riccardo Laureza, 1 Carlo Ottaviai, 1 Thomas P. W. Cope, 1 Gaetaa Spedalieri, 1,2 ad Leoardo Bachi 3,4

More information

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1 Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits

More information

Application to Random Graphs

Application to Random Graphs A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

ε-capacity and Strong Converse for Channels with General State

ε-capacity and Strong Converse for Channels with General State ε-capacity ad Strog Coverse for Chaels with Geeral State Marco Tomamichel Cetre for Quatum Techologies, Natioal Uiversity of Sigapore Email: cqtmarco@us.edu.sg Vicet Y. F. Ta Istitute for Ifocomm Research,

More information

Empirical Process Theory and Oracle Inequalities

Empirical Process Theory and Oracle Inequalities Stat 928: Statistical Learig Theory Lecture: 10 Empirical Process Theory ad Oracle Iequalities Istructor: Sham Kakade 1 Risk vs Risk See Lecture 0 for a discussio o termiology. 2 The Uio Boud / Boferoi

More information

Similarity between quantum mechanics and thermodynamics: Entropy, temperature, and Carnot cycle

Similarity between quantum mechanics and thermodynamics: Entropy, temperature, and Carnot cycle Similarity betwee quatum mechaics ad thermodyamics: Etropy, temperature, ad Carot cycle Sumiyoshi Abe 1,,3 ad Shiji Okuyama 1 1 Departmet of Physical Egieerig, Mie Uiversity, Mie 514-8507, Japa Istitut

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,

More information

Lecture 3. Properties of Summary Statistics: Sampling Distribution

Lecture 3. Properties of Summary Statistics: Sampling Distribution Lecture 3 Properties of Summary Statistics: Samplig Distributio Mai Theme How ca we use math to justify that our umerical summaries from the sample are good summaries of the populatio? Lecture Summary

More information

1 Review and Overview

1 Review and Overview DRAFT a fial versio will be posted shortly CS229T/STATS231: Statistical Learig Theory Lecturer: Tegyu Ma Lecture #3 Scribe: Migda Qiao October 1, 2013 1 Review ad Overview I the first half of this course,

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10 DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set

More information

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15 17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig

More information

Parameter, Statistic and Random Samples

Parameter, Statistic and Random Samples Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,

More information

Session 5. (1) Principal component analysis and Karhunen-Loève transformation

Session 5. (1) Principal component analysis and Karhunen-Loève transformation 200 Autum semester Patter Iformatio Processig Topic 2 Image compressio by orthogoal trasformatio Sessio 5 () Pricipal compoet aalysis ad Karhue-Loève trasformatio Topic 2 of this course explais the image

More information

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Overview of Gaussian MIMO (Vector) BC

Overview of Gaussian MIMO (Vector) BC Overview of Gaussia MIMO (Vector) BC Gwamo Ku Adaptive Sigal Processig ad Iformatio Theory Research Group Nov. 30, 2012 Outlie / Capacity Regio of Gaussia MIMO BC System Structure Kow Capacity Regios -

More information

Lecture 11: Pseudorandom functions

Lecture 11: Pseudorandom functions COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt

More information

Central Limit Theorem using Characteristic functions

Central Limit Theorem using Characteristic functions Cetral Limit Theorem usig Characteristic fuctios RogXi Guo MAT 477 Jauary 20, 2014 RogXi Guo (2014 Cetral Limit Theorem usig Characteristic fuctios Jauary 20, 2014 1 / 15 Itroductio study a radom variable

More information

Estimation of the Mean and the ACVF

Estimation of the Mean and the ACVF Chapter 5 Estimatio of the Mea ad the ACVF A statioary process {X t } is characterized by its mea ad its autocovariace fuctio γ ), ad so by the autocorrelatio fuctio ρ ) I this chapter we preset the estimators

More information

Lecture Notes 15 Hypothesis Testing (Chapter 10)

Lecture Notes 15 Hypothesis Testing (Chapter 10) 1 Itroductio Lecture Notes 15 Hypothesis Testig Chapter 10) Let X 1,..., X p θ x). Suppose we we wat to kow if θ = θ 0 or ot, where θ 0 is a specific value of θ. For example, if we are flippig a coi, we

More information

Exam II Review. CEE 3710 November 15, /16/2017. EXAM II Friday, November 17, in class. Open book and open notes.

Exam II Review. CEE 3710 November 15, /16/2017. EXAM II Friday, November 17, in class. Open book and open notes. Exam II Review CEE 3710 November 15, 017 EXAM II Friday, November 17, i class. Ope book ad ope otes. Focus o material covered i Homeworks #5 #8, Note Packets #10 19 1 Exam II Topics **Will emphasize material

More information

COURSE INTRODUCTION: WHAT HAPPENS TO A QUANTUM PARTICLE ON A PENDULUM π 2 SECONDS AFTER IT IS TOSSED IN?

COURSE INTRODUCTION: WHAT HAPPENS TO A QUANTUM PARTICLE ON A PENDULUM π 2 SECONDS AFTER IT IS TOSSED IN? COURSE INTRODUCTION: WHAT HAPPENS TO A QUANTUM PARTICLE ON A PENDULUM π SECONDS AFTER IT IS TOSSED IN? DROR BAR-NATAN Follows a lecture give by the author i the trivial otios semiar i Harvard o April 9,

More information

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

More information

A Non-Asymptotic Achievable Rate for the AWGN Energy-Harvesting Channel using Save-and-Transmit

A Non-Asymptotic Achievable Rate for the AWGN Energy-Harvesting Channel using Save-and-Transmit 016 IEEE Iteratioal Symposium o Iformatio Theory A No-Asymptotic Achievable Rate for the AWGN Eergy-Harvestig Chael usig Save-ad-Trasmit Silas L. Fog, Vicet Y. F. Ta, ad Jig Yag Departmet of Electrical

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo

More information

Rank tests and regression rank scores tests in measurement error models

Rank tests and regression rank scores tests in measurement error models Rak tests ad regressio rak scores tests i measuremet error models J. Jurečková ad A.K.Md.E. Saleh Charles Uiversity i Prague ad Carleto Uiversity i Ottawa Abstract The rak ad regressio rak score tests

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector Dimesio-free PAC-Bayesia bouds for the estimatio of the mea of a radom vector Olivier Catoi CREST CNRS UMR 9194 Uiversité Paris Saclay olivier.catoi@esae.fr Ilaria Giulii Laboratoire de Probabilités et

More information

bounds and in which F (n k) n q s.t. HG T = 0.

bounds and in which F (n k) n q s.t. HG T = 0. 6. Liear codes. Chael capacity Recall that last time we showed the followig achievability bouds: Shao s: P e P [i(x; Y ) log M + τ] + exp{ τ} M DT: P e E [ exp { (i( X; Y ) log ) + }] Feistei s: P e,max

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

On the Finite Blocklength Performance of Lossy Multi-Connectivity

On the Finite Blocklength Performance of Lossy Multi-Connectivity O the Fiite Blocklegth Performace of Lossy Multi-Coectivity Li Zhou Departmet of ECE, Natioal Uiversity of Sigapore, Email: lzhou@u.us.edu Albrecht Wolf Vodafoe Chair Mobile Commuicatio Systems, Techical

More information

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE

OPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.

More information

Quantum Computing Lecture 7. Quantum Factoring

Quantum Computing Lecture 7. Quantum Factoring Quatum Computig Lecture 7 Quatum Factorig Maris Ozols Quatum factorig A polyomial time quatum algorithm for factorig umbers was published by Peter Shor i 1994. Polyomial time meas that the umber of gates

More information

6.895 Essential Coding Theory October 20, Lecture 11. This lecture is focused in comparisons of the following properties/parameters of a code:

6.895 Essential Coding Theory October 20, Lecture 11. This lecture is focused in comparisons of the following properties/parameters of a code: 6.895 Essetial Codig Theory October 0, 004 Lecture 11 Lecturer: Madhu Suda Scribe: Aastasios Sidiropoulos 1 Overview This lecture is focused i comparisos of the followig properties/parameters of a code:

More information

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

4.1 Data processing inequality

4.1 Data processing inequality ECE598: Iformatio-theoretic methods i high-dimesioal statistics Sprig 206 Lecture 4: Total variatio/iequalities betwee f-divergeces Lecturer: Yihog Wu Scribe: Matthew Tsao, Feb 8, 206 [Ed. Mar 22] Recall

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Large Deviations in Quantum Information Theory

Large Deviations in Quantum Information Theory Large Deviatios i Quatum Iformatio Theory R. Ahlswede ad V. Bliovsky Abstract We obtai asymptotic estimates o the probabilities of evets of special types which are usefull i quatum iformatio theory, especially

More information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

Lecture 20: Multivariate convergence and the Central Limit Theorem

Lecture 20: Multivariate convergence and the Central Limit Theorem Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties

More information

Solutions to HW Assignment 1

Solutions to HW Assignment 1 Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.

More information

Symmetric Two-User Gaussian Interference Channel with Common Messages

Symmetric Two-User Gaussian Interference Channel with Common Messages Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX

More information

Lecture 33: Bootstrap

Lecture 33: Bootstrap Lecture 33: ootstrap Motivatio To evaluate ad compare differet estimators, we eed cosistet estimators of variaces or asymptotic variaces of estimators. This is also importat for hypothesis testig ad cofidece

More information

Ada Boost, Risk Bounds, Concentration Inequalities. 1 AdaBoost and Estimates of Conditional Probabilities

Ada Boost, Risk Bounds, Concentration Inequalities. 1 AdaBoost and Estimates of Conditional Probabilities CS8B/Stat4B Sprig 008) Statistical Learig Theory Lecture: Ada Boost, Risk Bouds, Cocetratio Iequalities Lecturer: Peter Bartlett Scribe: Subhrasu Maji AdaBoost ad Estimates of Coditioal Probabilities We

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Statistical Theory; Why is the Gaussian Distribution so popular?

Statistical Theory; Why is the Gaussian Distribution so popular? Statistical Theory; Why is the Gaussia Distributio so popular? Rob Nicholls MRC LMB Statistics Course 2014 Cotets Cotiuous Radom Variables Expectatio ad Variace Momets The Law of Large Numbers (LLN) The

More information

c. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area?

c. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area? 1. Research Methodology a. What is meat by the supply chai (SC) coordiatio problem ad does it apply to all types of SC s? Does the Bullwhip effect relate to all types of SC s? Also does it relate to SC

More information

The method of types. PhD short course Information Theory and Statistics Siena, September, Mauro Barni University of Siena

The method of types. PhD short course Information Theory and Statistics Siena, September, Mauro Barni University of Siena PhD short course Iformatio Theory ad Statistics Siea, 15-19 September, 2014 The method of types Mauro Bari Uiversity of Siea Outlie of the course Part 1: Iformatio theory i a utshell Part 2: The method

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

Lecture 1 Probability and Statistics

Lecture 1 Probability and Statistics Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark

More information

Lecture 16: Achieving and Estimating the Fundamental Limit

Lecture 16: Achieving and Estimating the Fundamental Limit EE378A tatistical igal Processig Lecture 6-05/25/207 Lecture 6: Achievig ad Estimatig the Fudametal Limit Lecturer: Jiatao Jiao cribe: William Clary I this lecture, we formally defie the two distict problems

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Itroductio to Probability ad Statistics Lecture 23: Cotiuous radom variables- Iequalities, CLT Puramrita Sarkar Departmet of Statistics ad Data Sciece The Uiversity of Texas at Austi www.cs.cmu.edu/

More information

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

Information-based Feature Selection

Information-based Feature Selection Iformatio-based Feature Selectio Farza Faria, Abbas Kazeroui, Afshi Babveyh Email: {faria,abbask,afshib}@staford.edu 1 Itroductio Feature selectio is a topic of great iterest i applicatios dealig with

More information

Linear Algebra Issues in Wireless Communications

Linear Algebra Issues in Wireless Communications Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of

More information

HOMEWORK I: PREREQUISITES FROM MATH 727

HOMEWORK I: PREREQUISITES FROM MATH 727 HOMEWORK I: PREREQUISITES FROM MATH 727 Questio. Let X, X 2,... be idepedet expoetial radom variables with mea µ. (a) Show that for Z +, we have EX µ!. (b) Show that almost surely, X + + X (c) Fid the

More information

On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities

On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities O Equivalece of Martigale Tail Bouds ad Determiistic Regret Iequalities Sasha Rakhli Departmet of Statistics, The Wharto School Uiversity of Pesylvaia Dec 16, 2015 Joit work with K. Sridhara arxiv:1510.03925

More information

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001. Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;

More information

In this section we derive some finite-sample properties of the OLS estimator. b is an estimator of β. It is a function of the random sample data.

In this section we derive some finite-sample properties of the OLS estimator. b is an estimator of β. It is a function of the random sample data. 17 3. OLS Part III I this sectio we derive some fiite-sample properties of the OLS estimator. 3.1 The Samplig Distributio of the OLS Estimator y = Xβ + ε ; ε ~ N[0, σ 2 I ] b = (X X) 1 X y = f(y) ε is

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

A Study of Capacity and Spectral Efficiency of Fiber Channels

A Study of Capacity and Spectral Efficiency of Fiber Channels A Study of Capacity ad Spectral Efficiecy of Fiber Chaels Gerhard Kramer (TUM) based o joit work with Masoor Yousefi (TUM) ad Frak Kschischag (Uiv. Toroto) MIO Workshop Muich, Germay December 8, 2015 Istitute

More information

Parameter, Statistic and Random Samples

Parameter, Statistic and Random Samples Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

Refinement of Two Fundamental Tools in Information Theory

Refinement of Two Fundamental Tools in Information Theory Refiemet of Two Fudametal Tools i Iformatio Theory Raymod W. Yeug Istitute of Network Codig The Chiese Uiversity of Hog Kog Joit work with Siu Wai Ho ad Sergio Verdu Discotiuity of Shao s Iformatio Measures

More information