John Preskill, Caltech KITP 7 June 2003
|
|
- Bruno May
- 5 years ago
- Views:
Transcription
1 Topologil quntum omputing for eginners John Preskill, Clteh KITP 7 June
2
3
4 Kitev Freedmn
5 Kitev Freedmn Kitev, Fult-tolernt quntum omputtion y nyons (997). Preskill nd Ogurn, Topologil quntum omputtion (997). Preskill, Fult-tolernt quntum omputtion (997). Freedmn, Lrsen, nd Wng, A modulr funtor whih is universl for quntum omputtion (2000). Freedmn, Kitev, nd Wng, Simultion of topologil field theories y quntum omputers (2000). Mohon, Anyons from non-solvle groups re suffiient for universl quntum omputtion (2003). Mohon, Anyon omputers with smller groups (2004).
6
7 Astrt for "Topologil quntum omputing for eginners," y John Preskill I will desrie the priniples of fult-tolernt quntum omputing, nd explin why topologil pprohes to fult tolerne seem espeilly promising. A two-dimensionl medium tht supports elin nyons hs topologil degenery tht n exploited for roust storge of quntum informtion. A system of n nonelin nyons in twodimensions hs n exponentilly lrge topologilly proteted Hilert spe, nd quntum informtion n e proessed y riding the nyons. I will disuss in detil two ses where nonelin nyons n simulte quntum iruit effiiently: fluxons in "nonelin superondutor," nd "Fioni nyons" with espeilly simple fusion rules.
8 Quntum Computtion Feynmn 8 Deutsh 85 Shor 94
9 A omputer tht opertes on quntum sttes n perform tsks tht re eyond the pility of ny oneivle lssil omputer. Feynmn 8 Deutsh 85 Shor 94
10 Finding Prime Ftors =??
11 Shor 94 Finding Prime Ftors =
12 Quntum omputer: the model () Hilert spe of n quits: spnned y ( 2 n ) H = C n n 2 0 Importnt: the Hilert spe is equipped with nturl tensorprodut deomposition into susystems. n C = C C C C times Physilly, this deomposition rises from sptil lolity. Elementry opertions ( quntum gtes ) tht t on smll numer of quits (independent of n) re esy; opertions tht t on mny quits (inresing with n) re hrd. n 2 { } x = x x x x, x 0, n (2) Initil stte: = 0 n
13 Quntum omputer: the model (3) A finite set of fundmentl quntum gtes: { U U U U } 2 3 n,,, G Eh gte is unitry trnsformtion ting on ounded numer of quits. The gtes form universl set: ritrry unitry trnsformtions n e onstruted, to ny speified ury, s quntum iruit onstruted from the gtes: U = (Universl gtes re generi.) Importnt: One universl set of gtes n simulte nother effiiently, so there is notion of omplexity tht is independent of the detils of the quntum hrdwre.
14 Quntum omputer: the model (4) Clssil ontrol: The onstrution of quntum iruit is direted y lssil omputer, i.e., Turing mhine. (We re not interested in wht quntum iruit n do unless the iruit n e designed effiiently y lssil mhine.) (5) Redout: At the end of the quntum omputtion, we red out the result y mesuring, i.e., projeting onto the sis σ { 0, } z (We don t wnt to hide omputtionl power in the ility to perform diffiult mesurements.)
15 Quntum omputer: the model Clerly, the model n e () n quits (2) initil stte (3) quntum gtes (4) lssil ontrol (5) redout simulted y lssil omputer with ess to rndom numer genertor. But there is n exponentil slowdown, sine the simultion involves mtries of exponentil size. The quntum omputer might solve effiiently some prolems tht n t e solved effiiently y lssil omputer. ( Effiiently mens tht the numer of quntum gtes = polynomil of the numer of its of input to the prolem.)
16 Quntum Error Corretion Shor 95 Stene 95
17 Quntum informtion n e proteted, nd proessed fult-tolerntly. Shor 95 Stene 95
18 Quntum Computer Deoherene Environment ERROR! If quntum informtion is leverly enoded, it n e proteted from deoherene nd other potentil soures of error. Intrite quntum systems n e urtely ontrolled.
19 Two Physil Systems Wht is the differene etween: A: Humn B: Chip Imperfet hrdwre. Hierrhil rhiteture with error orretion t ll sles... Relile hrdwre. Informtion proessing prevents informtion loss.
20 Topology Quntum Gte Noisy Gte
21 Topologil quntum omputtion (Kitev 97, FLW 00) nnihilte pirs? rid rid Kitev rid time rete pirs Freedmn
22 Topologil quntum omputtion (Kitev 97, FLW 00) time Physil fult tolerne with nonelin nyons: unontrolled exhnge of quntum numers will e rre if prtiles re widely seprted, nd therml nyons re suppressed...
23 Models of (nonelin) nyons A model of nyons is theory of two-dimensionl medium with mss gp, where the prtiles rry lolly onserved hrges. We define the model y speifying:. A finite list of prtile lels {,,, }. These indite the possile vlues of the onserved hrge tht prtile n rry. If prtile is kept isolted from other prtiles, its lel never hnges. There is speil lel 0 inditing trivil hrge, nd hrge onjugtion opertor C: (where 0=0). (Note: for prtile you my red punture. ) 2. Rules for fusing (nd splitting). These speify the possile vlues of the hrge tht n result when two hrged prtiles re omined. 3. Rules for riding. These speify wht hppens when two neighoring prtiles re exhnged (or when one is rotted y 2π) n
24 Fusion rules: Fusion vetor spe: Fusion = = N 0 V V V dim( V ) N µ (µ =, 2, 3,, N ) µ
25 Fusion rules: Fusion vetor spe: Fusion = = N 0 V V V dim( V ) N 0 0 The hrge 0 fuses trivilly, nd is the unique lel tht n fuse with to yield hrge 0. 0
26 Fusion An nyon model is sid to e nonelin if for some, nd, dim( V ) N 2. Then there is topologil Hilert spe tht n enode nontrivil quntum informtion. This enoding is nonlol; the informtion is olletive property of the two nyons, not lolized on either prtile. When the prtiles with lels nd re fr prt, different sttes in the topologil Hilert spe look identil to lol oservers. In prtiulr, the quntum sttes re invulnerle to deoherene due to lol intertions with the environment. Tht is why we propose to use this enoding in quntum omputer. µ
27 Fusion µ When we hide the quntum stte from the environment, we hide it from ourselves s well! But, when we re redy to red out the quntum stte (for exmple, t the onlusion of quntum omputtion), we n mke the informtion lolly visile gin y ringing the two prtiles together, fusing them into single ojet. Then we sk, wht is this ojet s lel? In ft, it suffies (for universl quntum omputtion) to e le to distinguish the lel = 0 from 0. It is physilly resonle to suppose tht we n distinguish nnihiltion into the vuum ( = 0) from lump tht is unle to dey euse of its onserved hrge ( 0).
28 Anywy, with nonelin nyons we n exploit topology not just to store quntum informtion, ut lso to proess it! Aelin vs. nonelin Aelin nyon models n lso e used for roust quntum memory, e.g., model of 2 fluxons nd their dul 2 hrges. A quit is relized euse the 2 flux in hole n e either trivil or nontrivil (the informtion is rried y the lels themselves, not y the fusion sttes). This informtion is hidden from the environment y mking the holes lrge nd keeping them fr prt (to prevent flux from tunneling from one hole to nother, or to the outside edge, nd to prevent the world lines of hrges from winding out holes). -- Kitev (996) However, this informtion my not e hrder to red out. We d need to ontrt hole to see if prtile ppers, or perform delite interferene experiment to detet the flux, or Alterntively, y mixing the 2 with eletromgneti U(), we might do the redout vi Senthil-Fisher type experiment (i.e., one tht would tully work)! -- Ioffe et l. (2002)
29 Assoitivity of fusion: the F-mtrix ( ) = ( ) µ ν = e' µν ' ( d ) e ' µ ' ν F ' e e eµν ν µ d d There re two nturl wys to deompose the topologil d Hilert spe V of three nyons in terms of the fusion spes of pirs of prtiles. These two orthonorml ses re relted y unitry trnsformtion, the F-mtrix.
30 Briding: the R-mtrix R : V V : µ = µ ( ) R µ µ µ When two neighoring nyons re exhnged ounterlokwise, their totl hrge is unltered; sine the prtiles swp positions, the fusion spe V hnges to the isomorphi spe V. This isomorphism is represented y unitry mtrix, the R-mtrix. The R-mtrix lso determines the topologil spin of the lel, i.e., the phse quired when the prtile is rotted y 2π: 2πiJ 0 e = R
31 Models of (nonelin) nyons A model of nyons is theory of two-dimensionl medium with mss gp, where the prtiles rry lolly onserved hrges. We define the model y speifying:. A finite lel set {,,, }. 2. The fusion rules = N 3. The F-mtrix (expressing ssoitivity of fusion). 4. The R-mtrix (riding rules). These determine representtion of the mpping lss group (riding plus 2π rottions), nd define unitry topologil modulr funtor (UTMF), the two-dimensionl prt of (2+)- dimensionl topologil quntum field theory (TQFT) --- relted to (+)-dimensionl rtionl onforml field theory (RCFT) n
32 Exmple: Yng-Lee (Fioni) Model 0 or The hrge tkes two possile vlues: 0 (trivil) nd (nontrivil, nd self-onjugte). Anyons hve hrge.two nyons n fuse in either of two wys: = 0+ This is the simplest of ll nonelin nyon models. Yet its deeptively simple fusion rule hs profound onsequenes. In prtiulr, the fusion rule determines the F-mtrix nd R- mtrix uniquely; the resulting nontrivil riding properties re dequte for universl quntum omputtion (pointed out y Kupererg).
33 Nonelin Anyons: Yng-Lee model Suppose n nyons hve trivil totl hrge 0. Wht is the dimension of the Hilert spe? 0 or 0, 0, 0, 0, 0, 0, 0, The distinguishle sttes of n nyons ( sis for the Hilert spe) re leled y inry strings of length n-3. But it is impossile to hve two zeros in row: 0 0
34 Nonelin Anyons: Yng-Lee model Suppose n nyons hve trivil totl hrge 0. Wht is the dimension of the Hilert spe? 0 or 0, 0, 0, 0, 0, 0, 0, The distinguishle sttes of n nyons ( sis for the Hilert spe) re leled y inry strings of length n-3. But it is impossile to hve two zeros in row: Therefore, the dimension is Fioni numer: D = 2, 3, 5, 8, 3, 2, 34, 55, 89, Asymptotilly, the numer of quits enoded y eh nyon is: ( ) log2φ = log / 2 = log 2(.68) =.694
35 Nonelin Anyons: Yng-Lee model Asymptotilly, the numer of quits enoded y eh nyon is: ( ) log2φ = log / 2 = log 2(.68) =.694 We sy tht d = φ is the (quntum) dimension of the Fioni nyon 0 or This ounting vividly illustrtes tht the quits re nonlol property of the nyons, nd tht the topologil Hilert spe hs no prtiulrly nturl deomposition s tensor produt of smll susystems. Anyons hve some nonlol fetures, ut they re not so nonlol s to profoundly lter the omputtionl model (the riding of nyons n e effiiently simulted y quntum iruit)
36 The quntum dimension Every nyon lel hs quntum dimension, whih we my define s follows: Imgine reting two prtile-ntiprtile pirs, nd then fusing the prtile from one pir with the ntiprtile of the other =, Annihiltion ours with proility /d 2. This is nturl generliztion of the se where the hrge is n irreduile representtion R of group G, where the quntum dimension is just the dimension R of the representtion (whih ounts the numer of olors going round the loop). But there is no logil reson why dimension defined this wy must e n integer, nd in generl it isn t n integer. = d
37 The quntum dimension There is more onvenient normliztion onvention for prtilentiprtile pirs... Eh time we dd nother tooth to the sw, it ost us nother ftor of /d. We n ompenste for tht d d d ftor y weighting eh pir retion or nnihiltion even y ftor of d. d d d = d With this onvention, losed loop hs weight, s though we were ounting olors d Now we n deform the world line of prtile (e.g., dding nd removing teeth ) without ltering the vlue of digrm.
38 The quntum dimension d d = = =, µ µ µ =, µ µ µ = N = N d Therefore, the vetor of quntum dimensions is the (Perron- Froenius) eigenvetor of eh fusion rule mtrix, with eigenvlue d : N d d d N d d d ( ) = = ( )
39 The quntum dimension N = u d u +, u = d D N = dim( V ) = NN N N 2 n 2 6 { } i n ( ) n n dd = N = u d u + = 2 + D Thus the quntum dimension ontrols the rte of growth of the n-prtile Hilert spe. The normliztion ftor D= d is lled the totl quntum dimension of the nyon model. 2 n-2
40 The quntum dimension Wht if we rete pirs of different types, nd then fuse? ( dd) p ( ) = µ µ µ = µ µ µ = N = N d p ( ) = N d (generlizes wht we found for the se = ) dd
41 The quntum dimension p ( ) = N d dd Suppose we rete dense gs of nyons (y quenhing ), with n ritrry initil distriution of prtile types. Then we let the gs nnel, ut not ompletely. The distriution of prtile types onverges to stedy stte distriution stisfying:, ppp ( ) = p 2 2 The solution to this eqution is: p = d D prtile popultions proportionl to squre of quntum dimension.
42 Briding: the B-mtrix d d B: V V : For the n-nyon Hilert spe, we my use the stndrd sis: n- n n-2 The effet of riding n e expressed in this sis: d e = e µν ' ' ( d ) e ' µ ν B ' eµν e d And the mtrix B is determined y R nd F: F R F
43 Topologil quntum omputtion (Kitev 97, FLW 00) nnihilte pirs? rid rid Kitev rid time rete pirs Freedmn
44 Topologil quntum omputtion. Crete pirs of prtiles of speified types. 2. Exeute rid. 3. Fuse neighoring prtiles, nd oserve whether they nnihilte. Clim: This proess n e simulted effiiently y quntum iruit. Need to explin:. Enoding of topologil Hilert spe. 2. Simultion of riding (B-mtrix s two-qudit gte). 3. Simultion of fusion (F-mtrix plus one-qudit projetive mesurement) n-2 n-3 n- n Although the topologil vetor spes re not themselves tensor produts of susystems, they ll fit into tensor produt of d-dimensionl systems, where this qudit is the totl fusion spe of three nyons ( ) ( n 2) V 0,, H d d =,, N 0
45 Topologil quntum omputtion n-2 n- 2 3 n n-3 n ( ) ( 2) H d Therefore, the topologil model is no more powerful thn the quntum iruit model. But is it s powerful? The nswer depends on the model of nyons, nd in prtiulr on the properties of the R-mtrix nd F-mtrix. To simulte quntum iruit, we enode quits in the topologil vetor spe, nd use riding to relize set of universl quntum gtes ting on the quits. Tht is, the imge of our representtion of the rid group B n on n strnds should e dense in SU(2 r ), for some r liner in n. Exmple: in the Fioni model, we n enode quit in the twodimensionl Hilert spe of four nyons with trivil totl 0 hrge. V { 0,} But wht re R nd F in this model?
46 Consisteny of riding nd fusing The R-mtrix (riding), nd the F-mtrix (ssoitivity of fusing) re highly onstrined y lgeri onsisteny requirements (the Moore-Seierg polynomil equtions). In the se of the Fioni model, these equtions llow us to ompletely determine R nd F from the fusion rules. By sequene of F-moves nd R-moves, we otin n isomorphism etween two topologil Hilert spes, tht is, reltion etween two different nonil ses. This reltion must not depend on the prtiulr sequene of moves, only on the sis we strt with nd the sis we end up with. For exmple, there re 5 different wys (without ny exhnges) to fuse five prtiles, relted y F-moves: F d e Pentgon eqution: ( 5 ) ( 5 F ) 34 F2 ( ) ( 5 ) ( 5 F ) 23 F e4 F234 d = e d e
47 Consisteny of riding nd fusing F R R F R F F R Hexgon eqution: ( 4 ) 4 ( 4 ) ( 4 ) = F R F R F R Furthermore, if the pentgon nd hexgon equtions re stisfied, then ll sequenes of F- nd R-moves from n initil sis to finl sis yield the sme isomorphism! A systemti (in priniple) proedure for onstruting nyon models:. Assume fusion rule. 2. Solve pentgon nd hexgon equtions for R nd F. -- If no solutions, the fusion rules re inomptile with lol quntum physis. -- If multiple solutions, eh is vlid model.
48 Exmple: Fioni model = Σ F R : F 4 πi /5 τ τ e 0 =, R=, τ = ( 5 )/2= φ 2 πi /5 τ τ 0 e This solution is unique (side from freedom to redefine phses nd tke the prity onjugte). Furthermore, produts of the nonommuting mtries R nd FRF - (representing the genertors of the rid group B 3 ) re dense in SU(2).
49 Exmple: Fioni model We enode quit in four nyons. To simulte quntum iruit, we need to do (universl) two-quit gtes. The two-quits re emedded in the 3-dimensionl Hilert spe of eight nyons. The representtion of B 3 determined y our R nd F mtries is universl i.e., dense in SU(3), so in prtiulr we n pproximte ny SU(4) gte ritrrily well with some finite numer of exhnges. If we fix ury of the pproximtion to the gte, we n use quntum error- orreting odes nd fult-tolernt simultion to perform n effiient nd relile quntum omputtion. Here quntum-error orretion might e needed to orret for the (smll) flws in the gtes, ut not to orret for storge errors.
50 For exmple, we n use quntum teleporttion protool for lekge orretion (in effet, this turns quntum lekge into lssil lekge, whih is esier to detet nd orret). Lekge The omputtion tkes ple in the r-quit suspe of system of 4r nyons. As errors umulte, the stte of the omputer might drift our of this suspe (the lekge prolem). But we n inlude lekge orretor gtes in our simultion. This gte is the identity ting on dt in the omputtionl spe, ut reples leked quit y the stndrd stte 0 in the omputtionl spe. unleked dt leked dt Lekge Corretor Lekge Corretor unhnged unleked dt 0
51 Topologil quntum omputtion To summrize, we n simulte universl quntum omputer using (for exmple) Fioni nyons, if we hve these pilities:. We n rete pirs of prtiles. 2. We n guide the prtiles long speified rid. 3. We n fuse prtiles, nd distinguish omplete nnihiltion from inomplete nnihiltion. -- The temperture must e smll ompred to the energy gp, so tht stry nyons re unlikely to e exited thermlly. -- The nyons must e kept fr prt from one nother ompred to the orreltion length, to suppress hrge-exhnging virtul proesses, exept during the initil pir retion nd the finl pir nnihiltion.
52 There would still e more to do, though For exmple, this would e lssifition of gpped two-dimensionl ulk theories, nd one ulk theory n orrespond to more thn one (+)-dimensionl theory desriing edge exittions. And of ourse, we would like to know, oth for prtil nd theoretil resons, whether the model n e relized roustly with some lol Hmiltonin (nd how to relize it). (Nonelin) nyons An nyon model is hrterized y its lel set, fusion rules, F-mtrix, nd R-mtrix. Clssifying the models (finding ll solutions to the pentgon nd hexgon equtions) is n importnt (hrd) unsolved mthemtil prolem. We know how to find some exmples (e.g., Chern-Simons theories), ut we don t know how rih the possiilities re. Suh lssifition would e n importnt step towrd lssifying topologil order in two dimensions. µ F R
53 Topologil quntum memory Kitev 96 Quits n reside in holes in plnr rry, where the holes rry Z 2 hrge or flux. Then the quntum memory is topologilly stle, ut nontopologil ouplings etween holes re needed to omplete set of universl gtes. This sheme might e relizle in suitly designed Josephson-juntion rrys, whih hve phse tht n e interpreted s ondenste of ojets with hrge 4e. A hole in the rry n rry hrge 2e or flux Φ 0 /2=2π/4e. Ioffe et l. 02
54 Quntum mny-ody physis: Exoti phses in optil ltties Atoms n e trpped in n optil lttie. The lttie geometry nd intertions etween neighors n e hosen y the mteril designer (diretion-dependent nd spin dependent tunneling etween sites). In prtiulr, Dun, Lukin, nd Demler (ond-mt/020564) hve desried how Kitev s honeyom lttie model, whih supports nonelin nyons, n e simulted using n optil lttie.
55 Topologil quntum omputing for eginners John Preskill, Clteh KITP 7 June
Topological quantum computation. John Preskill, Caltech Biedenharn Lecture 4 15 September 2005
Topologil quntum omputtion John Preskill, Clteh Biedenhrn Leture 4 5 Septemer 2005 http://www.iqi.lteh.edu/ http://www.theory.lteh.edu/~preskill/ph29/ph29_2004.html Quntum omputer: the stndrd model ()
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/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}
More informationQubit 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
More information1 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
More informationTopological 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,
More informationProject 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
More informationElectromagnetism Notes, NYU Spring 2018
Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system
More informationDense 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
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationLecture 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
More informationPre-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
More informationarxiv: v2 [quant-ph] 15 Aug 2008
Mesurement-Only Topologil Quntum Computtion Prs Bonderson, 1 Mihel Freedmn, 1 nd Chetn Nyk 1, 2 1 Mirosoft Reserh, Sttion Q, Elings Hll, University of Cliforni, Snt Brbr, CA 93106 2 Deprtment of Physis,
More information8 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),
More informationThe 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
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 informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationCS 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
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
More informationCoalgebra, 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
More informationEngr354: 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
More informationSymmetrical 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
More information12.4 Similarity in Right Triangles
Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right
More informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
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 informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationActivities. 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
More informationAutomatic Synthesis of New Behaviors from a Library of Available Behaviors
Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u
More informationDiscrete 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.
More informationTHE 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
More informationMeasurement-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
More informationAlpha Algorithm: Limitations
Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationSpacetime 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
More informationNON-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
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationIntroduction to Olympiad Inequalities
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......................
More informationset 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
More informationSECTION A STUDENT MATERIAL. Part 1. What and Why.?
SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are
More informationCounting 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
More informationSolutions 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:
More informationSection 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
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationTIME AND STATE IN DISTRIBUTED SYSTEMS
Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is
More information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationFigure 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
More informationCan one hear the shape of a drum?
Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:
More informationGM1 Consolidation Worksheet
Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up
More informationarxiv: v1 [quant-ph] 2 Apr 2007
Towrds Miniml Resoures of Mesurement-sed Quntum Computtion riv:0704.00v1 [qunt-ph] Apr 007 1. Introdution Simon Perdrix PPS, CNRS - niversité Pris 7 E-mil: simon.perdrix@pps.jussieu.fr Astrt. We improve
More informationSpin Networks and Anyonic Topological Quantum Computing. L. H. Kauffman, UIC.
Spin Networks n Anyoni Topologil Quntum Computing L. H. Kuffmn, UC qunt-ph/0603131 n qunt-ph/0606114 www.mth.ui.eu/~kuffmn/unitry.pf Spin Networks n Anyoni Topologil Computing Louis H. Kuffmn n Smuel J.
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More information5. 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
More informationComputing 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:
More informationLogic 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
More informationarxiv: v4 [cond-mat.stat-mech] 18 May 2017
Quntum Vertex Model for Reversile Clssil Computing rxiv:1604.05354v4 [ond-mt.stt-meh] 18 My 2017 C. Chmon, 1,. R. Muiolo, 2 A.. Rukenstein, 1 nd Z.-C. Yng 1 1 Physis Deprtment, Boston University, 590 Commonwelth
More informationChapter 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
More informationLesson 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
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationNondeterministic 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
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationTechnische 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:
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationSystem 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
More informationLearning Objectives of Module 2 (Algebra and Calculus) Notes:
67 Lerning Ojetives of Module (Alger nd Clulus) Notes:. Lerning units re grouped under three res ( Foundtion Knowledge, Alger nd Clulus ) nd Further Lerning Unit.. Relted lerning ojetives re grouped under
More informationAbstraction of Nondeterministic Automata Rong Su
Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,
More informationMath 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
More informationInstructions. 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
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationCS311 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
More informationCSE 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
More information, 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
More informationGeneralization of 2-Corner Frequency Source Models Used in SMSIM
Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville
More informationPolynomials. 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
More informationBehavior 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
More informationFinite 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
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationGreen s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e
Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let
More informationLine 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
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationAP 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
More informationOutline. Theory-based Bayesian framework for property induction Causal structure induction
Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning The origins of usl knowledge Question: how do people relily ome
More informationTOPIC: 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
More informationSurface 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
More information03. Early Greeks & Aristotle
03. Erly Greeks & Aristotle I. Erly Greeks Topis I. Erly Greeks II. The Method of Exhustion III. Aristotle. Anximnder (. 60 B.C.) to peiron - the unlimited, unounded - fundmentl sustne of relity - underlying
More informationLecture 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
More informationNondeterministic 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)
More information6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 H 3 CH3 C. NMR spectroscopy. Different types of NMR
6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht
More informationNon Right Angled Triangles
Non Right ngled Tringles Non Right ngled Tringles urriulum Redy www.mthletis.om Non Right ngled Tringles NON RIGHT NGLED TRINGLES sin i, os i nd tn i re lso useful in non-right ngled tringles. This unit
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More information6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 CH 3. CH 3 C a. NMR spectroscopy. Different types of NMR
6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationPart 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
More informationUniversity 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
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationThermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R
/10/010 Question 1 1 mole of idel gs is rought to finl stte F y one of three proesses tht hve different initil sttes s shown in the figure. Wht is true for the temperture hnge etween initil nd finl sttes?
More information