# Grover s Algorithm + Quantum Zeno Effect + Vaidman

Size: px
Start display at page:

Transcription

1 Grover s Algorthm + Quantum Zeno Effect + Vadman CS Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the two dmensonal subspace that conssts of two states: the target state a and ψ 0 x 1 x Start wth the state ψ 0, and repeat for O( () steps: reflect about a and then reflect about ψ 0 To mplement the reflecton about ψ 0, we use the Dffuson operator D (assume 2 n ), whch wors as follows Frst, apply H 2 n, whch maps ψ Then reflect around 000 Fnally, apply H 2 n to return to the orgnal bass (ote that ths s smply a reflecton around the zero vector n the Hadamard bass) Let s wrte out ths dffuson operator explctly to gve another way of understandng Grover s algorthm: Clam: The Dffuson operator D has two propertes: 1 It s untary and can be effcently realzed 2 It can be seen as an nverson about the mean Proof: 1 For 2 n, D can be decomposed and rewrtten as: D H H H + I H H H + I 2/ 2/ 2/ 2/ 2/ 2/ + I 2/ 2/ 2/ CS 294-2, Fall 2004, Lecture

2 2/ + 1 2/ 2/ 2/ 2/ + 1 2/ 2/ 2/ 2/ + 1 Observe that D s expressed as the product of three untary matrces (two Hadamard matrces separated by a condtonal phase shft matrx) Therefore, D s also untary Regardng the mplementaton, both the Hadamard and the condtonal phase shft transforms can be effcently realzed wthn O(n) gates 2 Consder D operatng on a vector α to generate another vector β : D α 1 α If we let be the mean ampltude, then the expresson 2 descrbes a reflecton of about the mean Thus, the ampltude of β 2 j α j can be consdered an nverson about the mean wth respect to β 1 β β The quantum search algorthm teratvely mproves the probablty of measurng a soluton Here s how: 1 Start state s ψ 0 x 1 x 2 Invert the phase of a usng f 3 Then nvert about the mean usng D 4 Repeat steps 2 and 3 O( ) tmes, so n each teraton α a ncreases by 2 Ths process s llustrated n Fgure 01 Suppose we just want to fnd a wth probablty 2 1 Untl ths pont, the rest of the bass vectors wll have ampltude at 1 least 2 2 In each teraton of the algorthm, α a ncreases by at least 2 2 Eventually, α a 1 2 The number of teratons to get to ths α a s More applcatons Grover s algorthm s often called a database search algorthm, where you can query n superposton Other thngs you can do wth a smlar approach: 1 Fnd the mnmum 2 Approxmately count elements, or generate random ones 3 Speed up the collson problem 4 Speed up the test for matrx multplcaton In ths problem we are gven three matrces, A, B, and C, and are told that the product of the frst two equals the thrd We wsh to verfy that ths s ndeed true An effcent (randomzed) way of dong ths s pcng a random array r, and checng to see whether Cr ABr A(Br) Classcally, we can do the chec n O(n 2 ) tme, but usng a smlar approach to Grover s algorthm we can speed t up to O(n 175 ) tme CS 294-2, Fall 2004, Lecture

3 (a) (b) (c) Fgure 01: The frst three steps of Grover s algorthm We start wth a unform superposton of all bass vectors n (a) In (b), we have used the functon f to nvert the phase of α After runnng the dffuson operator D, we amplfy α whle decreasng all other ampltudes CS 294-2, Fall 2004, Lecture

4 φ 0 R θ 0 U M R θ 0 U M Fgure 02: Ths fgure shows the crcut used for fndng a bomb There are steps, and n each step we rotate the control bt and run U Vadman s Bomb To llustrate some of the concepts behnd Grover s algorthm, we ll brefly consder a problem nown as Vadman s bomb In ths problem, we have a pacage that may or may not contan a bomb However, the bomb s so senstve that smply loong to see f the bomb exsts wll cause t to explode So, can we determne whether the pacage contans a bomb wthout settng t off? Paradoxcally, quantum mechancs says that we can In partcular, we wll demonstrate that there s a sequence of measurements such that f the pacage contans a bomb, we wll loo wth probablty 1/, and f the pacage does not contan a bomb, we wll loo wth certanty The Quantum Zeno Effect To acheve ths goal, we ll tae advantage of a phenomenon nown as the Quantum Zeno Effect (also referred to as the watched pot or the watchdog effect) Consder a quantum state consstng of a sngle qubt Ths qubt starts at 0, and at every step we wll rotate t toward 1 by θ π/2 After one rotaton, we have φ α 0 + β 1, where β sn θ 1/ After steps, the state wll be 1, so any measurement wll return 1 wth hgh probablty ow what f we decde to measure the state after each rotaton? After the frst rotaton, we wll measure 0 wth hgh probablty, but ths measurement collapses the state bac to 0 Thus, each measurement has a hgh probablty of yeldng 0 ; the probablty of gettng 1 by the end s approxmately 1 1 2, as opposed to the extremely hgh probablty n the prevous case Essentally, the Quantum Zeno Effect says that f we have a quantum state that s n transton toward a dfferent state, mang frequent measurements can delay that transton by repeatedly collapsng the qubt bac to ts orgnal state Loong for the Bomb To determne whether Vadman s bomb exsts wthout actually loong at t, we want to tae advantage of the Quantum Zeno Effect We ll have a control qubt that ndcates whether or not we plan to loo at the contents of the pacage, and we ll have a measurement that collapses ths qubt bac to 0 n the case that a bomb s present We ll assume that we have a devce that can measure whether a bomb s present We wll model ths devce as a quantum crcut U that has one nput (the control qubt φ ) and one output (a qubt that s 1 f a bomb s defntely present) If there s no bomb, then U maps φ 0 φ 0 ; n other words, U behaves as the dentty If there s a bomb, then U maps (there s a bomb, but we ddn t loo) and (we looed at the bomb); that s, U behaves as a COT gate We want to fgure out whether there s a bomb (e, we want to test U s behavor) wthout settng off the bomb very often Fgure 02 shows the crcut we wll use We ntalze the control qubt φ to 0 In each step of the algorthm, we rotate the control qubt toward 1 by θ and then run U; we ll execute the algorthm for steps Consder the case where there s no bomb; our ntal nput s 0 0 If we rotate the control qubt by θ, the nput to the frst U gate s (α 0 +β 1 ) 0, and the output of U s the same state (snce U s the dentty) Measurng the output qubt always returns 0 and doesn t alter the state; thus, each step rotates the qubt further untl β 1 at the last measurement ow consder the case where there s a bomb Once agan, our ntal nput s 00 After the frst rotaton, the nput to CS 294-2, Fall 2004, Lecture

5 U s (α 0 +β 1 ) 0, and the output of U s α 0 0 +β 1 1 When we measure the last qubt, we have a β 2 1/ 2 probablty of loong at the bomb and settng t off Otherwse, we measure 0 for the output qubt, whch means we ddn t loo at the bomb However, ths measurement collapses the state bac to 0 0 Thus, subsequent steps n the algorthm wll smply repeat ths process Overall, we only have a β 2 1/ chance of actually loong at the bomb Vadman and Grover To see the relatonshp to Grover s algorthm, consder a partcularly unfortunate case where we have pacages, 1 of whch contan bombs We want to fnd the one pacage that does not contan a bomb, though we don t mnd settng off a few of the bombs n the process Grover s algorthm has a property smlar to Vadman s method where the ampltude of one target bass vector s amplfed whle all others are constantly dmnshed or reset The mportant thng to note s that t s hghly counterntutve to be able to search n steps By queryng n superposton, we manage to search usng fewer steps than there are locatons to search! CS 294-2, Fall 2004, Lecture

### Quadratic speedup for unstructured search - Grover s Al-

Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed

### Chapter Newton s Method

Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

### 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

### C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

### Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

### 1 GSW Iterative Techniques for y = Ax

1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

### THEOREMS OF QUANTUM MECHANICS

THEOREMS OF QUANTUM MECHANICS In order to develop methods to treat many-electron systems (atoms & molecules), many of the theorems of quantum mechancs are useful. Useful Notaton The matrx element A mn

### Lecture 12: Discrete Laplacian

Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

### Density matrix. c α (t)φ α (q)

Densty matrx Note: ths s supplementary materal. I strongly recommend that you read t for your own nterest. I beleve t wll help wth understandng the quantum ensembles, but t s not necessary to know t n

### Lecture 10: May 6, 2013

TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

### Problem Set 9 Solutions

Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

### EEE 241: Linear Systems

EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

### Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

### 18.1 Introduction and Recap

CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

### Finding Dense Subgraphs in G(n, 1/2)

Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

### Lecture Notes on Linear Regression

Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

### Economics 101. Lecture 4 - Equilibrium and Efficiency

Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

### EN40: Dynamics and Vibrations. Homework 7: Rigid Body Kinematics

N40: ynamcs and Vbratons Homewor 7: Rgd Body Knematcs School of ngneerng Brown Unversty 1. In the fgure below, bar AB rotates counterclocwse at 4 rad/s. What are the angular veloctes of bars BC and C?.

### 2.3 Nilpotent endomorphisms

s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

### 14 The Postulates of Quantum mechanics

14 The Postulates of Quantum mechancs Postulate 1: The state of a system s descrbed completely n terms of a state vector Ψ(r, t), whch s quadratcally ntegrable. Postulate 2: To every physcally observable

### 10-701/ Machine Learning, Fall 2005 Homework 3

10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40

### Foundations of Arithmetic

Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

### Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be

### 10.34 Fall 2015 Metropolis Monte Carlo Algorithm

10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of

### Assortment Optimization under MNL

Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

### Errors for Linear Systems

Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons Â and ˆb avalable. Then the best thng we can do s to solve Âˆx ˆb exactly whch

### IV. Performance Optimization

IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton

### ECEN 5005 Crystals, Nanocrystals and Device Applications Class 19 Group Theory For Crystals

ECEN 5005 Crystals, Nanocrystals and Devce Applcatons Class 9 Group Theory For Crystals Dee Dagram Radatve Transton Probablty Wgner-Ecart Theorem Selecton Rule Dee Dagram Expermentally determned energy

### Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013

1 Ph 219a/CS 219a Exercses Due: Wednesday 23 October 2013 1.1 How far apart are two quantum states? Consder two quantum states descrbed by densty operators ρ and ρ n an N-dmensonal Hlbert space, and consder

### Quantum Mechanics for Scientists and Engineers. David Miller

Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons

### Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

### Difference Equations

Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

### Note on EM-training of IBM-model 1

Note on EM-tranng of IBM-model INF58 Language Technologcal Applcatons, Fall The sldes on ths subject (nf58 6.pdf) ncludng the example seem nsuffcent to gve a good grasp of what s gong on. Hence here are

### Min Cut, Fast Cut, Polynomial Identities

Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.

### APPENDIX A Some Linear Algebra

APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

### Lecture Space-Bounded Derandomization

Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval

### Linear Feature Engineering 11

Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

### Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

### THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

### THE SUMMATION NOTATION Ʃ

Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the

### Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

### Supporting Information

Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to

### 5 The Rational Canonical Form

5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

### College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

### U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

### 5.04, Principles of Inorganic Chemistry II MIT Department of Chemistry Lecture 32: Vibrational Spectroscopy and the IR

5.0, Prncples of Inorganc Chemstry II MIT Department of Chemstry Lecture 3: Vbratonal Spectroscopy and the IR Vbratonal spectroscopy s confned to the 00-5000 cm - spectral regon. The absorpton of a photon

### Calculation of time complexity (3%)

Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

### n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

### This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors

### ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

### THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall

### Lecture 2: Gram-Schmidt Vectors and the LLL Algorithm

NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to

### Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

### Module 9. Lecture 6. Duality in Assignment Problems

Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

### CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

### Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

### Lecture 4: Constant Time SVD Approximation

Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),

