# where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

Save this PDF as:
Size: px
Start display at page:

Download "where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b"

## Transcription

1 CS /11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1} n {0,1} m, given s primitive finite olletion of gtes eh of whih implements oolen funtion on k its for some smll k. The piture of the iruit is s follows: i 1 i 2 i 3 i 4 i 5 i n 1 i n 0 1 f o 1 o 2 o 3 o m 1 o m where the ox ontins finite numer of gtes from the given olletion. Exmples of gtes tht re ommonly used re the following: (+) NOT AND NAND NOR There exist finite gte sets tht n e used to implement every multi-output oolen funtion. Suh sets re lled universl gte sets nd the following gte sets n esily e proved universl: {AND, NOT} {OR, NOT} {NAND} {NOR} Every oolen funtion n e implemented using gtes from universl gte set. This implies tht the iruit omplexity (numer of gtes in the minimum iruit) is the sme with respet to ny finite universl gte set up to onstnt ftor. A sutle point when we onsider iruit design is the fn out. In lssil iruits we n tke fn out s grnted, euse fn out is trivilly implemented in lssil relity. However, this is not trivil in quntum mehnis s we ll see shortly. CS 294-2, Fll 2004, Leture 4 1

2 1.2 Quntum Ciruits A quntum iruit implements unitry opertor in Hilert spe C 2n, given s primitive (usully finite) olletion of gtes eh of whih implements unitry opertor on k quits for some smll k. Unitrity implies tht quntum iruits hve the sme numer of inputs nd outputs. The piture of quntum iruit is s follows: i 1 i 2 i 3 i n 1 i n o 1 o 2 o 3 o n 1 o n where the ox ontins finite numer of quntum gtes. Clerly no finite set of gtes n generte ll unitry opertors. If suh set existed, then for ll vlues of θ R we should e le to uilt up quntum iruit for the opertor R θ using gtes from this set. With finite set of gtes tht s impossile. It seems though tht we need notion of pproximtion to define universlity. For tht purpose we ll use the opertor norm whih is defined s B = mx v =1 B v for every opertor B. Using tht mesure the distne etween opertors U nd U will e: U U = mx v =1 (U U ) v nd we ll sy tht opertor U simultes opertor U to within ε if U U ε After the ove definitions it s interesting to see how we define the universlity in quntum mehnis. We shll ll set G of quntum gtes universl if: U (unitry opertor on k quits), ε > 0, g 1,g 2,...,g l G : U U g1 U g2...u gl ε where y U gi ( usge of g i ) we represent the tensor produt of the gte g i with the identity opertor for n pproprite numer of quits so tht U gi is unitry opertor for k quits wheres g i might e unitry opertor for less thn k quits. 1.3 Known Universl Gte Fmilies for Quntum Mehnis The following fmilies of iruits re universl: CNOT, ll 1-quit gtes CNOT gte, Hdmrd gte, suitle phse flips Tofolli gte, Hdmrd gte CS 294-2, Fll 2004, Leture 4 2

3 where the Tofolli gte (or C-CNOT gte for ontrolled-ontrolled NOT gte ) is three-quit gte tht omplements the third it if the first two ontrol its re oth 1. 2 Solovy-Kitev Theorem The Solovy-Kitev theorem sttes the following: If G SU(d) is universl fmily of gtes (where SU(d) is the group of unitry opertors in d-dimensionl Hilert spe), G is losed under inverse (i.e. g G g 1 G) nd G genertes dense suset of SU(d), then U SU(d),ε > 0, g 1,g 2,...,g l G : U U g1 U g2...u gl ε nd l = O(log 2 1/ε) 3 Complexity Clsses - Clss BQP 3.1 Clss P - Polynomil Time A definition of the lss P in terms of iruits is the following: L P iff there is fmily F = { } n N of iruits suh tht: poly(n), n N there is polynomil time Turing Mhine tht on input 1 n outputs (Uniformity Condition) if x = n then (x) = ( L?) x 4 x 5 1 0/1 3.2 Clss BPP - Bounded Error Polynomil Time A definition of the lss BPP in terms of iruits is the following: L BPP iff there is fmily F = { } n N of iruits suh tht: every iruit hs n input x of x = n its nd rndom input r of r = O(poly(n)) its CS 294-2, Fll 2004, Leture 4 3

