Measurement-Only Topological Quantum Computation

Size: px
Start display at page:

Download "Measurement-Only Topological Quantum Computation"

Transcription

1 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: (PRL 08) nd rxiv:

2 ntroduction Non-Abelin nyons probbly exist in certin gpped two dimensionl systems: - Frctionl Quntum Hll Effect (n=5/2, 12/5,?) - ruthentes, topologicl insultors, rpidly rotting bose condenstes, quntum loop gses/string nets? They could hve ppliction in quntum computtion, providing nturlly ( topologiclly protected ) fulttolernt hrdwre. Assuming we hve them t our disposl, wht opertions re necessry to implement topologicl quntum computtion?

3 Anyon Models (unitry brided tensor ctegories) Describe qusiprticle briding sttistics in gpped two dimensionl systems. Finite set C of nyonic chrges:, b, c Unique vcuum chrge, denoted hs trivil fusion nd briding with ll prticles. Fusion rules: b = c N c b c c N b Fusion multiplicities re integers specifying the c dimension of the fusion nd splitting spces V, V b b c

4 Hilbert spce construct from stte vectors ssocited with fusion/splitting chnnels of nyons. Expressed digrmmticlly: nner product: = cc'

5 Associtivity of fusing/splitting more thn two nyons is specified by the unitry F-moves:

6 Briding b R = = c b R c Cn be non-abelin if there re multiple fusion chnnels c U R

7 sing nyonsor SU -n = -n = FQH Prticle types: Fusion rules :, ( 2 nd other 2LL FQH?(PB nd Slingerln d `07) - Kitev honeycomb, (Moore- Red `91), 2 topologicl (.k.. 0, insultors, 1 2, 1) ruthentes?

8 Fiboncci -n = 12 5 Prticle types: Fusion rules :, ( nyonsor SO 3 FQH? (Red - Rezyi`98) - string nets?(levin - Wen `04, 3 (.k.. 0, Fendley et.l. 1) `08)

9 Topologicl Quntum Computtion (Kitev, Preskill, Freedmn, Lrsen, Wng) 0 c 1 0 c1 Topologicl Protection! sing: = 0 1, c =, c = Fib: = 0 1, c =, c =

10 Topologicl Quntum Computtion (Kitev, Preskill, Freedmn, Lrsen, Wng) c c1 time (Bonesteel, et. l.) s briding computtionlly universl? sing: not quite (must be supplemented) Fib: yes!

11 Topologicl Quntum Computtion (Kitev, Preskill, Freedmn, Lrsen, Wng) c c1 time (Bonesteel, et. l.) Topologicl Chrge Mesurement

12 Topologicl Chrge Mesurement Projective (von Neumnn) e.g. loop opertor mesurements in lttice models, energy splitting mesurement =, b; c, b; c c = c b c c

13 Topologicl Chrge Mesurement nterferometric (PB, Shtengel, Slingerlnd `07) e.g. 2PC FQH, nd Anyonic Mch-Zehnder (idelized, not FQH) Asymptoticlly chrcterized s projection of the trget s nyonic chrge AND decoherence of nyonic chrge entnglement between the interior nd exterior of the trget region. (more lter; ignore for now)

14 Anyonic Stte Teleporttion (for projective mesurement) Entnglement Resource: mximlly entngled nyon pir, ; = Wnt to teleport: = Form:, = 1 ; 23 nd perform Forced Mesurement on nyons 12

15 Forced Mesurement (projective) ( 12 : Anyonic Stte Teleporttion ( 12 ( 23 f2 f 2 f 2 ( 12 e1 e 1 e 1 ; 1, 23 =

16 Anyonic Stte Teleporttion Forced Mesurement (projective) ( 12 : ( 12 ( 23 f2 f 2 ( 12 e1 e 1

17 Forced Mesurement (projective) Anyonic Stte Teleporttion ( 12 ( : 12 : ; 1, 23, ; 12 3 = Success occurs with probbility 1 2 d for ech repet try.

18 Wht good is this if we wnt to brid computtionl nyons? R =

19 Use mximlly entngled pir nd forced mesurements for series of teleporttions (23) (34) (13) (23)

20 Use mximlly entngled pir nd forced mesurements for series of teleporttions (23) (34) (13) (23)

21 Use mximlly entngled pir nd forced mesurements for series of teleporttions (23) (34) (13) (23)

22 Use mximlly entngled pir nd forced mesurements for series of teleporttions (23) (34) (13) (23)

23 Mesurement Simulted Briding! R (14) (23) (34) (13) (23) =

24 in FQH, for exmple

25 in FQH, for exmple

26 in FQH, for exmple

27 Topologicl Quntum Computtion c c1 time mesurement simulted briding Topologicl Chrge Mesurement

28 Mesurement-Only Topologicl Quntum Computtion c c1 Topologicl Chrge Mesurement Topologicl Chrge Mesurement

29 Topologicl Chrge Mesurement nterferometric (PB, Shtengel, Slingerlnd `07) e.g. 2PC FQH, nd Anyonic Mch-Zehnder (idelized, not FQH) Asymptoticlly chrcterized s projection of the trget s nyonic chrge AND decoherence of nyonic chrge entnglement between the interior nd exterior of the trget region.

30 nterferometricl Decoherence of Anyonic Chrge Entnglement =, b; c, b; c = For inside the interferometer nd b outside: D int : = c

31 nterferometricl Decoherence sing: D : = int D : = int

32 nterferometricl Decoherence Fiboncci: D : = int

33 Mesurement Generted Briding! Using nterferometric Mesurements is similr but more complicted, requiring the density mtrix description. The resulting forced mesurement procedure must include n dditionl mesurement (of 8 or fewer nyons, i.e. still bounded size) in ech teleporttion ttempt to ensure the overll chrge of the topologicl qubits being cted upon remins trivil. Note: For the sing model TQC qubits, interferometric mesurements re projective.

34 sing vs Fiboncci (in FQH) Briding not universl (needs one gte supplement) D n=5/2 ~ 600 mk Brids = Nturl gtes (briding = Clifford group) No lekge from briding (from ny gtes) Projective MOTQC (2 nyon mesurements) Mesurement difficulty distinguishing nd (precise phse clibrtion) Briding is universl (needs one gte supplement) D n=12/5 ~ 70 mk Brids = Unnturl gtes (see Bonesteel, et. l.) nherent lekge errors (from entngling gtes) nterferometricl MOTQC (2,4,8 nyon mesurements) Robust mesurement distinguishing nd (mplitude of interference)

35 Conclusion Quntum stte teleporttion nd entnglement resources hve nyonic counterprts. Bounded, dptive, non-demolitionl mesurements cn generte the briding trnsformtions used in TQC. Sttionry computtionl nyons hopefully mkes life esier for experimentl reliztion. Experimentl reliztion of FQH double pointcontct interferometers is t hnd.

Measurement-Only Topological Quantum Computation

Measurement-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 information

Measurement-Only Topological Quantum Computation

Measurement-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 information

Topological Quantum Compiling

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,

More information

arxiv: v2 [quant-ph] 15 Aug 2008

arxiv: 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 information

Entanglement Purification

Entanglement Purification Lecture Note Entnglement Purifiction Jin-Wei Pn 6.5. Introduction( Both long distnce quntum teleporttion or glol quntum key distriution need to distriute certin supply of pirs of prticles in mximlly entngled

More information

Lecture Notes PH 411/511 ECE 598 A. La Rosa Portland State University INTRODUCTION TO QUANTUM MECHANICS

Lecture Notes PH 411/511 ECE 598 A. La Rosa Portland State University INTRODUCTION TO QUANTUM MECHANICS Lecture Notes PH 4/5 ECE 598. L Ros Portlnd Stte University INTRODUCTION TO QUNTUM MECHNICS Underlying subject of the PROJECT ssignment: QUNTUM ENTNGLEMENT Fundmentls: EPR s view on the completeness of

More information

arxiv: v1 [quant-ph] 12 Mar 2009

arxiv: v1 [quant-ph] 12 Mar 2009 Topologicl Quntum Computing with Re-Rezyi Sttes L. Hormozi, N.E. Bonesteel 2, n S.H. Simon 3 Joint Quntum Institute, Ntionl Institute of Stnrs n Technology n University of Mryln, Githersurg, MD 2899 2

More information

Extended nonlocal games from quantum-classical games

Extended nonlocal games from quantum-classical games Extended nonlocl gmes from quntum-clssicl gmes Theory Seminr incent Russo niversity of Wterloo October 17, 2016 Outline Extended nonlocl gmes nd quntum-clssicl gmes Entngled vlues nd the dimension of entnglement

More information

Operations Algorithms on Quantum Computer

Operations Algorithms on Quantum Computer IJCSNS Interntionl Journl of Computer Science nd Network Security, VOL. No., Jnury 2 85 Opertions Algorithms on Quntum Computer Moyd A. Fhdil, Ali Foud Al-Azwi, nd Smmer Sid Informtion Technology Fculty,

More information

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

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 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 information

Topological Quantum Computation

Topological Quantum Computation Topologicl Quntum Computtion Shwn X. Cui August 15, 2018 Abstrct This is the note for the 10-lecture course Topologicl Quntum Computtion (TQC) I tught t Stnford University during Spring 2018. The course

More information

Anyon condensation. Topological symmetry breaking phase transitions and commutative algebra objects in braided tensor categories

Anyon condensation. Topological symmetry breaking phase transitions and commutative algebra objects in braided tensor categories Anyon condenstion Topologicl symmetry breking phse trnsitions nd commuttive lgebr objects in brided tensor ctegories Author: Sebs Eliëns sebs@eliens.net Supervisors: Prof. Dr. F.A. Bis Instituut voor Theoretische

More information

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6 C/CS/Phys C9 Bell Inequlities, o Cloning, Teleporttion 9/3/7 Fll 7 Lecture 6 Redings Benenti, Csti, nd Strini: o Cloning Ch.4. Teleporttion Ch. 4.5 Bell inequlities See lecture notes from H. Muchi, Cltech,

More information

Lecture 23: Quantum Computation

Lecture 23: Quantum Computation princeton university cos 522: computtionl complexity Lecture 23: Quntum Computtion Lecturer: Snjeev Aror Scribe:Zhifeng Chen, Ji Xu This lecture concerns quntum computtion, n re tht hs become very populr

More information

Sufficient condition on noise correlations for scalable quantum computing

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

More information

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p

More information

Recursively Enumerable and Recursive. Languages

Recursively Enumerable and Recursive. Languages Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings

More information

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon Phys463.nb 49 7 Energy Bnds Ref: textbook, Chpter 7 Q: Why re there insultors nd conductors? Q: Wht will hppen when n electron moves in crystl? In the previous chpter, we discussed free electron gses,

More information

Quantum data bus in dipolar coupled nuclear spin qubits

Quantum data bus in dipolar coupled nuclear spin qubits Quntum dt bus in dipolr coupled nucler spin qubits Jingfu Zhng, 1 Michel Ditty, 1 Dniel Burgrth, 2 Colm A. Ryn, 1 C. M. Chndrshekr, 1,3 Mrtin Lforest, 1 Osm Mouss, 1 Jonthn Bugh, 1 nd Rymond Lflmme 1,3

More information

Do the one-dimensional kinetic energy and momentum operators commute? If not, what operator does their commutator represent?

Do the one-dimensional kinetic energy and momentum operators commute? If not, what operator does their commutator represent? 1 Problem 1 Do the one-dimensionl kinetic energy nd momentum opertors commute? If not, wht opertor does their commuttor represent? KE ˆ h m d ˆP i h d 1.1 Solution This question requires clculting the

More information

Chiral groundstate currents of interacting photons in a synthetic magnetic field

Chiral groundstate currents of interacting photons in a synthetic magnetic field Chirl groundstte currents of intercting photons in synthetic mgnetic field Pedrm Roushn Google Inc., Snt Brbr Chni, June 16 rxiv: 166.77 Google quntum rtificil intelligence tem Chrles Neill Anthony Megrnt

More information

Quantum informational representations of entangled fermions and bosons

Quantum informational representations of entangled fermions and bosons SPIE Defense nd Security Symposium, Quntum Informtion nd Computtion VII, Vol. 734-8 (009 v1.0 Quntum informtionl representtions of entngled fermions nd bosons Jeffrey Yepez Air Force Reserch Lbortory,

More information

Local orthogonality: a multipartite principle for (quantum) correlations

Local orthogonality: a multipartite principle for (quantum) correlations Locl orthogonlity: multiprtite principle for (quntum) correltions Antonio Acín ICREA Professor t ICFO-Institut de Ciencies Fotoniques, Brcelon Cusl Structure in Quntum Theory, Bensque, Spin, June 2013

More information

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

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

More information

THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM

THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM ROMAI J., v.9, no.2(2013), 173 179 THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM Alicj Piseck-Belkhyt, Ann Korczk Institute of Computtionl Mechnics nd Engineering,

More information

Topological Insulators in 2D and 3D

Topological Insulators in 2D and 3D Topologicl Insultors in D nd 3D I. Introduction - Grphene - Time reversl symmetry nd Krmers theorem II. D quntum spin Hll insultor - Z topologicl invrint - Edge sttes - HgCdTe quntum wells, expts III.

More information

The solutions of the single electron Hamiltonian were shown to be Bloch wave of the form: ( ) ( ) ikr

The solutions of the single electron Hamiltonian were shown to be Bloch wave of the form: ( ) ( ) ikr Lecture #1 Progrm 1. Bloch solutions. Reciprocl spce 3. Alternte derivtion of Bloch s theorem 4. Trnsforming the serch for egenfunctions nd eigenvlues from solving PDE to finding the e-vectors nd e-vlues

More information

The experimental realization of a quantum computer ranks

The experimental realization of a quantum computer ranks PUBLISHED ONLINE: 13 FEBRUARY 011 DOI: 10.1038/NPHYS1915 Non-Aelin sttistics nd topologicl quntum informtion processing in 1D wire networks Json Alice 1 *, Yuvl Oreg, Gil Refel 3, Felix von Oppen 4 nd

More information

Anomaly in sign function - probability function integration

Anomaly in sign function - probability function integration Anomly in sign function - probbility function integrtion Hn GEURDES Aress Geures Dtscience, KvK 6450, C v Lijnstrt 164, 593 NN, Den Hg Netherlns Abstrct E-mil :hn.geures@gmil.com In the pper it is emonstrte

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

Continuous Quantum Systems

Continuous Quantum Systems Chpter 8 Continuous Quntum Systems 8.1 The wvefunction So fr, we hve been tlking bout finite dimensionl Hilbert spces: if our system hs k qubits, then our Hilbert spce hs n dimensions, nd is equivlent

More information

Physics 202H - Introductory Quantum Physics I Homework #08 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/11/15

Physics 202H - Introductory Quantum Physics I Homework #08 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/11/15 Physics H - Introductory Quntum Physics I Homework #8 - Solutions Fll 4 Due 5:1 PM, Mondy 4/11/15 [55 points totl] Journl questions. Briefly shre your thoughts on the following questions: Of the mteril

More information

Topological quantum computation. John Preskill, Caltech Biedenharn Lecture 4 15 September 2005

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 information

Designing finite automata II

Designing 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 information

Squeezing Transformation of Three-Mode Entangled State

Squeezing Transformation of Three-Mode Entangled State Commun. Theor. Phys. Beijing, Chin 44 005 pp. 9 9 c Interntionl Acdemic Publishers Vol. 44, No. 5, November 5, 005 Squeezing Trnsformtion of Three-Mode Entngled Stte QIAN Xio-Qing nd SONG Tong-Qing Deprtment

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate 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 information

PH12b 2010 Solutions HW#3

PH12b 2010 Solutions HW#3 PH 00 Solutions HW#3. The Hmiltonin of this two level system is where E g < E e The experimentlist sis is H E g jgi hgj + E e jei hej j+i p (jgi + jei) j i p (jgi jei) ) At t 0 the stte is j (0)i j+i,

More information

Topological Quantum Information Theory

Topological Quantum Information Theory Proceedings of Symposi in Applied Mthemtics Topologicl Quntum Informtion Theory Louis H. Kuffmn nd Smuel J. Lomonco Jr. This pper is dedicted to new progress in the reltionship of topology nd quntum physics.

More information

Quantum Physics III (8.06) Spring 2005 Solution Set 5

Quantum Physics III (8.06) Spring 2005 Solution Set 5 Quntum Physics III (8.06 Spring 005 Solution Set 5 Mrch 8, 004. The frctionl quntum Hll effect (5 points As we increse the flux going through the solenoid, we increse the mgnetic field, nd thus the vector

More information

AMATH 731: Applied Functional Analysis Fall Additional notes on Fréchet derivatives

AMATH 731: Applied Functional Analysis Fall Additional notes on Fréchet derivatives AMATH 731: Applied Functionl Anlysis Fll 214 Additionl notes on Fréchet derivtives (To ccompny Section 3.1 of the AMATH 731 Course Notes) Let X,Y be normed liner spces. The Fréchet derivtive of n opertor

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 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 information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State 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 information

2.57/2.570 Midterm Exam No. 1 March 31, :00 am -12:30 pm

2.57/2.570 Midterm Exam No. 1 March 31, :00 am -12:30 pm 2.57/2.570 Midterm Exm No. 1 Mrch 31, 2010 11:00 m -12:30 pm Instructions: (1) 2.57 students: try ll problems (2) 2.570 students: Problem 1 plus one of two long problems. You cn lso do both long problems,

More information

CSCI FOUNDATIONS OF COMPUTER SCIENCE

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

More information

How do you know you have SLE?

How do you know you have SLE? Simultneous Liner Equtions Simultneous Liner Equtions nd Liner Algebr Simultneous liner equtions (SLE s) occur frequently in Sttics, Dynmics, Circuits nd other engineering clsses Need to be ble to, nd

More information

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1 Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture

More information

arxiv: v2 [cond-mat.str-el] 6 Sep 2016

arxiv: v2 [cond-mat.str-el] 6 Sep 2016 Abelin Floquet symmetry-protected topologicl phses in one dimension Rhul Roy nd Fenner Hrper Deprtment of Physics nd Astronomy, University of Cliforni, Los Angeles, Cliforni 90095, USA Dted: September

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 14. Matrix Representations of Linear Transformations Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn

More information

Lecture 7 notes Nodal Analysis

Lecture 7 notes Nodal Analysis Lecture 7 notes Nodl Anlysis Generl Network Anlysis In mny cses you hve multiple unknowns in circuit, sy the voltges cross multiple resistors. Network nlysis is systemtic wy to generte multiple equtions

More information

Acceptance Sampling by Attributes

Acceptance Sampling by Attributes Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

More information

Lecture 10 :Kac-Moody algebras

Lecture 10 :Kac-Moody algebras Lecture 10 :Kc-Moody lgebrs 1 Non-liner sigm model The ction: where: S 0 = 1 4 d xtr ( µ g 1 µ g) - positive dimensionless coupling constnt g(x) - mtrix bosonic field living on the group mnifold G ssocited

More information

Research Collection. Quantum error correction (QEC) Student Paper. ETH Library. Author(s): Baumann, Rainer. Publication Date: 2003

Research Collection. Quantum error correction (QEC) Student Paper. ETH Library. Author(s): Baumann, Rainer. Publication Date: 2003 Reserch Collection Student Pper Quntum error correction (QEC) Author(s): Bumnn, Riner Publiction Dte: 3 Permnent Link: https://doi.org/.399/ethz--4778 Rights / License: In Copyright - Non-Commercil Use

More information

Non-Deterministic Finite Automata. Fall 2018 Costas Busch - RPI 1

Non-Deterministic Finite Automata. Fall 2018 Costas Busch - RPI 1 Non-Deterministic Finite Automt Fll 2018 Costs Busch - RPI 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q q2 1 q 0 q 3 Fll 2018 Costs Busch - RPI 2 Nondeterministic Finite Automton (NFA) Alphbet

More information

Ph2b Quiz - 1. Instructions

Ph2b Quiz - 1. Instructions Ph2b Winter 217-18 Quiz - 1 Due Dte: Mondy, Jn 29, 218 t 4pm Ph2b Quiz - 1 Instructions 1. Your solutions re due by Mondy, Jnury 29th, 218 t 4pm in the quiz box outside 21 E. Bridge. 2. Lte quizzes will

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More information

Ph 219b/CS 219b. Exercises Due: Wednesday 9 March 2016

Ph 219b/CS 219b. Exercises Due: Wednesday 9 March 2016 1 Ph 219b/CS 219b Eercises Due: Wednesdy 9 Mrch 2016 3.1 Positivity of quntum reltive entropy ) Show tht ln 1 for ll positive rel, with equlity iff = 1. b) The (clssicl) reltive entropy of probbility distribution

More information

( ) 2. ( ) is the Fourier transform of! ( x). ( ) ( ) ( ) = Ae i kx"#t ( ) = 1 2" ( )"( x,t) PC 3101 Quantum Mechanics Section 1

( ) 2. ( ) is the Fourier transform of! ( x). ( ) ( ) ( ) = Ae i kx#t ( ) = 1 2 ( )( x,t) PC 3101 Quantum Mechanics Section 1 1. 1D Schrödinger Eqution G chpters 3-4. 1.1 the Free Prticle V 0 "( x,t) i = 2 t 2m x,t = Ae i kxt "( x,t) x 2 where = k 2 2m. Normliztion must hppen: 2 x,t = 1 Here, however: " A 2 dx " " As this integrl

More information

1 Nondeterministic Finite Automata

1 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 information

DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS

DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS 3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive

More information

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1

a,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1 CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother

More information

DETERMINATION OF MECHANICAL PROPERTIES OF NANOSTRUCTURES WITH COMPLEX CRYSTAL LATTICE USING MOMENT INTERACTION AT MICROSCALE

DETERMINATION OF MECHANICAL PROPERTIES OF NANOSTRUCTURES WITH COMPLEX CRYSTAL LATTICE USING MOMENT INTERACTION AT MICROSCALE Determintion RevAdvMterSci of mechnicl 0(009) -7 properties of nnostructures with complex crystl lttice using DETERMINATION OF MECHANICAL PROPERTIES OF NANOSTRUCTURES WITH COMPLEX CRYSTAL LATTICE USING

More information

Non Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51

Non Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51 Non Deterministic Automt Linz: Nondeterministic Finite Accepters, pge 51 1 Nondeterministic Finite Accepter (NFA) Alphbet ={} q 1 q2 q 0 q 3 2 Nondeterministic Finite Accepter (NFA) Alphbet ={} Two choices

More information

Lecture Note 9: Orthogonal Reduction

Lecture Note 9: Orthogonal Reduction MATH : Computtionl Methods of Liner Algebr 1 The Row Echelon Form Lecture Note 9: Orthogonl Reduction Our trget is to solve the norml eution: Xinyi Zeng Deprtment of Mthemticl Sciences, UTEP A t Ax = A

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

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

More information

Quantum Analogs Chapter 4 Student Manual

Quantum Analogs Chapter 4 Student Manual Quntum Anlogs Chpter 4 Student Mnul Modeling One Dimensionl Solid Professor Rene Mtzdorf Universitet Kssel Stud. Mn. Rev 2.0 12/09 4. Modeling one-dimensionl solid There re two different wys to explin

More information

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system. Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous

More information

Teleportation of qubit states through dissipative channels: Conditions for surpassing the no-cloning limit

Teleportation of qubit states through dissipative channels: Conditions for surpassing the no-cloning limit Teleporttion of quit sttes through dissiptive chnnels: Conditions for surpssing the no-cloning limit Şhin Ky Özdemir,,2,3 Krol Brtkiewicz, 4 Yu-xi Liu, 5,6 nd Adm Mirnowicz,3,4 SORST Reserch Tem for Intercting

More information

#6A&B Magnetic Field Mapping

#6A&B Magnetic Field Mapping #6A& Mgnetic Field Mpping Gol y performing this lb experiment, you will: 1. use mgnetic field mesurement technique bsed on Frdy s Lw (see the previous experiment),. study the mgnetic fields generted by

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University

Pavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University Geometric representtions of liner codes Pvel Rytí Deprtment of Applied Mthemtics Chrles University in Prgue Advisor: Mrtin Loebl November, 011 Discrete Mth Seminr - Simon Frser University Bckground Liner

More information

Surface Integrals of Vector Fields

Surface Integrals of Vector Fields Mth 32B iscussion ession Week 7 Notes Februry 21 nd 23, 2017 In lst week s notes we introduced surfce integrls, integrting sclr-vlued functions over prmetrized surfces. As with our previous integrls, we

More information

4 The dynamical FRW universe

4 The dynamical FRW universe 4 The dynmicl FRW universe 4.1 The Einstein equtions Einstein s equtions G µν = T µν (7) relte the expnsion rte (t) to energy distribution in the universe. On the left hnd side is the Einstein tensor which

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

arxiv: v1 [quant-ph] 27 May 2015

arxiv: v1 [quant-ph] 27 May 2015 Clssicl Verifiction of Quntum Proofs rxiv:1505.0743v1 [qunt-ph] 7 My 015 Zhengfeng Ji Institute for Quntum Computing nd School of Computer Science, University of Wterloo, Wterloo, Ontrio, Cnd Stte Key

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

References and Resources:

References and Resources: Surfce nd Interfce Science Physics 627; Chemistry 542 Lectures 4 Feb 3, 2013 Determining Surfce Structure Diffrction methods: LEED; RHEED Rel Spce: STEM References nd Resources: Woodruff nd Delchr (2 nd

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Consolidation Worksheet

Consolidation Worksheet Cmbridge Essentils Mthemtics Core 8 NConsolidtion Worksheet N Consolidtion Worksheet Work these out. 8 b 7 + 0 c 6 + 7 5 Use the number line to help. 2 Remember + 2 2 +2 2 2 + 2 Adding negtive number is

More information

Mapping the delta function and other Radon measures

Mapping the delta function and other Radon measures Mpping the delt function nd other Rdon mesures Notes for Mth583A, Fll 2008 November 25, 2008 Rdon mesures Consider continuous function f on the rel line with sclr vlues. It is sid to hve bounded support

More information

Anatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute

Anatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

NOTES ON HILBERT SPACE

NOTES ON HILBERT SPACE NOTES ON HILBERT SPACE 1 DEFINITION: by Prof C-I Tn Deprtment of Physics Brown University A Hilbert spce is n inner product spce which, s metric spce, is complete We will not present n exhustive mthemticl

More information

Homework Solution - Set 5 Due: Friday 10/03/08

Homework Solution - Set 5 Due: Friday 10/03/08 CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

Chapter 3 Polynomials

Chapter 3 Polynomials Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

NFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:

NFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun: CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce

More information

Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6.1 INTRO to LAPLACE TRANSFORMS Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

More information

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton 25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q

More information

Analytical Methods for Materials

Analytical Methods for Materials Anlyticl Methods for Mterils Lesson 7 Crystl Geometry nd Crystllogrphy, Prt 1 Suggested Reding Chpters 2 nd 6 in Wsed et l. 169 Slt crystls N Cl http://helthfreedoms.org/2009/05/24/tble-slt-vs-unrefined-se-slt--primer/

More information

1 From NFA to regular expression

1 From NFA to regular expression Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work

More information

Quantum Physics I (8.04) Spring 2016 Assignment 8

Quantum Physics I (8.04) Spring 2016 Assignment 8 Quntum Physics I (8.04) Spring 206 Assignment 8 MIT Physics Deprtment Due Fridy, April 22, 206 April 3, 206 2:00 noon Problem Set 8 Reding: Griffiths, pges 73-76, 8-82 (on scttering sttes). Ohnin, Chpter

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Vector potential quantization and the photon wave-particle representation

Vector potential quantization and the photon wave-particle representation Vector potentil quntiztion nd the photon wve-prticle representtion Constntin Meis, Pierre-Richrd Dhoo To cite this version: Constntin Meis, Pierre-Richrd Dhoo. Vector potentil quntiztion nd the photon

More information

John Preskill, Caltech KITP 7 June 2003

John Preskill, Caltech KITP 7 June 2003 Topologil quntum omputing for eginners John Preskill, Clteh KITP 7 June 2003 http://www.iqi.lteh.edu/ http://www.theory.lteh.edu/~preskill/ph29/ph29_2004.html Kitev Freedmn Kitev Freedmn Kitev, Fult-tolernt

More information