### C/CS/Phys C191 Amplitude Amplification, Quantum Zeno, Vaidman s bomb 11/10/09 Fall 2009 Lecture 22

C/CS/Phys C191 Amplitude Amplification, Quantum Zeno, Vaidman s bomb 11/10/09 Fall 2009 Lecture 22 1 Readings Kaye et al, Ch 83 Nielsen and Chuang: Ch 63-65 Grover s algorithm and amplitude amplification:

### Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

### arxiv: v1 [quant-ph] 6 Sep 2007

An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.

### Pauli measurements are universal

QPL 2005 Prelmnary Verson Paul measurements are unversal Vncent Danos 1 CNRS & Unversté Pars 7 Elham Kashef 2 IQC & Unversty of Waterloo Abstract We show that a varant of the one-way model where one only

### More metrics on cartesian products

More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

### CHAPTER 14 GENERAL PERTURBATION THEORY

CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves

### Notes on Frequency Estimation in Data Streams

Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

### Random Walks on Digraphs

Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

### Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

### The Order Relation and Trace Inequalities for. Hermitian Operators

Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

### Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

### Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

### Solution 1 for USTC class Physics of Quantum Information

Soluton 1 for 017 018 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and

### Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

### Turbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH

Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant

### 1 Matrix representations of canonical matrices

1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

### Hashing. Alexandra Stefan

Hashng Alexandra Stefan 1 Hash tables Tables Drect access table (or key-ndex table): key => ndex Hash table: key => hash value => ndex Man components Hash functon Collson resoluton Dfferent keys mapped

### Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

### Learning Theory: Lecture Notes

Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be

### Exercises. 18 Algorithms

18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)

### Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

### COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

### 763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator Â are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)

### A 2D Bounded Linear Program (H,c) 2D Linear Programming

A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded

### Time-Varying Systems and Computations Lecture 6

Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

### ESCI 341 Atmospheric Thermodynamics Lesson 10 The Physical Meaning of Entropy

ESCI 341 Atmospherc Thermodynamcs Lesson 10 The Physcal Meanng of Entropy References: An Introducton to Statstcal Thermodynamcs, T.L. Hll An Introducton to Thermodynamcs and Thermostatstcs, H.B. Callen

### PHYS 705: Classical Mechanics. Calculus of Variations II

1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

H 45 Quantum Measurement and Spn Wnter 003 Ensten-odolsky-Rosen aradox The Ensten-odolsky-Rosen aradox s a gedanken experment desgned to show that quantum mechancs s an ncomplete descrpton of realty. The

### Section 8.3 Polar Form of Complex Numbers

80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

### Solution 1 for USTC class Physics of Quantum Information

Soluton 1 for 018 019 USTC class Physcs of Quantum Informaton Shua Zhao, Xn-Yu Xu and Ka Chen Natonal Laboratory for Physcal Scences at Mcroscale and Department of Modern Physcs, Unversty of Scence and

### Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

### Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

### Lecture 5 September 17, 2015

CS 229r: Algorthms for Bg Data Fall 205 Prof. Jelan Nelson Lecture 5 September 7, 205 Scrbe: Yakr Reshef Recap and overvew Last tme we dscussed the problem of norm estmaton for p-norms wth p > 2. We had

### princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

### Note 10. Modeling and Simulation of Dynamic Systems

Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

### Robert Eisberg Second edition CH 09 Multielectron atoms ground states and x-ray excitations

Quantum Physcs 量 理 Robert Esberg Second edton CH 09 Multelectron atoms ground states and x-ray exctatons 9-01 By gong through the procedure ndcated n the text, develop the tme-ndependent Schroednger equaton

### STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

### Poisson brackets and canonical transformations

rof O B Wrght Mechancs Notes osson brackets and canoncal transformatons osson Brackets Consder an arbtrary functon f f ( qp t) df f f f q p q p t But q p p where ( qp ) pq q df f f f p q q p t In order

### = = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

### The Geometry of Logit and Probit

The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.