4 poly(n), n N there is polynomil time Turing Mhine tht on input 1 n outputs (Uniformity Condition) moreover: if x L nd x = n then Pr[ (x,r) = yes ] 2/3 if x / L nd x = n then Pr[ (x,r) = no ] 2/3 input x x = n 1 0/1 rndom string r r = m = O(poly(n)) r 1 r 2 r m 3.3 Clss BQP - Bounded Error Quntum Polynomil Time A definition of the lss BQP in terms of iruits is the following: L BQP iff there is fmily F = { SU(n)} n N of quntum iruits (unitry opertors) suh tht: every iruit hs n input x of x = n its nd m = O(poly(n)) dditionl inputs of vlue 0 > the output of the omputtion is onsidered to e the outome of the mesurement on the first output of the iruit poly(n), n N there is polynomil time Turing Mhine tht on input 1 n outputs (Uniformity Condition) moreover: if x L nd x = n then Pr[mesure = 1] 2/3 if x / L nd x = n then Pr[mesure = 0] 2/3 input x x = n 1 M 0/1 m 0 > 0 > 0 > CS 294-2, Fll 2004, Leture 4 4

5 3.4 Reversiility nd P BQP Quntum evolution is unitry nd every quntum iruit K orresponds to unitry opertor U K in some Hilert spe. U K eing unitry mens tht U K U K = U K U K = I, whih mens tht U K hs n inverse opertor. Thus every quntum iruit is reversile. This is not the se for lssil iruits, however. For exmple if we hve n AND gte, then going from two input its to one output it involves some loss of informtion, whih mkes reversiility infesile. However, strting from nonreversile iruit we n onstrut reversile iruit tht does the sme omputtion ut my require more inputs or outputs thn the initil nonreversile iruit. There re numer of wys to do this nd here we will show how to do it using the ontrolled swp gte (Fredkin gte). The ontrolled swp gte on input (,,) outputs (,,), if = 0, nd (,,), if = 1. It s ovious tht the ontrolled swp gte is the inverse of itself. We use the following nottion for the ontrolled swp gte. =0 =1 Sine the set of lssil gtes {AND,NOT } is universl, every lssil iruit n e uilt using these two gtes, s well s possily fnning out. Thus, in order to prove tht every lssil iruit n e extended to reversile one, we only hve to show tht we n simulte the AND nd NOT gtes, s well s fn out, using the ontrolled swp gte. The extr inputs tht we supposed will ome in hndy. In order to simulte the NOT gte vi the ontrolled swp gte we n give the ltter the triplet (, = 0, = 1) s input. Then t the third output we lwys get. In order to simulte the AND gte vi the ontrolled swp gte we n give the ltter the triplet (,, = 0) s input. Then t the third output we lwys get. Finlly, in order to fn out s permitted in lssil iruits vi the ontrolled swp gte, we n give the ltter the triplet (, = 0, = 1) s input. Then the first nd seond outputs lwys hve the vlue. It s ovious tht the reversile iruit tht orresponds to lssil iruit nd is onstruted in the ove wy will hve extly the sme output s the lssil one on lssil inputs. Thus, the ove onstrution shows s well tht P BQP. CS 294-2, Fll 2004, Leture 4 5

### CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

### CS 573 Automata Theory and Formal Languages

Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

### Section 1.3 Triangles

Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

### Qubit and Quantum Gates

Quit nd Quntum Gtes Shool on Quntum omputing @Ygmi Dy, Lesson 9:-:, Mrh, 5 Eisuke Ae Deprtment of Applied Physis nd Physio-Informtis, nd REST-JST, Keio University From lssil to quntum Informtion is physil

### The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

### Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits

### Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

### Lecture 1 - Introduction and Basic Facts about PDEs

* 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

### Bisimulation, Games & Hennessy Milner logic

Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

### Model Reduction of Finite State Machines by Contraction

Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900

### NON-DETERMINISTIC FSA

Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

### ( ) { } [ ] { } [ ) { } ( ] { }

Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

### Lecture Notes No. 10

2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

### Lecture 6: Coding theory

Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

### CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

### MAT 403 NOTES 4. f + f =

MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn

### Unit 4. Combinational Circuits

Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

### Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

### 22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

### 8 THREE PHASE A.C. CIRCUITS

8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

### Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

### Coalgebra, Lecture 15: Equations for Deterministic Automata

Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

### Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

### Nondeterministic Finite Automata

Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

### Spacetime and the Quantum World Questions Fall 2010

Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

### (a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

### Chapter 4 State-Space Planning

Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

### T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

### Dense Coding, Teleportation, No Cloning

qitd352 Dense Coding, Teleporttion, No Cloning Roert B. Griffiths Version of 8 Ferury 2012 Referenes: NLQI = R. B. Griffiths, Nture nd lotion of quntum informtion Phys. Rev. A 66 (2002) 012311; http://rxiv.org/rhive/qunt-ph/0203058

### Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

