Extended nonlocal games from quantum-classical games
|
|
- Darren Murphy
- 5 years ago
- Views:
Transcription
1 Extended nonlocl gmes from quntum-clssicl gmes Theory Seminr incent Russo niversity of Wterloo October 17, 2016
2 Outline Extended nonlocl gmes nd quntum-clssicl gmes Entngled vlues nd the dimension of entnglement Discussion Further work 2/34
3 Extended nonlocl gmes nd quntum-clssicl gmes 3/34
4 Extended nonlocl gmes An extended nonlocl gme (ENLG) is specified by: R x A R 0 R 1 y b B A probbility distribution π : X Y [0, 1] for lphbets X nd Y. A collection of mesurement opertors {P,b,x,y : A, b B, x X, y Y } Pos(R) where R is the spce corresponding to R nd A, B re lphbets. 4/34
5 Extended nonlocl gmes An (ENLG) is plyed in the following mnner: R x A R 0 R 1 y b B 1. Alice nd Bob present referee with register R. 2. Referee genertes (x, y) X Y ccording to π nd sends x to Alice nd y to Bob. Alice responds with nd Bob with b. 3. Referee mesures R w.r.t. mesurement {P,b,x,y, 1 P,b,x,y }. Outcome is either loss or win. 5/34
6 Entngled strtegies for ENLGs For n ENLG, n entngled strtegy consists of complex Eucliden spces R,, nd s well s Shred stte: D( R ), Mesurements: {A x } Pos(), {B y b } Pos(). 6/34
7 Entngled strtegies for ENLGs For n ENLG, n entngled strtegy consists of complex Eucliden spces R,, nd s well s Shred stte: D( R ), Mesurements: {A x } Pos(), {B y b } Pos(). Winning probbility for n entngled strtegy is given by: p = π(x, y) A x P,b,x,y B yb,. (x,y) X Y (,b) A B 6/34
8 Extended nonlocl gmes: Winning nd losing probbilities At the end of the protocol, the referee hs: 1. The stte t the end of the protocol: x,y,b D(R). 2. A mesurement the referee mkes on its prt of the stte ρ: P,b,x,y Pos(R). The respective winning nd losing probbilities re given by P,b,x,y, x,y,b nd 1 P,b,x,y, x,y,b. 7/34
9 Entngled vlues of ENLGs For ny ENLG denoted s H, the entngled vlue of H, denoted s ω (H), represents the supremum of the winning probbilities tken over ll entngled strtegies. We my lso write ωn (H) to denote the mximum winning probbility tken over ll entngled strtegies for which dim( ) N, so tht the entngled vlue of H is ω (H) = lim N ω N (H). 8/34
10 ENLGs nd steering ENLGs re ctully equivlent formultions of prticulr type of triprtite steering. Einstein, Podolsky, Rosen (1935): Cn Quntum-Mechnicl Description of Physicl Relity be Considered Complete? 9/34
11 ENLGs nd steering ENLGs re ctully equivlent formultions of prticulr type of triprtite steering. Biprtite steering ws initilly introduced by Schrödinger in 1936 in n ttempt to mke forml the spooky ction t distnce s discussed in the EPR pper Einstein, Podolsky, Rosen (1935): Cn Quntum-Mechnicl Description of Physicl Relity be Considered Complete? 9/34
12 Biprtite steering Alice nd Bob ech receive prt of quntum stte (sent by the referee). Their gol is to determine whether this stte is entngled. x A R 0 R 1 B Bob s mesurement device is trusted, wheres Alice s is not: Outcome of Alice s mesurements re only ±1 ( conclusive outcome) or 0 ( non-conclusive outcome). To demonstrte entnglement, Alice needs to steer Bob s stte by her choice of mesurement. 10/34
13 NLGs, ENLGs, nd steering Biprtite steering: A x R0 R 1 B 11/34
14 NLGs, ENLGs, nd steering Biprtite steering: A x R0 R 1 B Biprtite nonlocl gme: A x R0 R 1 y b B 11/34
15 NLGs, ENLGs, nd steering Biprtite steering: A x R0 R 1 Triprtite steering with two untrusted prties (ENLG): x R A R0 R 1 B y b Biprtite nonlocl gme: A x B R0 R 1 y b B 11/34
16 NLGs, ENLGs, nd steering Biprtite steering: A x R0 R 1 Triprtite steering with two untrusted prties (ENLG): x R A R0 R 1 B y b Biprtite nonlocl gme: A x R0 R 1 y b B Triprtite steering with one untrusted prty: R A x B R0 R 1 B 11/34
17 ENLG nd steering Triprtite steering; sme thing s before, only now we hve three prties where two members re untrusted nd one member is trusted. 12/34
18 ENLG nd steering Triprtite steering; sme thing s before, only now we hve three prties where two members re untrusted nd one member is trusted. In triprtite steering, Alice nd Bob re the untrusted prties, nd the referee is the trusted prty. 12/34
19 ENLG nd steering Triprtite steering; sme thing s before, only now we hve three prties where two members re untrusted nd one member is trusted. In triprtite steering, Alice nd Bob re the untrusted prties, nd the referee is the trusted prty. This isn t tlk on steering, but it s helpful to note tht proving something using ENLGs will lso sy something bout prticulr type of triprtite steering. 12/34
20 Quntum-clssicl gmes A quntum-clssicl gme (QCG) is coopertive gme plyed between Alice nd Bob ginst referee. X A S R 0 R 1 Y b B Specified by: A stte ρ D(X S Y) in registers (X, S, Y). Collection of mesurement opertors {Q,b : A, b B} Pos(S) for lphbets A nd B. 13/34
21 Quntum-clssicl gmes A (QCG) is plyed in the following mnner. X A S R 0 R 1 Y b B 1. Referee prepres (X, S, Y) in stte ρ nd sends X to Alice nd Y to Bob. 2. Alice responds with A nd Bob with b B. 3. Referee mesures S w.r.t. mesurement {Q,b, 1 Q,b }. The outcome of this mesurement results in 0 or 1, indicting loss or win. 14/34
22 Entngled strtegies for QCGs For QCG, n entngled strtegy consists of complex Eucliden spces nd s well s Shred stte: D( ), Mesurements: {A : A} Pos( X ), {B b : b B} Pos( Y). 15/34
23 Entngled strtegies for QCGs For QCG, n entngled strtegy consists of complex Eucliden spces nd s well s Shred stte: D( ), Mesurements: {A : A} Pos( X ), {B b : b B} Pos( Y). Winning probbility for entngled strtegy is given by: p = A Q,b B b, W ( ρ) W, (,b) A B where W is the unitry opertor tht corresponds to the nturl re-ordering of registers consistent with the tensor product opertors. 15/34
24 Entngled vlues for QCGs For ny QCG denoted s G, the entngled vlue of G, denoted s ω (G), represents the supremum of the winning probbilities tken over ll entngled strtegies. We my lso write ωn (G) to denote the mximum winning probbility tken over ll entngled strtegies for which dim( ) N, so tht the entngled vlue of G is ω (G) = lim N ω N (G). 16/34
25 Entngled vlues nd the dimension of entnglement 17/34
26 lues nd the dimension of shred entnglement Question: Does the dimensionlity of the stte tht Alice nd Bob shre determine how well Alice nd Bob perform? Regev, idick (2012): Quntum XOR gmes 18/34
27 lues nd the dimension of shred entnglement Question: Does the dimensionlity of the stte tht Alice nd Bob shre determine how well Alice nd Bob perform? Prtil nswer: In [Regev,idick (2012)], the uthors showed tht there exists specific clss of QCG such tht if the dimension of Alice nd Bob s quntum system, N, is finite then ωn (G) < 1, but ω (G) = 1. Regev, idick (2012): Quntum XOR gmes 18/34
28 lues nd the dimension of shred entnglement Question: Does the dimensionlity of the stte tht Alice nd Bob shre determine how well Alice nd Bob perform? Prtil nswer: In [Regev,idick (2012)], the uthors showed tht there exists specific clss of QCG such tht if the dimension of Alice nd Bob s quntum system, N, is finite then ωn (G) < 1, but ω (G) = 1. Wht bout ENLG? Regev, idick (2012): Quntum XOR gmes 18/34
29 Reltionship between ENLGs nd QCGs Min question: Does there lso exist n ENLG, H, such tht ω (H) = 1 nd ωn (H) < 1 when N is finite? 19/34
30 Reltionship between ENLGs nd QCGs Min question: Does there lso exist n ENLG, H, such tht ω (H) = 1 nd ωn (H) < 1 when N is finite? It is possible to construct n ENLG from ny QCG (not obvious). X A x R A S R0 R 1 R0 R 1 Y b y b B B 19/34
31 Reltionship between ENLGs nd QCGs Min question: Does there lso exist n ENLG, H, such tht ω (H) = 1 nd ωn (H) < 1 when N is finite? It is possible to construct n ENLG from ny QCG (not obvious). X A x R A S R0 R 1 R0 R 1 Y b y b B B From this construction, it turns out tht this property lso holds for ENLG, tht is, there does exist n ENLG such tht Alice nd Bob cn only win with certinty iff they shre n infinite-dimensionl stte. 19/34
32 Constructing ENLGs from QCGs Generl ide: Given strtegy for QCG, G, show tht it s possible to dpt this strtegy for n ENLG, H, nd vice-vers. Approch: Show tht for n rbitrry nd fixed strtegy for G, tht it s possible to dpt this strtegy for H. Show tht Alice nd Bob cnnot do ny better. 20/34
33 Key ide (for one direction of proof) Show tht for n rbitrry nd fixed strtegy for G, tht it s possible to dpt this strtegy for H. 21/34
34 Key ide (for one direction of proof) Show tht for n rbitrry nd fixed strtegy for G, tht it s possible to dpt this strtegy for H. Min restriction: In G, the referee is sending quntum registers, but in H, the referee is restricted to sending clssicl questions. X A x R A S R0 R 1 R0 R 1 Y b y b B B 21/34
35 Key ide (for one direction of proof) Show tht for n rbitrry nd fixed strtegy for G, tht it s possible to dpt this strtegy for H. Min restriction: In G, the referee is sending quntum registers, but in H, the referee is restricted to sending clssicl questions. X A x R A S R0 R 1 R0 R 1 Y b y b B B Key ide: se teleporttion to trnsmit X nd Y in gme H. 21/34
36 Attempt 1: Adpting vi teleporttion Protocol: 1. Alice nd Bob prepre ρ D( (X Y) ) in registers (, X, Y, ) such tht Alice/Ref nd Bob/Ref shre pirs of mximlly entngled sttes. 2. Referee desires to trnsmit sttes tht he cretes held in X nd Y to Alice nd Bob. To do so, he mesures (X, X ) nd (Y, Y ) in the Bell bsis to generte nd send (x, y) to Alice nd Bob. 3. Alice nd Bob complete the teleporttion protocol by pplying pproprite unitries to their system bsed on (x, y). 22/34
37 Attempt 1: Adpting vi teleporttion Protocol: 1. Alice nd Bob prepre ρ D( (X Y) ) in registers (, X, Y, ) such tht Alice/Ref nd Bob/Ref shre pirs of mximlly entngled sttes. 2. Referee desires to trnsmit sttes tht he cretes held in X nd Y to Alice nd Bob. To do so, he mesures (X, X ) nd (Y, Y ) in the Bell bsis to generte nd send (x, y) to Alice nd Bob. 3. Alice nd Bob complete the teleporttion protocol by pplying pproprite unitries to their system bsed on (x, y). Problem: The definition of n ENLG requires tht questions (x, y) re generted rndomly. 22/34
38 Attempt 2: Post-selected teleporttion protocol for H Problem: nill teleporttion is not enough (the questions (x, y) need to be generted independent of the stte of registers (X, Y)). 23/34
39 Attempt 2: Post-selected teleporttion protocol for H Problem: nill teleporttion is not enough (the questions (x, y) need to be generted independent of the stte of registers (X, Y)). Ide: Let (x, y) be selected t rndom, but then compre (x, y) to hypotheticl mesurement results tht would be obtined if the referee were to perform teleporttion. 23/34
40 Post-selected teleporttion protocol for H x A 1 x A 0 X X T x 1? = δ x,x1 R 0 S R 1 Y δ y,y1 B 0 Y y T y 1? = y B 1 b 24/34
41 Step 1: Post-selected teleporttion protocol for H Alice nd Bob prepre D( (X Y) ). A 0 X T B 0 Y T 25/34
42 Step 2: Post-selected teleporttion protocol for H Referee rndomly selects nd sends (x, y); keeps locl copy. Alice nd Bob respond with (, b). x A 1 x A 0 X T? = R 1 B 0 Y y T? = y B 1 b 26/34
43 Step 3: Post-selected teleporttion protocol for H Referee prepres ρ D(X S Y ). Performs teleporttion using (X, X ) nd (Y, Y ) resulting in outcomes (x 1, y 1 ). x A 1 x A 0 X X T x 1? = R 0 S R 1 Y B 0 Y y T y 1? = y B 1 b 27/34
44 Step 4: Post-selected teleporttion protocol for H 1. If x x 1 or y y 1 : teleporttion fils; Alice nd Bob win. 2. If x = x 1 nd y = y 1 : teleporttion succeeds; Referee mesures w.r.t. {P,b,x,y, 1 P,b,x,y }. x A 1 x A 0 X X T x 1? = δ x,x1 R 0 S R 1 Y δ y,y1 B 0 Y y T y 1? = y B 1 b 28/34
45 Discussion 29/34
46 Similr result for nonlocl gmes? Our result: There exists some ENLG such tht ω N (H) < 1 nd ω (H) = 1. Tht is, for certin ENLG, incresing mounts of entnglement yield higher winning probbilities. 30/34
47 Similr result for nonlocl gmes? Our result: There exists some ENLG such tht ω N (H) < 1 nd ω (H) = 1. Tht is, for certin ENLG, incresing mounts of entnglement yield higher winning probbilities. Known result: There exists some QCG such tht ω N (G) < 1 nd ω (G) = 1. Tht is, for certin QCG, incresing mounts of entnglement yield higher winning probbilities. 30/34
48 Similr result for nonlocl gmes? Our result: There exists some ENLG such tht ω N (H) < 1 nd ω (H) = 1. Tht is, for certin ENLG, incresing mounts of entnglement yield higher winning probbilities. Known result: There exists some QCG such tht ω N (G) < 1 nd ω (G) = 1. Tht is, for certin QCG, incresing mounts of entnglement yield higher winning probbilities. nknown: Does there exist some NLG, G, with similr properties, tht is ω N (G) < 1 nd ω (G) = 1? 30/34
49 ENLGs nd triprtite steering Recll, ENLG my be viewed equivlently s triprtite steering scenrio. 31/34
50 ENLGs nd triprtite steering Recll, ENLG my be viewed equivlently s triprtite steering scenrio. Proving results bout ENLGs gives us corresponding results bout triprtite steering. Wht does our result imply in the context of steering? 31/34
51 ENLGs nd triprtite steering Recll, ENLG my be viewed equivlently s triprtite steering scenrio. Proving results bout ENLGs gives us corresponding results bout triprtite steering. Wht does our result imply in the context of steering? Result: Our result implies the existence of triprtite steering inequlity tht is mximlly violted only by quntum stte with dimension pproching infinity. For ny finite-dimensionl stte, this steering inequlity cnnot be mximlly violted. 31/34
52 Further work 32/34
53 Open questions (Hrd problem): Does there exist ny nonlocl gme, G, such tht ω (G) = 1 nd ωn (G) < 1 for ll N? (More generl): Cn the study of extended nonlocl gmes revel nything further bout the properties of triprtite steering? 33/34
54 34/34 A relted question: Swpping rounds of communiction How powerful is the extended nonlocl gme model? Wht hppens when you substitute clssicl for quntum rounds of communiction or vice-vers? R0 R 1 A B R x y b R0 R 1 A B R x y E F R0 R 1 A B R C D b R0 R 1 A B R C D E F
55 Thnks Thnks for listening! This work is primrily bsed on: N. Johnston, R. Mittl,. R., J. Wtrous. Extended nonlocl gmes nd monogmy-of-entnglement gmes. Proc. R. Soc. A 472: , R., J. Wtrous. Extended nonlocl gmes from quntum-clssicl gmes. In preprtion. 34/34
Local orthogonality: a multipartite principle for (quantum) correlations
Locl orthogonlity: multiprtite principle for (quntum) correltions Antonio Acín ICREA Professor t ICFO-Institut de Ciencies Fotoniques, Brcelon Cusl Structure in Quntum Theory, Bensque, Spin, June 2013
More informationQuantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16
Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture
More informationLecture Notes PH 411/511 ECE 598 A. La Rosa Portland State University INTRODUCTION TO QUANTUM MECHANICS
Lecture Notes PH 4/5 ECE 598. L Ros Portlnd Stte University INTRODUCTION TO QUNTUM MECHNICS Underlying subject of the PROJECT ssignment: QUNTUM ENTNGLEMENT Fundmentls: EPR s view on the completeness of
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More informationMeasurement-Only Topological Quantum Computation
Mesurement-Only Topologicl Quntum Computtion Prs Bonderson Microsoft Sttion Q University of Virgini Condensed Mtter Seminr October, 8 work done in collbortion with: Mike Freedmn nd Chetn Nyk rxiv:8.79
More informationPhysics 137A - Quantum Mechanics - Spring 2018 Midterm 1. Mathematical Formulas
Copyright c 8 by Austin J. Hedemn Physics 7A - Quntum Mechnics - Spring 8 Midterm Mondy, Februry 6, 6:-8: PM You hve two hours, thirty minutes for the exm. All nswers should be written in blue book. You
More informationSufficient condition on noise correlations for scalable quantum computing
Sufficient condition on noise correltions for sclble quntum computing John Presill, 2 Februry 202 Is quntum computing sclble? The ccurcy threshold theorem for quntum computtion estblishes tht sclbility
More informationEntanglement Purification
Lecture Note Entnglement Purifiction Jin-Wei Pn 6.5. Introduction( Both long distnce quntum teleporttion or glol quntum key distriution need to distriute certin supply of pirs of prticles in mximlly entngled
More informationLecture 3 Gaussian Probability Distribution
Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationPh 219b/CS 219b. Exercises Due: Wednesday 9 March 2016
1 Ph 219b/CS 219b Eercises Due: Wednesdy 9 Mrch 2016 3.1 Positivity of quntum reltive entropy ) Show tht ln 1 for ll positive rel, with equlity iff = 1. b) The (clssicl) reltive entropy of probbility distribution
More informationC/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6
C/CS/Phys C9 Bell Inequlities, o Cloning, Teleporttion 9/3/7 Fll 7 Lecture 6 Redings Benenti, Csti, nd Strini: o Cloning Ch.4. Teleporttion Ch. 4.5 Bell inequlities See lecture notes from H. Muchi, Cltech,
More informationName Solutions to Test 3 November 8, 2017
Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationarxiv: v1 [quant-ph] 27 May 2015
Clssicl Verifiction of Quntum Proofs rxiv:1505.0743v1 [qunt-ph] 7 My 015 Zhengfeng Ji Institute for Quntum Computing nd School of Computer Science, University of Wterloo, Wterloo, Ontrio, Cnd Stte Key
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationAnalyzing Quantum Coin-Flipping Protocols using Optimization Techniques
Anlyzing Quntum Coin-Fliing Protocols using Otimiztion Techniques Jmie Sikor (Université Pris 7, Frnce) joint work with Ashwin Nyk (University of Wterloo, Cnd) Levent Tunçel (University of Wterloo, Cnd)
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationCS667 Lecture 6: Monte Carlo Integration 02/10/05
CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of
More informationAnalytical Methods Exam: Preparatory Exercises
Anlyticl Methods Exm: Preprtory Exercises Question. Wht does it men tht (X, F, µ) is mesure spce? Show tht µ is monotone, tht is: if E F re mesurble sets then µ(e) µ(f). Question. Discuss if ech of the
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More informationMATH362 Fundamentals of Mathematical Finance
MATH362 Fundmentls of Mthemticl Finnce Solution to Homework Three Fll, 2007 Course Instructor: Prof. Y.K. Kwok. If outcome j occurs, then the gin is given by G j = g ij α i, + d where α i = i + d i We
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationReinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationPHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS
PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS To strt on tensor clculus, we need to define differentition on mnifold.a good question to sk is if the prtil derivtive of tensor tensor on mnifold?
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationCAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.
Exmintion 1 Posted 23 October 2002. Due no lter thn 5pm on Mondy, 28 October 2002. Instructions: 1. Time limit: 3 uninterrupted hours. 2. There re four questions, plus bonus. Do not look t them until you
More informationMassachusetts Institute of Technology Quantum Mechanics I (8.04) Spring 2005 Solutions to Problem Set 6
Msschusetts Institute of Technology Quntum Mechnics I (8.) Spring 5 Solutions to Problem Set 6 By Kit Mtn. Prctice with delt functions ( points) The Dirc delt function my be defined s such tht () (b) 3
More informationLine and Surface Integrals: An Intuitive Understanding
Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationg i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f
1. Appliction of functionl nlysis to PEs 1.1. Introduction. In this section we give little introduction to prtil differentil equtions. In prticulr we consider the problem u(x) = f(x) x, u(x) = x (1) where
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationPresentation Problems 5
Presenttion Problems 5 21-355 A For these problems, ssume ll sets re subsets of R unless otherwise specified. 1. Let P nd Q be prtitions of [, b] such tht P Q. Then U(f, P ) U(f, Q) nd L(f, P ) L(f, Q).
More informationSTURM-LIOUVILLE THEORY, VARIATIONAL APPROACH
STURM-LIOUVILLE THEORY, VARIATIONAL APPROACH XIAO-BIAO LIN. Qudrtic functionl nd the Euler-Jcobi Eqution The purpose of this note is to study the Sturm-Liouville problem. We use the vritionl problem s
More informationDensity of Energy Stored in the Electric Field
Density of Energy Stored in the Electric Field Deprtment of Physics, Cornell University c Tomás A. Aris October 14, 01 Figure 1: Digrm of Crtesin vortices from René Descrtes Principi philosophie, published
More informationArithmetic & Algebra. NCTM National Conference, 2017
NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationHeat flux and total heat
Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationMeasurement-Only Topological Quantum Computation
Mesurement-Only Topologicl Quntum Computtion Prs Bonderson Microsoft Sttion Q UIUC Workshop on Topologicl Phses of Mtter October 24, 2008 work done in collbortion with: Mike Freedmn nd Chetn Nyk rxiv:0802.0279
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More information( ) 2. ( ) is the Fourier transform of! ( x). ( ) ( ) ( ) = Ae i kx"#t ( ) = 1 2" ( )"( x,t) PC 3101 Quantum Mechanics Section 1
1. 1D Schrödinger Eqution G chpters 3-4. 1.1 the Free Prticle V 0 "( x,t) i = 2 t 2m x,t = Ae i kxt "( x,t) x 2 where = k 2 2m. Normliztion must hppen: 2 x,t = 1 Here, however: " A 2 dx " " As this integrl
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationChapter 5. , r = r 1 r 2 (1) µ = m 1 m 2. r, r 2 = R µ m 2. R(m 1 + m 2 ) + m 2 r = r 1. m 2. r = r 1. R + µ m 1
Tor Kjellsson Stockholm University Chpter 5 5. Strting with the following informtion: R = m r + m r m + m, r = r r we wnt to derive: µ = m m m + m r = R + µ m r, r = R µ m r 3 = µ m R + r, = µ m R r. 4
More informationImproper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.
Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationGraph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory
Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationReinforcement Learning
Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm
More informationThis lecture covers Chapter 8 of HMU: Properties of CFLs
This lecture covers Chpter 8 of HMU: Properties of CFLs Turing Mchine Extensions of Turing Mchines Restrictions of Turing Mchines Additionl Reding: Chpter 8 of HMU. Turing Mchine: Informl Definition B
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationMatrix Eigenvalues and Eigenvectors September 13, 2017
Mtri Eigenvlues nd Eigenvectors September, 7 Mtri Eigenvlues nd Eigenvectors Lrry Cretto Mechnicl Engineering 5A Seminr in Engineering Anlysis September, 7 Outline Review lst lecture Definition of eigenvlues
More informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationReversals of Signal-Posterior Monotonicity for Any Bounded Prior
Reversls of Signl-Posterior Monotonicity for Any Bounded Prior Christopher P. Chmbers Pul J. Hely Abstrct Pul Milgrom (The Bell Journl of Economics, 12(2): 380 391) showed tht if the strict monotone likelihood
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationarxiv: v1 [quant-ph] 19 Dec 2017
Quntum supervlutionist ccount of the EPR prdox Arkdy Bolotin Ben-Gurion University of the Negev, Beersheb (Isrel) December, 17 rxiv:171.6746v1 [qunt-ph] 19 Dec 17 Abstrct In the pper, the EPR prdox is
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box
More informationThe Complexity of Entangled Games. Thomas Vidick
The Complexity of Entngled Gmes by Thoms Vidick A disserttion submitted in prtil stisfction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Grdute Division of the
More informationMAC-solutions of the nonexistent solutions of mathematical physics
Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More informationSESSION 2 Exponential and Logarithmic Functions. Math 30-1 R 3. (Revisit, Review and Revive)
Mth 0-1 R (Revisit, Review nd Revive) SESSION Eponentil nd Logrithmic Functions 1 Eponentil nd Logrithmic Functions Key Concepts The Eponent Lws m n 1 n n m m n m n m mn m m m m mn m m m b n b b b Simplify
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationChapter 3 The Schrödinger Equation and a Particle in a Box
Chpter 3 The Schrödinger Eqution nd Prticle in Bo Bckground: We re finlly ble to introduce the Schrödinger eqution nd the first quntum mechnicl model prticle in bo. This eqution is the bsis of quntum mechnics
More informationFor the percentage of full time students at RCC the symbols would be:
Mth 17/171 Chpter 7- ypothesis Testing with One Smple This chpter is s simple s the previous one, except it is more interesting In this chpter we will test clims concerning the sme prmeters tht we worked
More informationfractions Let s Learn to
5 simple lgebric frctions corne lens pupil retin Norml vision light focused on the retin concve lens Shortsightedness (myopi) light focused in front of the retin Corrected myopi light focused on the retin
More informationRiemann Integrals and the Fundamental Theorem of Calculus
Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationThe steps of the hypothesis test
ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of
More informationLesson 2.4 Exercises, pages
Lesson. Exercises, pges A. Expnd nd simplify. ) + b) ( ) () 0 - ( ) () 0 c) -7 + d) (7) ( ) 7 - + 8 () ( 8). Expnd nd simplify. ) b) - 7 - + 7 7( ) ( ) ( ) 7( 7) 8 (7) P DO NOT COPY.. Multiplying nd Dividing
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More information