Spin Networks and Anyonic Topological Quantum Computing. L. H. Kauffman, UIC.
|
|
- Dana Whitehead
- 5 years ago
- Views:
Transcription
1 Spin Networks n Anyoni Topologil Quntum Computing L. H. Kuffmn, UC qunt-ph/ n qunt-ph/ Spin Networks n Anyoni Topologil Computing Louis H. Kuffmn n Smuel J. Lomono Jr. Deprtment of Mthemtis, Sttistis n Computer Siene (m/ 249), 851 South Morgn Street, University of llinois t Chigo, Chigo, llinois , USA Deprtment of Computer Siene n Eletril Engineering, University of Mryln Bltimore County, 1000 Hilltop Cirle, Bltimore, MD 21250, USA
2 Originl Motivtion: Use topologil strutures to solve prolem of eoherene in physil reliztion of quntum omputing systems. The Hope: physil system suh s quntum Hll flui, hving topologil fetures, will e resistnt to perturtion n so give rise to relile n slle omputing..
3 Quntum Hll systems re ttrtive: They re relte to Conforml Fiel Theory n Chern-Simons-Witten Theory on physil sie n to funmentl low imensionl topology. Gtes woul e onstrute vi the riing of olletive eletroni exittions in two imensionl mei. nvestigtion of the topology les to rih unitry representtions of the Artin ri group.
4 Representtions of the ri group n generte ll unitry trnsformtions neee for quntum omputing. Unitry representtions of the Artin ri group hve s muh import s the symmetri groups for the struture of unitry groups.
5 Unitry representtions of the Artin ri group give rise to quntum lgorithms for omputing the originl Jones polynomil, the olore Jones polynomil n the Witten-Reshetikhin-Turev invrints of three-mnifols.
6 Topology n Quntum Computing: Reltionships etween topology n quntum omputing re signifint for 1. Future physis n physil pplitions. 2. The mthemtis of quntum informtion. 3. The struture of quntum lgorithms.
7 Quntum Computtion of the Tre of Unitry Mtrix U 1. A goo exmple of quntum lgorithm. 2. Useful for the quntum omputtion of knot polynomils suh s the Jones polynomil.
8 Hmr Test 0> phi> H U H Mesure 0> 0> ours with proility 1/2 + Re[<phi U phi>]/2
9 Universl Gtes A two-quit gte G is unitry liner mpping G : V V V V where V is two omplex imensionl vetor spe. We sy tht the gte G is universl for quntum omputtion (or ust universl) if G together with lol unitry trnsformtions (unitry trnsformtions from V to V ) genertes ll unitry trnsformtions of the omplex vetor spe of imension 2 n to itself. t is well-known [44] tht CNOT is universl gte. Lol Unitries re generte (up to ensity) y smll numer of gtes. Expliit gte reliztion in the sis f0i; 1ig: H D p ; S D i ; T D e i4
10 A gte G is universl iff G is entngling. A gte G, s ove, is si to e entngling if there is vetor αβ α β V V suh tht G αβ is not eomposle s tensor prout of two quits. Uner these irumstnes, one sys tht G αβ is entngle. n [6], the Brylinskis give generl riterion of G to e universl. They prove tht two-quit gte G is universl if n only if it is entngling.
11 Briing n the Yng-Bxter Eqution R R R R R R R R (R )( R)(R ) ( R)(R )( R).
12 Representtive Exmples of Unitry Solutions to the Yng-Bxter Eqution tht re Universl Gtes. R 1/ / 2 0 1/ 2 1/ / 2 1/ 2 0 1/ / 2 Bell Bsis Chnge Mtrix R R R Swp Gte with Phse te.
13 Quntum Hll Effet
14 Briing Anyons Λ Reoupling Proess Spes
15 Non-Lol Briing is nue vi Reoupling F R F B F RF
16 Proess Spes Cn e Aitrrily Lrge. With oherent reoupling theory, ll trnsformtions re in the representtion of one ri group.
17 Mthemtil Moels for Reoupling Theory with Briing ome from Comintion of Penrose Spin Networks n Knot Theory. See Temperley Lie Reoupling Theory n nvrints of Three-Mnifols y L. Kuffmn n S. Lins, PUP, 1994.
18 Knots n Links s s 1 2 Bri Genertors Hopf Link s s 3 1 s s Trefoil Knot s 1 s 2 s 1 s 2 s 1 s 2 s 1 s 3 s s 3 1 Figure Eight Knot
19 Brket Polynomil Moel for Jones Polynomil A A A A A A < > A < > + A < > < > A < > + A < > < K > S < K S > δ S 1.
20 y mesuring mplitue n phse in referene setting.. r.. Untying Knots y NMR: first experimentl implementtion of quntum lgorithm for pproximting the Jones polynomil Rimun Mrx 1, Anres Spörl, Amr F. Fhmy, John M. Myers, Louis H. Kuffmn, Smuel J. Lomono, Jr., Thoms-Shulte-Herrüggen, n Steffen J. Glser 1 Deprtment of Chemistry, Tehnil University Munih, Lihtenergstr. 4, Grhing, Germny 2 Hrvr Meil Shool, 25 Shttuk Street, Boston, MA 02115, U.S.A. 3 Goron MKy Lortory, Hrvr University, 29 Oxfor Street, Cmrige, MA 02138, U.S.A. 4 University of llinois t Chigo, 851 S. Morgn Street, Chigo, L , U.S.A. 5 University of Mryln Bltimore County, 1000 Hilltop Cirle, Bltimore, MD 21250, U.S.A. romp of the quntum lgorithm exmple #1 Trefoil exmple #2 Figure-Eight exmple #3 Borromen rings A knot is efine s lose, non-self-interseting urve tht is emee in three imensions. exmple: onstrution of the Trefoil knot: knot or link mke knot fuse the free ens mke it look nie strt with rope en up with Trefoil trelose ri J. W. Alexner prove, tht ny knot n e represente s lose ri (polynomil time lgorithm) genertors of the 3 strn ri group: unitry mtrix i e U 1 0 U 3 1 U Trefoil 1 U U 2 Figure Eight 2 U1 0 i sin(4 ) i e e sin(2 ) 1 U U Borrom. R. U i sin(6 ) i i sin(6 )sin(2 ) e e e sin(4 ) sin(4 ) U 2 i sin(2 ) i sin(6 )sin(2 ) i e e e sin(4 ) sin(4 ) t is well known in knot theory, how to otin the unitry mtrix representtion of ll genertors of given ri goup (see Temperley-Lie lger n pth moel representtion ). The unitry mtries U1 n U 2, orresponing to the genertors 1 n 2 of the 3 strn ri group re shown on the left, where the vrile is relte i to the vrile A of the Jones polynomil y: A e. 1 2 The unitry mtrix representtions of n re given y U1 n U 2. The knot or link tht ws expresse s prout of ri group genertors n therefore lso e expresse s prout of the orresponing unitry mtries. ontrolle unitry mtrix Step #1: from the 2x2 mtrix U to the 4x4 mtrix U: 1 0 U ( 0 U ) U 1x Step #2: pplition of U on the NMR prout opertor 1x : 1 0 U 1 ( 0 U ) ( ) ( 0 U ) 1 ( ) 0 U 2 U 0 Step #3: mesurement of 1x n 1y : 0 U tr { 1x ( U 0 )} 1 1 ( tr{ U}) U tr { 1y ( U 0 ) } 1 1 ( tr{ U}) 2 2 U, U nste of pplying the unitry mtrix we pply it s ontrolle vrint. This mtrix is espeilly suite for NMR quntum omputers [4] n other therml stte expettion vlue quntum omputers: you only hve to pply U to the NMR prout opertor n mesure 1x n 1y in orer to otin 1x the tre of the originl mtrix U. nepenent of the imension of mtrix U you only nee ONE extr quit for the implementtion of U s ompre to the implementtion of U itself. The mesurement of 1x n 1y n e omplishe in one single-sn experiment. NMR pulse sequene S U 1 mens S - z - z J S U 1 U 1 U 1 S U 1 mens S y J S - y z z S U 2 mens U 1 U 2 U 1 U 2 S y - z - z J - y S S U 2 mens S + U 1 U 2 U 1 U 2 U 1 U 2 y J - y z z - y All knots n links n e expresse s prout of ri group genertors (see ove). Hene the orresponing NMR pulse sequene n lso e expresse s sequene of NMR pulse sequene loks, where eh lok orrespons to the ontrolle unitry mtrix U of one ri group genertor.. This moulr pproh llows for n esy optimiztion of the NMR pulse sequenes: only smll n limite numer of pulse sequene loks hve to e optimize.. NMR experiment Comprison of experimentl results, theoretil preitions, n simulte experiments, where relisiti inperfetions like relxtion, B1 fiel inhomogeneity, n finite length of the pulses re inlue. For eh t point, four single-sn NMR experiments hve een performe: mesurement of 1x, mesurement of 1y, referene for 1x, n referene for 1y. f neessry eh t point n lso e otine in one single-sn experiment Jones polynomil Jones Polynomil Trefoil": ( A + A - A ) 2-2 (- A - A ) Jones Polynomil Figure-Eight": Jones Polynomil Borromen rings": + 4A A - A - A + 3A - 2A + A - A -4 - A + 3A 0-2A + A 0 The Jones Polynomils n e reonstrute out of the NMR experiments y: 3 -w( L) ( L) V (A)(- A ) ( tr{ U} + A [(-A -A ) -2]) L where: w( L) is the writhe of the knot or link L tr{ U} is etermine y the NMR experiments ( L) is the sum of exponents in the ri wor orresponing to the knot or link L Referenes: 1) 1) L. Kuffmn, AMS Contemp. Mth. Series, 305, eite y S. J. Lomono, (2002), (mth.qa/ ) 2) R. Mrx, A. Spörl, A. F. Fhmy, J. M. Myers, L. H. Kuffmn, S. J. Lomono, Jr., T. Shulte-Herrüggen, n S. J. Glser: pper in preprtion 3) Vughn F. R. Jones, Bull. Amer. Mth. So., (1985), no. 1, ) J. M. Myers, A. F. Fhmy, S. J. Glser, R. Mrx, Phys. Rev. A, (2001), 63, (qunt-ph/ ) 5) D. Ahronov, V. Jones, Z. Lnu, Proeeings of the STOC 2006, (2006), (qunt-ph/ ) 6) M. H. Freemn, A. Kitev, Z. Wng, Commun. Mth. Phys., (2002), 227,
21 q-deforme Spin Networks ~ 2-2 -A - A 2 1/δ A + A n 1 1 n 1 1 n... n n / n n+1 n n strns δ n+1 - n n {n}! Σ σ ε S n -4 t( σ) (A ) 0 n -3 t( σ ) (1/{n}!) (A ) Σ σ ε S n ~ σ i k 45 i + + k i + k
22 Proess Vetor Spes n Reoupling ε V( ) e f ε V( )
23 Briing, Nturlity, Reoupling, Pentgon n Hexgon -- Automti Consequenes of the Constution R F F R F F F F F F R R F
24 P P P P Fioni Moel A e 3πi/5. ) ( 1/δ * P P P P 0 P 111 im(v ) 1 0 Forien * P P P P P P P P * P 1111 im(v ) 2 0 * * 0 > 1 > P P Temperley Lie Representtion of Fioni Moel
25 The Simple, yet Quntum Universl, Struture of the Fioni Moel A e 3πi/5. ) ( ( ) ( ) δ A 2 A 2 δ (1 + 5)/2, ( 1/ 1/ F 1/ 1/ ( ) A 4 0 R 0 A 8 ) ( ) τ τ τ τ ( e 4πi/5 0 0 e 2πi/5 exmple of ri group representtion ).
26 Θ(,, ) Θ(,, ) δ { } i Σ i k [ ] Tet i k i Closure, Bule n Reoupling
27 The 6- Coeffiients i k Σ i { } k Σ i { } Θ(,, ) Θ(,, ) k δ { } i Θ(,, k) Θ(,, k ) k k i { } k Tet i [ ] k k Θ(,, k) Θ(,, k)
28 Lol Briing λ λ (+-)/2 () A ('+'-')/2 x' x(x+2)
29 Θ(,, ) Reefining the Vertex is the key to otining Unitry Reoupling Trnsformtions. Θ(,, ) Θ(,, )
30 Σ i k Σ δ k k MoTet[ ] i i i i i k k k i New Reoupling Formul
31 The Reoupling Mtrix is Rel Unitry t Roots of Unity. i Σ i i i, i i M[,,,] i i T
32 Theorem. Unitry Representtions of the Bri Group ome from Temperley Lie Reoupling Theory t roots of unity. A e iπ/2r Suffiient to Proue Enough Unitry Trnsformtions for Quntum Computing.
33 Quntum Computtion of Colore Jones Polynomils n WRT invrints. B P(B) Σ B(x,y) x y x, y Σ B(x,y) if 0 0 Σ x, y B(x,y) x 0 y 0 0 B(0,0) if 0 B(0,0) ( ) 2 B(0,0) ( ) 2 Nee to ompute igonl element of unitry trnsformtion. Use the Hmr Test.
34 Will these moels tully e use for quntum omputtion? Will quntum omputtion tully hppen? Will topology ply key role? Time will tell.
Spin Networks and Anyonic Topological Quantum Computing L. H. Kauffman, UIC.
Spin Networks n Anyoni Topologil Quntum Computing L. H. Kuffmn, UIC 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
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 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 informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
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 informationGraph 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
More informationLecture 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
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 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 informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More informationTopological 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 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 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 informationN=2 Gauge Theories. S-duality, holography and a surprise. DG, G. Moore, A. Neitzke to appear. arxiv:
N=2 Guge Theories S-ulity, hologrphy n surprise DG, G. Moore, A. Neitzke to pper DG: rxiv:0904.2715 DG, J. Mlen: rxiv:0904.4466 L.F.Aly, DG, Y.Thikw: rxiv:0906.3219 1 Overview M5 rnes on Riemnn surfes.
More informationSOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVEX STOCHASTIC PROCESSES ON THE CO-ORDINATES
Avne Mth Moels & Applitions Vol3 No 8 pp63-75 SOME INTEGRAL INEQUALITIES FOR HARMONICALLY CONVE STOCHASTIC PROCESSES ON THE CO-ORDINATES Nurgül Okur * Imt Işn Yusuf Ust 3 3 Giresun University Deprtment
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 informationEntanglement Purification
Lecture Note Entnglement Purifiction Jin-Wei Pn 6.5. Introduction( Both long distnce quntum teleporttion or glol quntum key distriution need to distriute certin supply of pirs of prticles in mximlly entngled
More informationLearning Partially Observable Markov Models from First Passage Times
Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).
More informationCS 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,
More informationNow we must transform the original model so we can use the new parameters. = S max. Recruits
MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with
More informationTotal score: /100 points
Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
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 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 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 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 informationFactorising 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
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 informationMCH T 111 Handout Triangle Review Page 1 of 3
Hnout Tringle Review Pge of 3 In the stuy of sttis, it is importnt tht you e le to solve lgeri equtions n tringle prolems using trigonometry. The following is review of trigonometry sis. Right Tringle:
More informationSlope Lengths for 2-Bridge Parent Manifolds. Martin D. Bobb
Cliorni Stte University, Sn Bernrino Reserh Experiene or Unergrutes Knot Theory Otoer 28, 2013 Hyperoli Knot Complements Hyperoli Knots Deinition A knot or link K is hyperoli i hyperoli metri n e ple on
More informationChapter Five - Eigenvalues, Eigenfunctions, and All That
Chpter Five - Eigenvlues, Eigenfunctions, n All Tht The prtil ifferentil eqution methos escrie in the previous chpter is specil cse of more generl setting in which we hve n eqution of the form L 1 xux,tl
More informationJohn 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 informationPavel 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 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 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 informationProportions: A ratio is the quotient of two numbers. For example, 2 3
Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)
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 informationCARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005
RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).
More informationIf we have a function f(x) which is well-defined for some a x b, its integral over those two values is defined as
Y. D. Chong (26) MH28: Complex Methos for the Sciences 2. Integrls If we hve function f(x) which is well-efine for some x, its integrl over those two vlues is efine s N ( ) f(x) = lim x f(x n ) where x
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
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 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 information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
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 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 informationUnit 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
More informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
More informationSufficient condition on noise correlations for scalable quantum computing
Sufficient condition on noise correltions for sclble quntum computing John Presill, 2 Februry 202 Is quntum computing sclble? The ccurcy threshold theorem for quntum computtion estblishes tht sclbility
More 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 informationLesson 55 - Inverse of Matrices & Determinants
// () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n
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 information1 This diagram represents the energy change that occurs when a d electron in a transition metal ion is excited by visible light.
1 This igrm represents the energy hnge tht ours when eletron in trnsition metl ion is exite y visile light. Give the eqution tht reltes the energy hnge ΔE to the Plnk onstnt, h, n the frequeny, v, of the
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
More informationConservation Law. Chapter Goal. 6.2 Theory
Chpter 6 Conservtion Lw 6.1 Gol Our long term gol is to unerstn how mthemticl moels re erive. Here, we will stuy how certin quntity chnges with time in given region (sptil omin). We then first erive the
More informationarxiv: 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 informationTutorial 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
More informationPolarimetric Target Detector by the use of the Polarisation Fork
Polrimetri rget Detetor y the use of the Polristion For Armndo Mrino¹ hne R Cloude² Iin H Woodhouse¹ ¹he University of Edinurgh, Edinurgh Erth Oservtory (EEO), UK ²AEL Consultnts, Edinurgh, UK POLinAR009
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
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 informationExtended 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 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 informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
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 informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationModel 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
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationLecture Notes PH 411/511 ECE 598 A. La Rosa Portland State University INTRODUCTION TO QUANTUM MECHANICS
Lecture Notes PH 4/5 ECE 598. L Ros Portlnd Stte University INTRODUCTION TO QUNTUM MECHNICS Underlying subject of the PROJECT ssignment: QUNTUM ENTNGLEMENT Fundmentls: EPR s view on the completeness of
More 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 informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationPrefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationParticle Lifetime. Subatomic Physics: Particle Physics Lecture 3. Measuring Decays, Scatterings and Collisions. N(t) = N 0 exp( t/τ) = N 0 exp( Γt/)
Sutomic Physics: Prticle Physics Lecture 3 Mesuring Decys, Sctterings n Collisions Prticle lifetime n with Prticle ecy moes Prticle ecy kinemtics Scttering cross sections Collision centre of mss energy
More informationOn Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
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 informationarxiv: v1 [cond-mat.str-el] 22 Dec 2016
Refletion n time reversl symmetry enrihe topologil phses of mtter: pth integrls, non-orientle mnifols, n nomlies Missm Brkeshli, 1,, 3, 4 Prs Bonerson, 4 Meng Cheng, 5, 4 Cho-Ming Jin, 3, 4 n Kevin Wlker
More informationMatrix- System of rows and columns each position in a matrix has a purpose. 5 Ex: 5. Ex:
Mtries Prelulus Mtri- Sstem of rows n olumns eh position in mtri hs purpose. Element- Eh vlue in the mtri mens the element in the n row, r olumn Dimensions- How mn rows b number of olumns Ientif the element:
More informationSTRAND J: TRANSFORMATIONS, VECTORS and MATRICES
Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors
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 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 informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
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 informationMATH 122, Final Exam
MATH, Finl Exm Winter Nme: Setion: You must show ll of your work on the exm pper, legily n in etil, to reeive reit. A formul sheet is tthe.. (7 pts eh) Evlute the following integrls. () 3x + x x Solution.
More informationSection 2.3. Matrix Inverses
Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
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 informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationTopological 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 informationGeodesics on Regular Polyhedra with Endpoints at the Vertices
Arnol Mth J (2016) 2:201 211 DOI 101007/s40598-016-0040-z RESEARCH CONTRIBUTION Geoesis on Regulr Polyher with Enpoints t the Verties Dmitry Fuhs 1 To Sergei Thnikov on the osion of his 60th irthy Reeive:
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationUnfoldings of Networks of Timed Automata
Unfolings of Networks of Time Automt Frnk Cssez Thoms Chtin Clue Jr Ptrii Bouyer Serge H Pierre-Alin Reynier Rennes, Deemer 3, 2008 Unfolings [MMilln 93] First efine for Petri nets Then extene to other
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 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 informationPoS(LL2016)035. Cutkosky Rules from Outer Space. Dirk Kreimer Humboldt Univ.
Cutkosky Rules from Outer Spe Humoldt Univ. E-mil: kreimer@physik.hu-erlin.de We overview reent results on the mthemtil foundtions of Cutkosky rules. We emphsize tht the two opertions of shrinking n internl
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 informationGeneralized Kronecker Product and Its Application
Vol. 1, No. 1 ISSN: 1916-9795 Generlize Kroneker Prout n Its Applition Xingxing Liu Shool of mthemtis n omputer Siene Ynn University Shnxi 716000, Chin E-mil: lxx6407@163.om Astrt In this pper, we promote
More informationComputing all-terminal reliability of stochastic networks with Binary Decision Diagrams
Computing ll-terminl reliility of stohsti networks with Binry Deision Digrms Gry Hry 1, Corinne Luet 1, n Nikolos Limnios 2 1 LRIA, FRE 2733, 5 rue u Moulin Neuf 80000 AMIENS emil:(orinne.luet, gry.hry)@u-pirie.fr
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 informationImplication 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,
More information