### Discrete Structures Lecture 11

Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

### Running an NFA & the subset algorithm (NFA->DFA) CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/

Running n NFA & the suset lgorithm (NFA->DFA) CS 350 Fll 2018 gilry.org/lsses/fll2018/s350/ 1 NFAs operte y simultneously exploring ll pths nd epting if ny pth termintes t n ept stte.!2 Try n exmple: L

### Ellipses. The second type of conic is called an ellipse.

Ellipses The seond type of oni is lled n ellipse. Definition of Ellipse An ellipse is the set of ll points (, y) in plne, the sum of whose distnes from two distint fied points (foi) is onstnt. (, y) d

### Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

### Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

### System Validation (IN4387) November 2, 2012, 14:00-17:00

System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

### MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1. 1 [(y ) 2 + yy + y 2 ] dx,

MATH3403: Green s Funtions, Integrl Equtions nd the Clulus of Vritions 1 Exmples 5 Qu.1 Show tht the extreml funtion of the funtionl I[y] = 1 0 [(y ) + yy + y ] dx, where y(0) = 0 nd y(1) = 1, is y(x)

### , g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

### Logic Synthesis and Verification

Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

### Engr354: Digital Logic Circuits

Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

### Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.

Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,

### Probability. b a b. a b 32.

Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

### INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd

### Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

### Project 6: Minigoals Towards Simplifying and Rewriting Expressions

MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

### Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

### Part 4. Integration (with Proofs)

Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

### Arrow s Impossibility Theorem

Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

### MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES CHARLIE COLLIER UNIVERSITY OF BATH These notes hve been typeset by Chrlie Collier nd re bsed on the leture notes by Adrin Hill nd Thoms Cottrell. These

### Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

### April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

### set is not closed under matrix [ multiplication, ] and does not form a group.

Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

### CS 360 Exam 2 Fall 2014 Name

CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output

### More on automata. Michael George. March 24 April 7, 2014

More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose

### LESSON 11: TRIANGLE FORMULAE

. THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.

### AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

### Designing Information Devices and Systems I Discussion 8B

Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V

### Riemann 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 ɛ >

### How to simulate Turing machines by invertible one-dimensional cellular automata

How to simulte Turing mchines by invertible one-dimensionl cellulr utomt Jen-Christophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex

### TOPIC: LINEAR ALGEBRA MATRICES

Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

### Figure 1. The left-handed and right-handed trefoils

The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr

### Fundamentals of Computer Science

Fundmentls of Computer Science Chpter 3: NFA nd DFA equivlence Regulr expressions Henrik Björklund Umeå University Jnury 23, 2014 NFA nd DFA equivlence As we shll see, it turns out tht NFA nd DFA re equivlent,

### Arrow s Impossibility Theorem

Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

### CS 491G Combinatorial Optimization Lecture Notes

CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

### Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

### Behavior Composition in the Presence of Failure

Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

### = state, a = reading and q j

4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

### Nondeterministic Automata vs Deterministic Automata

Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

### CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

### 5. Every rational number have either terminating or repeating (recurring) decimal representation.

CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd

### University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

### Topological Quantum Compiling

Topologicl Quntum Compiling Work in collbortion with: Lyl Hormozi Georgios Zikos Steven H. Simon Michel Freedmn Nd Petrovic Florid Stte University Lucent Technologies Microsoft Project Q UCSB NEB, L. Hormozi,

### arxiv: v1 [math.ca] 21 Aug 2018

rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of

### Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

### Sufficient 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

### CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS

CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)

### Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

### Symmetrical Components 1

Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

### CSCI FOUNDATIONS OF COMPUTER SCIENCE

1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not

### Measurement-Only Topological Quantum Computation

Mesurement-Only Topologicl Quntum Computtion Prs Bonderson Microsoft Sttion Q DAS Theoreticl Physics Seminr August 21, 2008 work done in collbortion with: Mike Freedmn nd Chetn Nyk rxiv:0802.0279 (PRL

### 2.1 ANGLES AND THEIR MEASURE. y I

.1 ANGLES AND THEIR MEASURE Given two interseting lines or line segments, the mount of rottion out the point of intersetion (the vertex) required to ring one into orrespondene with the other is lled the

### Proving the Pythagorean Theorem

Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

### A Study on the Properties of Rational Triangles

Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

### Finite State Automata and Determinisation

Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

### MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.

MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].

### 1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

### Lecture 08: Feb. 08, 2019

4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

### THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

### Factorising FACTORISING.

Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

### Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

### Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

### Surface maps into free groups

Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

### Line Integrals and Entire Functions

Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series

### Implication Graphs and Logic Testing

Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

### Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl