The realization of a full-scale quantum computer presents one

Size: px
Start display at page:

Download "The realization of a full-scale quantum computer presents one"

Transcription

1 ARICLES PUBLISED ONLINE: 7 DECEMBER 28 DOI:.38/NPYS5 Simplifying quntum logic using higher-dimensionl ilert spces Benjmin P. Lnyon *, Mrco Brieri, Mrcelo P. Almeid, homs Jennewein,2, imothy C. Rlph, Kevin J. Resch,3, Geoff J. Pryde,4, Jeremy L. O Brien,5, Alexei Gilchrist,6 nd Andrew G. White Quntum computtion promises to solve fundmentl, yet otherwise intrctle, prolems cross rnge of ctive fields of reserch. Recently, universl quntum logic-gte sets the elementl uilding locks for quntum computer hve een demonstrted in severl physicl rchitectures. A serious ostcle to full-scle implementtion is the lrge numer of these gtes required to uild even smll quntum circuits. ere, we present nd demonstrte generl technique tht hrnesses multi-level informtion crriers to significntly reduce this numer, enling the construction of key quntum circuits with existing technology. We present implementtions of two key quntum circuits: the three-quit offoli gte nd the generl two-quit controlled-unitry gte. Although our experiment is crried out in photonic rchitecture, the technique is independent of the prticulr physicl encoding of quntum informtion, nd hs the potentil for wider ppliction. he reliztion of full-scle quntum computer presents one of the most chllenging prolems fcing modern science. Even implementing smll-scle quntum lgorithms requires high level of control over multiple quntum systems. Recently, much progress hs een mde with demonstrtions of universl quntum gte sets in numer of physicl rchitectures including ion trps,2, liner optics 3 6, superconductors 7,8 nd toms 9,. In theory, these gtes cn now e put together to implement ny quntum circuit nd uild sclle quntum computer. In prctice, there re mny significnt ostcles tht will require oth theoreticl nd technologicl developments to overcome. One is the sheer numer of elementl gtes required to uild quntum logic circuits. Most pproches to quntum computing use quits the quntum version of its. A quit is two-level quntum system tht cn e represented mthemticlly y vector in two-dimensionl ilert spce. Relizing quits typiclly requires enforcing twolevel structure on systems tht re nturlly fr more complex nd which hve mny redily ccessile degrees of freedom, such s toms, ions or photons. ere, we show how hrnessing these extr levels during computtion significntly reduces the numer of elementl gtes required to uild key quntum circuits. Becuse the technique is independent of the physicl encoding of quntum informtion nd the wy in which the elementl gtes re themselves constructed, it hs the potentil to e used in conjunction with existing gte technology in wide vriety of rchitectures. Our technique extends recent proposl, nd we use it to demonstrte two key quntum logic circuits: the offoli nd controlled-unitry 2 gtes. We first outline the technique in generl context, then present n experimentl reliztion in liner optic rchitecture: without our resource-sving technique, liner optic implementtions of these gtes re infesile with current technology. Simplifying the offoli gte One of the most importnt quntum logic gtes is the offoli 2 three-quit entngling gte tht flips the logicl stte of the trget quit conditionl on the logicl stte of the two control quits. Fmously, these gtes enle universl reversile clssicl computtion, nd hve centrl role in quntum error correction 3 nd fult tolernce 4. Furthermore, the comintion of the offoli nd the one-quit dmrd offers simple universl quntum gte set 5. he simplest known decomposition of offoli when restricted to operting on quits throughout the clcultion is circuit tht requires five two-quit gtes 2. If we further restrict ourselves to controlled-z (or cnot) gtes, this numer clims to six 2 (Fig. ). A decomposition tht requires only three two-quit gtes is shown in Fig.. he incresed efficiency is chieved y hrnessing third level of the trget informtion crrier the trget is ctully qutrit with logicl sttes, nd 2. At the input nd output of the circuit, informtion is encoded only in the ottom two (quit) levels of the trget. he ction of the first X gte is to move informtion from the logicl stte of the trget into the third level ( 2 ), which then ypsses the susequent two-quit gtes. he finl X gte then coherently rings this informtion ck into the stte, reconstructing the logicl quit. By temporrily storing prt of the informtion in this third level, we re effectively removing it from the clcultion enling the susequent two-quit gtes to operte on suspce of the trget. his enles n implementtion of the offoli with significntly reduced numer of gtes. Note tht only stndrd two-quit gtes re necessry, with the extr requirement tht they ct only trivilly on (tht is, pply the identity to) level 2 of the qutrit. As such, it is not necessry to develop universl set of gtes for qutrits. his technique cn e redily generlized to implement higher-order n-control-quit offoli gtes ( n t) y hrnessing single (n+)-level informtion crrier during computtion nd Deprtment of Physics nd Centre for Quntum Computer echnology, University of Queenslnd, Brisne 472, Austrli, 2 Institute for Quntum Optics nd Quntum Informtion, Austrin Acdemy of Sciences, Boltzmnng. 3, A-9 Vienn, Austri, 3 Institute for Quntum Computing nd Deprtment of Physics & Astronomy, University of Wterloo, N2L 3G, Cnd, 4 Centre for Quntum Dynmics, Griffith University, Brisne 4, Austrli, 5 Centre for Quntum Photonics,.. Wills Physics Lortory nd Deprtment of Electricl nd Electronic Engineering, University of Bristol, Merchnt Venturers Building, Woodlnd Rod, Bristol BS8 UB, UK, 6 Physics Deprtment, Mcqurie University, Sydney 29, Austrli. *e-mil: lnyon@physics.uq.edu.u. 34 NAURE PYSICS VOL 5 FEBRUARY 29

2 NAURE PYSICS DOI:.38/NPYS5 ARICLES C 3 C Z π C X Quit Quit Qutrit X Quit opertors 2 Qutrit opertor X X = e iπ/4 Figure Simplifying the offoli gte., Most efficient known decomposition into the universl gte set CNO +ritrry one-quit gte, when restricted to operting on quits 2., Our decomposition requiring only three two-quit gtes. ere, the trget is three-level qutrit with logicl sttes, nd 2. Initilly nd finlly, ll of the quntum informtion is encoded in the nd levels of ech informtion crrier. he ction of the X gtes is to swp informtion etween the logicl nd 2 sttes of the trget. he trget undergoes sign shift only for the input term,c, =,,. his opertion is equivlent to the offoli under the ction of only three one-quit gtes, s shown. he second gte in the decomposition is CZ nd is equivlent to CNO under the ction of two one-quit dmrd () gtes. only 2n stndrd two-quit gtes ; tht is, with ech extr control quit we need n extr level in the trget crrier (see Fig. 2). Compre this with the previous est known scheme, which requires 2n two-quit gtes nd n extr overhed of n extr ncill quits 2. When restrined from using ncill, this scheme requires of the order of n 2 two-quit gtes. In either cse, we chieve significnt resource reduction, y hrnessing only higher levels of existing informtion crriers. For exmple, the simplest known decomposition of the 5 t requires 5 two-quit gtes nd four ncill quits, when restricted to operting on quits 2. Our technique requires only nine two-quit gtes nd no ncillry informtion crriers. Extension to more generl quntum circuits Figure 3 shows n extension to simplify the construction of nother key quntum circuit: the n-control-quit unitry gte (c n u), which pplies n ritrry one-quit gte (u) to trget conditionl on the stte of n control quits. hese circuits hve centrl role in quntum computing, prticulrly in the phse-estimtion lgorithm 2. Phse estimtion underpins mny importnt pplictions of quntum computing including quntum simultion 6 nd Shor s fmous lgorithm for fctoring 7. Furthermore, the set of c u gtes lone is sufficient for universl quntum computing; c u cn implement cnot nd induce ny single-quit rottion t the expense of n ncill quit. Our technique cn implement c n u using n (n+)-level trget nd only 2n two-quit gtes. his is similr improvement, over schemes limited to quits, to tht chieved for the offoli 2. Figure 4 shows further generliztion to efficiently dd control quits to n ritrry controlled-unitry tht opertes on k quits. Potentil for ppliction he technique tht we descrie is independent of the prticulr physicl system used to encode quntum informtion nd the X e i θ C X X X X Figure 2 Simplifying higher-order offoli gtes. hree-control-quit offoli. he X gte swps informtion etween the logicl nd 2 sttes of the trget. he X gte flips informtion etween the logicl nd 3 stte of the trget. hus, we require ccess to four-level trget informtion crrier: two levels in the originl ril nd one in ech of the dshed rils. he trget undergoes sign shift only for the input term C 3,,C, =,,,. his opertion is equivlent to the offoli under the ction of only two one-quit gtes, s shown. See Fig. for gte opertions. C V U V C V U V X X X X X Figure 3 Simplifying controlled-unitry gtes., One control quit (we implement simplified version, see Fig. 5): the control opertion occurs if C =., wo control quits: the control opertion occurs if,c =,. V V is the spectrl decomposition of U, up to glol phse fctor. See Fig. for gte opertions. wy in which the elementl gtes re relized. Consequently, it hs the potentil for ppliction in mny rchitectures, yielding the sme resource svings. he only physicl requirements re ccess to multi-level systems nd the ility to coherently swp informtion etween these levels, tht is, implement the generlized X gtes (Fig. 2). Fortuntely, most of the cndidte systems for encoding quntum informtion nturlly offer multi-level structures tht re redily ccessile. For exmple, the photon hs lrge numer of degrees of freedom including polriztion, trnsverse sptil mode, rrivl time, photon numer nd frequency. Coherent control over nd etween mny of these dimensions hs lredy een demonstrted nd shown to offer significnt dvntges in rnge of pplictions such s quntum communiction nd mesurement 8,9. rpped ions lso offer redily ccessile levels including multiple electronic nd virtionl modes. Indeed, oth liner optic 2 nd trpped-ion 2,22 quntum computing rchitectures lredy routinely use multi-level systems to implement two-quit gtes nd relize universl gte sets. Clerly the tools re ville to exploit our technique, the enefits of which lie t the next level of construction uilding lrge quntum circuits. An immedite enefit of significnt reduction in the numer of two-quit gtes required for quntum circuits is n eqully significnt speed-up in processing time. his hs prticulr dvntges in the mny cses where short coherence times re n ostcle in the pth to sclility. Furthermore, s we illustrte in the next section, our technique rings whole rnge of logic circuits X NAURE PYSICS VOL 5 FEBRUARY

3 ARICLES K C 3 U k C X X X X Figure 4 Efficiently dding control quits to n ritrry controlled circuit. Circuit for three-control-quit unitry cting on k quits, c 3 u k. Given the ility to crry out single instnce of c u k, n extr control quits cn e dded t cost of n extr 2n two-quit gtes nd n extr n levels in C. he X j perform s descried in the cption of Fig. 2. he control opertion occurs if C 3,,C =,,. within rech of current technology, enling the implementtion nd explortion of new circuits in the lortory. Demonstrtion in liner opticl rchitecture ere, we present n implementtion of the offoli nd the c u, using photons to encode informtion nd liner optics to construct the component quntum logic gtes (see the Methods section). We cknowledge previous demonstrtions of offoli gte in liquid stte nmr, which do not exploit our resource-sving U k NAURE PYSICS DOI:.38/NPYS5 technique 3, Our demonstrtion uses two-quit gtes, the successful opertion of which is indicted y detection of one photon in ech of the sptil output modes 3,27 3. Such gtes re high performing, well chrcterized, offer fst gte speeds nd hve severl known pths to sclle quntum computing 2,3 33. We note tht our resource-sving technique is fundmentlly different from nd potentilly complementry to the numerous liner optics schemes for reducing the overhed ssocited with generting universl resource ; here, we re concerned with reducing the mount of tht resource required to uild circuits. Figure 5 shows schemtic digrms of our experiment (see the Methods section). Key steps re the expnsion of the ilert spce of the trget informtion crrier (), effected y the first polrizing emsplitter (PBS), nd contrction ck into the originl spce, effected y the components in the dshed rectngle. Before PBS, we hve two-level system in the trget ril with logicl sttes = nd V = (horizontl nd verticl photon polriztion). PBS then moves informtion encoded in the logicl stte into seprte sptil mode, which ypsses the susequent two-quit gtes. After PBS, we hve ccess to four-level system; two levels in the top ril (t) nd two in the ottom ril (), with logicl sis sttes,t, V,t,, nd V,, respectively. Although we need to use only one of the extr levels in the ottom ril to enct our technique, we use oth in our experiment simply to lnce opticl pth lengths. he contrction ck into the originl two-level polriztion quit is crried out non-deterministiclly, tht is, given deterministic two-quit gtes, mesurement of single photon t D herlds successful run of the gte. his enles demonstrtion of the offoli nd c u without the lst cnot in c D4 C t R D Lser ±2.5 nm V PBS PBS2 SG PDC Non-deterministic recomintion of C ±2.5 nm L L2 ±.5 nm D2 D3 t PPBS PPBS2 '' L3 ±.5 nm D Bem displcer (PBS / X) CNO CZ R Bem displcer (PBS2 / X ) Interference filter Loss element C R = R V = 2/3 R = /2 R V = /2 SPCM Lens Fire coupler Anlysis/prep λ /2 λ /4 Figure 5 offoli nd controlled-unitry experimentl lyout., Conceptul logic circuit. A polrizing em splitter temporrily expnds the ilert spce of the trget informtion crrier, from polriztion-encoded photonic quit to multi-level system distriuted cross polriztion nd longitudinl sptil mode. Informtion in the ottom ril () ypsses the two-quit gtes. Detection of photon t D herlds successful implementtion. R = I (the identity) implements offoli. R = (see Fig. ) implements C U etween C nd (in this cse, no photon is injected into ).,c, Experimentl circuit nd opticl source (see the Methods section). We use n inherently stle polriztion interferometer using two clcite em displcers 3. PPBS, prtilly polrizing em splitter; SPCM, single-photon counting module; PDC, prmetric downconversion; SG, second-hrmonic genertion. 36 NAURE PYSICS VOL 5 FEBRUARY 29

4 NAURE PYSICS DOI:.38/NPYS Figure 6 Experimentlly constructed offoli logicl truth tle. he lels on the x nd y xes identify the stte,c,. Idelly, flip of the logicl stte of the trget quit () occurs only when oth control quits ( nd C ) re in the logicl stte. he idel cse is shown s wire grid nd the overlp is I =.8±.3 (see the Methods section). Error rs re shown representing one stndrd devition, clculted from Poissonin photon-counting sttistics. he tle required four dys of mesurement. Figs nd 3, therey mking n implementtion fesile with recent developments in liner optic quntum gtes 37,38. For our implementtion of the offoli, we require four photons. We oserve fourfold coincidence rte t the output of our circuit of pproximtely mz when running t full pump lser power. Although this is not sufficient to crry out full process tomogrphy 27 of the gte over prcticl time period, we re le to demonstrte ll of the key spects of its ehviour. he first step in our chrcteriztion is to test the clssicl ction of the gte, tht ARICLES is, the ility to pply the correct opertion to ll eight logicl input sttes. Figure 6 shows the experimentlly reconstructed logicl truth tle. In the idel cse of our implementtion, the trget () undergoes logicl flip if, nd only if, oth control quits re in the logicl stte. We mesure good overlp etween the idel nd mesured truth tles 39 of I=.8±.3, compred with.84 nd.85 chieved for the originl opticl implementtions of two-quit gtes 3,3. his is comprehensive test of the clssicl ction of our gte. he next step is to test the quntum ction of the gte, tht is, the ility to pply the correct opertion to input superposition sttes. At our count rtes, we re not le to test tomogrphiclly complete set required for full process chrcteriztion, over prcticl time period. Our concession is to test the most experimentlly chllenging nd functionlly importnt cses. hey re chllenging ecuse they require coherent interction etween ll three quits nd, in two cses, idelly generte mximlly entngled Bell sttes 2. hey re functionlly importnt ecuse they demonstrte the gtes ility to generte nd control lrge mount of entnglement. his is of fundmentl importnce to the dvntges offered y universl quntum computer 4 nd is stndrd figure of merit 3 6. In the idel cse: with n input stte of,(+), / 2, our offoli will produce the entngled stte,ψ +, where Ψ + is the mximlly entngled Bell stte 2 (, +, )/ 2; with n input stte of,c, =,(+), / 2, it will produce the seprle output stte,(+), / 2. In the former (ltter) cse, the entngling opertion etween C nd is coherently turned on (off) y. We then swp the roles of the control quits nd repet the test. We crry out over-complete full stte tomogrphy to reconstruct the density mtrix of two-quit output sttes, while projecting the remining quit into its input stte (see the Methods section). Figure 7 shows the experimentlly reconstructed density mtrices representing the stte of control nd trget quit, t c Figure 7 Experimentlly reconstructed offoli output density mtrices., Mesured output sttes of quits C nd for offoli gte inputs;,(+), / 2; nd,(+), / 2. We oserve fidelities with the idel sttes, liner entropies nd tngles 39 of {.9±.4,.2±.8,.68±.} nd {.75±.6,.47±,.4±.6}, respectively., As for, ut where the roles of C nd hve een swpped. We now oserve {.8±.2,.39±.5,.53±.7} nd {.8±.3,.4±.5,.±.}. he decrese in tngle in the cses reflects the difference etween dependent nd independent photon interference, s discussed in the text. c, Idel density mtrices. Note, in ll cses only rel prts re shown; imginry prts re smll. Ech density mtrix requires 36 seprte mesurements 28 nd tkes pproximtely three dys to complete. NAURE PYSICS VOL 5 FEBRUARY

5 ARICLES NAURE PYSICS DOI:.38/NPYS c d Figure 8 Experimentlly reconstructed controlled-unitry gte process mtrices. d, u= nd θ=π/4 (C) (), θ=π/2 (CJ) (), θ=3π/4 (CL) (c) nd θ=π (CZ) (d). Rel nd imginry prts re shown. We oserve high process fidelities 27 with the idel {.982±.3,.977±.4,.94±.6,.956±.3} nd low verge output-stte liner entropies {.36±.4,.47±.4,.9±.5,.86±.6}, respectively. Mtrices re presented in the stndrd Puli sis 27. the output of our offoli gte. We chieve high fidelity 39 with the idel sttes nd high level of entnglement, s detiled in the figure cption. he results show tht the offoli crries out its most importnt nd experimentlly chllenging quntum opertions with high fidelity nd entnglement. o discuss sources of experimentl imperfection, we look t the detils of our liner optic implementtion. A key requirement for correct opertion of ech component two-quit gte is perfect reltive non-clssicl interference visiility (V r ) etween two photons. his in turn requires perfectly indistinguishle single photons. We mesure V r = ± % nd V r =92 ± 4% for the first nd second two-quit gtes shown in Fig. 5, respectively (where V r =V mes /V idel, V idel =8% nd results re for verticlly polrized photons). he difference cn e understood 38 NAURE PYSICS VOL 5 FEBRUARY 29

6 NAURE PYSICS DOI:.38/NPYS5 y considering tht the former opertes on dependent pir of photons generted from the sme pss of our opticl source, wheres the ltter uses independent photons from different psses (Fig. 5c). Photons generted from different psses re intrinsiclly more distinguishle 4,42. Another contriution to experimentl imperfection re the cses when more thn one pir of photons is creted simultneously in single pss of our opticl source. Although these higher-order terms occur with very low proility, nd do not significntly ffect the visiility mesurement due to higher-order interference processes, they cn introduce significnt error in the gte opertion 42. In generl, imperfections in the mesured offoli truth tle correspond to unwnted flips of the trget quit (Fig. 6). hese cn e understood with reference to the non-clssicl interferences required for correct opertion in ech cse. o etter illuminte these effects, we define stndrd contrst C (see the Methods section), which guges our gte s ility to pply the correct opertion to suset of logicl input sttes. For inputs,c =,, no non-clssicl interference is required for correct opertion nd we mesure C=.99±., verged over oth trget logicl input sttes. Inputs,C =, require perfect non-clssicl interference etween dependent photons C nd, for idel opertion. We chieve ner-perfect interference visiility etween verticl photons in this cse. owever, the full process suffers from the higher-order photon terms. his is reflected in n verge of C=.95±.2. Inputs,C =, require perfect non-clssicl interference etween independent photons nd, for idel opertion, reflected in n verge of C=.8±.2. Inputs,C =, require perfect non-clssicl interference etween oth dependent nd independent photons, nd re therefore the most chllenging cses. ere, we oserve n verge of C=.73±.5. It is strightforwrd to show tht the rtio of single to doule photon-pir emission is proportionl to the pump power. hus, reducing the power y fctor of four should reduce these unwnted higher-order contriutions from our source y fctor of four from ech pss. Under these conditions, we oserve fourfold rte t the output of the offoli gte of only mz nd repet mesurement of the verge contrst for the most chllenging logicl input,c =,, over period of five dys. We oserve cler improvement from C=.73±.5 to C=.83±.4. he effects of photon distinguishility nd higher-order terms lso cuse the imperfections in the stte tomogrphies of Fig. 7. For exmple, the entngling process required to chieve Fig. 7 relies on interference etween dependent photons. he process required to chieve Fig. 7 relies on oth dependent nd independent photon interference. his leds to the reduced fidelity oserved in the ltter cse. We conclude tht the dominnt source of experimentl error lies in our imperfect photon source. Our implementtion of the c u requires the genertion of two photons (Fig. 5). Even when running t /4 power, we oserve pproximtely z, which is sufficient to crry out full process tomogrphy 27 in 2 h. As demonstrtion, we report the implementtion of four distinct c u gtes tht pply z θ rottions (Fig. ) of π/4 (ct), π/2 (cj), 3π/4 (cl) nd π (cz) to the trget () conditionl on the control (C ), respectively. We fully chrcterize these gtes through quntum process tomogrphy 27 : Fig. 8 shows the experimentlly reconstructed process mtrices. We chieve exceptionlly high process fidelities, s detiled in the figure cption. We ttriute the smll devitions from idel opertion to residul higher-order emissions, imperfect mode mtching nd mnufctured optics 4,42. Outlook A cler impliction of our work is tht using multi-level quntum systems to encode informtion, rther thn enforcing two-level ARICLES structure, cn offer significnt prcticl dvntges for quntum logic. Although our demonstrtion enled new photonic quntum circuits, the resource-sving technique hs the potentil for ppliction in mny other rchitectures, ringing new circuits within rech of experimentl reliztion. An importnt pth for further reserch is to look for other prcticl simplifictions to quntum logic tht my e possile y enling simple steps outside the quit ilert spce. he overriding sources of error in our demonstrtions lie in our imperfect photon source: oth the effects of photon distinguishility nd the presence of unwnted higher-order emissions from prmetric downconversion. Current developments in source technology promise significnt improvements in the ner future. he comintion of this with recently developed photon-numer resolving detectors offers pths to deterministic nd sclle implementtions of our gtes. A key result is tht it is possile to overcome inherent non-determinism using only polynomil overhed in resources 2. Other importnt next steps re to use our circuits to explore smll-scle quntum lgorithms, generte new sttes nd test error-correction schemes. During the preprtion of this mnuscript, we ecme wre of demonstrtion of the offoli gte with trpped ions 43. Methods Source. Forwrd nd ckwrd photons pirs re produced through spontneous prmetric downconversion of frequency-douled mode-locked i:spphire lser (82 nm 4 nm, τ = 8 fs t 82 Mz repetition rte) doule pssed through type-i 2 mm BiB 3 O 6 crystl (Fig. 5). Photons re collected into four single-mode opticl fires nd detected using fire-coupled non-numer-resolving photon-counting modules. We spectrlly filter using unlocked interference filters centred t 82±.5 nm. Circuit. Photons re injected from single-mode opticl fires into free spce nd coupled into single-mode fires t the outputs (Fig. 5). One-quit gtes re relized deterministiclly using irefringent wve pltes. wo-quit gtes re relized non-deterministiclly using n estlished technique sed on non-clssicl interference t prtilly polrizing emsplitters in comintion with coincident mesurement Rther thn directly chining the two-quit gtes required for the offoli (Fig. 5), we use recently developed three-quit quntum logic gte 37,38. In liner optics implementtions of two-quit quntum gtes, stte-dependent loss is used to relnce mplitudes When incorporting loss elements L 3 (L), the offoli (c u) opertes with success proility of /72 (/8) (Fig. 5). Alterntively, to comt low count rtes, we chieve correct lnce y removing extr loss elements nd pre-ising the input polriztion sttes during gte chrcteriztion For the offoli, we use ll four outputs from spontneous prmetric downconversion fourfold coincident mesurement etween detectors D 4 signls successful run. We mesure fourfold coincidence rte of pproximtely mz when running t full pump lser power nd mz t /4 power. For the c u, we use only outputs C nd. In this cse, twofold coincident mesurement etween detectors D 2 signls successful run. We mesure twofold coincidence rte of pproximtely z when running t /4 pump lser power. Our imperfectly mnufctured emsplitters imprt systemtic unitry opertions on the opticl modes. For simplicity, we corrected for these effects numericlly. Alterntively, such unitries could e corrected with stndrd wve pltes. Qulity mesures nd sttistics. All error nlysis is crried out using Poissonin distriution to descrie the uncertinty in non-numer-resolving photon counting. Our stte nd process tomogrphy uses mximum likelihood estimtion to reconstruct physicl sttes nd Monte Crlo simultion for error nlysis 27,39,44. Mesurements sets re tken itertively, wherey multiple sets ech tking round h to complete re recorded. his reduces the effect of opticl source power fluctutions. he overlp etween two truth tles or inquisition (I) is defined s the verge logicl stte fidelity of truth tle I = r(m exp m idel )/d, where m exp nd m idel re the mesured nd idel truth tles, nd d is the tle dimension 39. he stndrd fidelity etween mixed (mesured) mtrix, ρ, nd the pure (idel) mtrix (either two sttes or two processes) is f= Ψ ρ Ψ ; liner entropy is sl d( r[ρ 2 ])/(d ), where d is the stte dimension 39. For the purposes of our error nlysis, we define the contrst C=/2{+(p idel p flip )/(p idel +p flip )}, where p idel is the proility of otining the idel output stte nd p flip is the proility of otining the output stte where the idel trget quit output stte hs een flipped. We clculte this property directly from the mesured truth tle. NAURE PYSICS VOL 5 FEBRUARY

7 ARICLES Received Ferury 28; ccepted 27 Octoer 28; pulished online 7 Decemer 28 References. Schmidt-Kler, F. et l. Reliztion of the Circ Zoller controlled-not quntum gte. Nture 422, 48 4 (23). 2. Leifried, D. et l. Experimentl demonstrtion of roust, high-fidelity geometric two ion-quit phse gte. Nture 422, (23). 3. O Brien, J. L., Pryde, G. J., White, A. G., Rlph,. C. & Brnning, D. Demonstrtion of n ll-opticl quntum controlled-not gte. Nture 426, (23). 4. Gsproni, S., Pn, J.-W., Wlther, P., Rudolph,. & Zeilinger, A. Reliztion of photonic controlled-not gte sufficient for quntum computtion. Phys. Rev. Lett. 93, 254 (24). 5. Pittmn,. B., Fitch, M. J., Jcos, B. C. & Frnson, J. D. Experimentl controlled-not logic gte for single photons in the coincidence sis. Phys. Rev. A 68, 3236 (23). 6. Bo, X.-. et l. Opticl nondestructive controlled-not gte without using entngled photons. Phys. Rev. Lett. 98, 752 (27). 7. Steffen, M. et l. Mesurement of the entnglement of two superconducting quits vi stte tomogrphy. Science 33, (26). 8. Plntenerg, J.., de Groot, P. C., rmns, C. J. P. M. & Mooij, J. E. Demonstrtion of controlled-not quntum gtes on pir of superconducting quntum its. Nture 447, (27). 9. Mndel, O. et l. Controlled collisions for multi-prticle entnglement of opticlly trpped toms. Nture 425, (23).. Anderlini, M. et l. Controlled exchnge interction etween pirs of neutrl toms in n opticl lttice. Nture 448, (27).. Rlph,. C., Resch, K. J. & Gilchrist, A. Efficient offoli gtes using qudits. Phys. Rev. A 75, 2233 (27). 2. Nielsen, M. A. & Chung, I. L. Quntum Computtion nd Quntum Informtion (Cmridge Univ. Press, 2). 3. Cory, D. G. et l. Experimentl quntum error correction. Phys. Rev. Lett. 8, (998). 4. Dennis, E. owrd fult-tolernt quntum computtion without conctention. Phys. Rev. A 63, 5234 (2). 5. Shi, Y. Both offoli nd controlled-not need little help to do universl quntum computtion. Quntum Inform. Comput. 3, (23). 6. Aspuru-Guzik, A., Dutoi, A. D., Love, P. J. & ed-gordon, M. Simulted quntum computtion of moleculr energies. Science 39, (25). 7. Shor, P. Proc. 35th Ann. Symp. Found. Comp. Sci (IEEE Comp. Soc. Press, 994). 8. Kwit, P., Mitchell, J. R., Schwindt, P. & White, A. Grover s serch lgorithm: An opticl pproch. J. Mod. Opt. 47, (2). 9. Schuck, C., uer, G., Kurtsiefer, C. & Weinfurter,. Complete deterministic liner optics Bell stte nlysis. Phys. Rev. Lett. 96, 95 (26). 2. Knill, E., Lflmme, R. & Milurn, G. J. A scheme for efficient quntum computtion with liner optics. Nture 49, (2). 2. Roos, C. F. et l. Control nd mesurement of three-quit entngled sttes. Science 34, (24). 22. Circ, J. I. & Zoller, P. Quntum computtions with cold trpped ions. Phys. Rev. Lett. 74, (995). 23. Cory, D. G., Price, M. D. & vel,. F. Nucler mgnetic resonnce spectroscopy: An experimentlly ccessile prdigm for quntum computing. Physic D 2, 82 (998). NAURE PYSICS DOI:.38/NPYS5 24. Brunstein, S. L. et l. Seprility of very noisy mixed sttes nd implictions for nmr quntum computing. Phys. Rev. Lett. 83, (999). 25. Menicucci, N. C. & Cves, C. M. Locl relistic model for the dynmics of ulk-ensemle nmr informtion processing. Phys. Rev. Lett. 88, 679 (22). 26. Jones, J. nmr quntum computtion: A criticl evlution. Fortschritte der Physik 48, (2). 27. O Brien, J. L. et l. Quntum process tomogrphy of controlled-not gte. Phys. Rev. Lett. 93, 852 (24). 28. Lngford, N. K. et l. Demonstrtion of simple entngling opticl gte nd its use in Bell-stte nlysis. Phys. Rev. Lett. 95, 254 (25). 29. Kiesel, N., Schmid, C., Weer, U., Ursin, R. & Weinfurter,. Liner optics controlled-phse gte mde simple. Phys. Rev. Lett. 95, 255 (25). 3. Okmoto, R., ofmnn,. F., keuchi, S. & Sski, K. Demonstrtion of n opticl quntum controlled-not gte without pth interference. Phys. Rev. Lett. 95, 256 (25). 3. O Brien, J. L. Opticl quntum computing. Science 38, (27). 32. Kok, P. et l. Liner opticl quntum computing with photonic quits. Rev. Mod. Phys. 79, (27). 33. Nielsen, M. A. Opticl quntum computtion using cluster sttes. Phys. Rev. Lett. 93, 453 (24). 34. Yorn, N. & Reznik, B. Deterministic liner optics quntum computtion with single photon quits. Phys. Rev. Lett. 9, 3793 (23). 35. Rlph,. C., yes, A. J. F. & Gilchrist, A. Loss-tolernt opticl quits. Phys. Rev. Lett. 95, 5 (25). 36. Browne, D. E. & Rudolph,. Resource-efficient liner opticl quntum computtion. Phys. Rev. Lett. 95, 5 (25). 37. Lnyon, B. P. et l. Experimentl demonstrtion of compiled version of Shor s lgorithm with quntum entnglement. Phys. Rev. Lett. 99, 2555 (27). 38. Rlph,. C. Scling of multiple postselected quntum gtes in optics. Phys. Rev. A 7, 232 (24). 39. White, A. G. et l. Mesuring two-quit gtes. J. Opt. Soc. Am. B 24, (27). 4. Vidl, G. Efficient clssicl simultion of slightly entngled quntum computtions. Phys. Rev. Lett. 9, 4792 (23). 4. Rrity, J., pster, P. & Loudon, R. Quntum Interferometry (VC, 996). 42. Weinhold,. J. et l. Understnding photonic quntum-logic gtes: the rod to fult tolernce. Preprint t < (28). 43. Monz,. et l. Reliztion of the quntum offoli gte with trpped ions. Preprint t < (28). 44. Jmes, D. F. V., Kwit, P. G., Munro, W. J. & White, A. G. Mesurement of quits. Phys. Rev. A 64, 5232 (2). Acknowledgements We cknowledge discussions with W. Munro nd D. Kielpinski, nd finncil support from the Austrlin Reserch Council Discovery nd Federtion Fellow progrmmes, the DES Endevour Europe nd Interntionl Linkge progrmmes, nd n IARPA-funded US Army Reserch Office Contrct. Additionl informtion Reprints nd permissions informtion is ville online t reprintsndpermissions. Correspondence nd requests for mterils should e ddressed to B.P.L. 4 NAURE PYSICS VOL 5 FEBRUARY 29

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

Fully Kinetic Simulations of Ion Beam Neutralization

Fully Kinetic Simulations of Ion Beam Neutralization Fully Kinetic Simultions of Ion Bem Neutrliztion Joseph Wng University of Southern Cliforni Hideyuki Usui Kyoto University E-mil: josephjw@usc.edu; usui@rish.kyoto-u.c.jp 1. Introduction Ion em emission/neutrliztion

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

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed

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

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

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION DOI: 0.08/NPHOTON.0.0 Experimentl Boson Smpling: Supplementry Informtion Mx Tillmnn,, Borivoje Dkić, René Heilmnn, Stefn Nolte, Alexnder Szmeit, nd Philip Wlther, Fculty of Physics, University of Vienn,

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Industrial Electrical Engineering and Automation

Industrial Electrical Engineering and Automation CODEN:LUTEDX/(TEIE-719)/1-7/(7) Industril Electricl Engineering nd Automtion Estimtion of the Zero Sequence oltge on the D- side of Dy Trnsformer y Using One oltge Trnsformer on the D-side Frncesco Sull

More information

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished

More information

1B40 Practical Skills

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

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

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

Chapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis

Chapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis Chpter 4: Techniques of Circuit Anlysis Terminology Node-Voltge Method Introduction Dependent Sources Specil Cses Mesh-Current Method Introduction Dependent Sources Specil Cses Comprison of Methods Source

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

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

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes

More information

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Spring 2018 Homework 7 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should

More information

De Broglie Wavelength of a Nonlocal Four-Photon

De Broglie Wavelength of a Nonlocal Four-Photon 1 De Broglie Wvelength of Nonlocl Four-Photon Philip Wlther*, Jin-Wei Pn, Mrkus Aspelmeyer *, Rupert Ursin *, Sr Gsproni* & Anton Zeilinger * * Institut für Experimentlphysik, Universität Wien, Boltzmnngsse

More information

Torsion in Groups of Integral Triangles

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

Preparation of decoherence-free cluster states with optical superlattices

Preparation of decoherence-free cluster states with optical superlattices PHYSICAL REVIEW A 79, 0309 009 Preprtion of decoherence-free cluster sttes with opticl superlttices Ling Jing, 1 An Mri Rey,,3 Oriol Romero-Isrt, 4 Jun José Grcí-Ripoll, 5 Ann Snper, 4,6 nd Mikhil D. Lukin

More information

Derivations for maximum likelihood estimation of particle size distribution using in situ video imaging

Derivations for maximum likelihood estimation of particle size distribution using in situ video imaging 2 TWMCC Texs-Wisconsin Modeling nd Control Consortium 1 Technicl report numer 27-1 Derivtions for mximum likelihood estimtion of prticle size distriution using in situ video imging Pul A. Lrsen nd Jmes

More information

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS Limited re ensemle forecsting in Norwy, using trgeted Mrit H. Jensen, Inger-Lise Frogner* nd Ole Vignes, Norwegin Meteorologicl Institute, (*held the presenttion) At the Norwegin Meteorologicl Institute

More information

CHAPTER 1 PROGRAM OF MATRICES

CHAPTER 1 PROGRAM OF MATRICES CHPTER PROGRM OF MTRICES -- INTRODUCTION definition of engineering is the science y which the properties of mtter nd sources of energy in nture re mde useful to mn. Thus n engineer will hve to study the

More information

Arbitrary superpositions of quantum operators by single-photon interference

Arbitrary superpositions of quantum operators by single-photon interference Bri, 29 settembre 2009 Società Itlin di Fisic XCV Congresso Nzionle Seoul Ntionl University Arbitrry superpositions of quntum opertors by single-photon interference Alessndro Zvtt CNR-INOA (Firenze) Vlentin

More information

a * a (2,1) 1,1 0,1 1,1 2,1 hkl 1,0 1,0 2,0 O 2,1 0,1 1,1 0,2 1,2 2,2

a * a (2,1) 1,1 0,1 1,1 2,1 hkl 1,0 1,0 2,0 O 2,1 0,1 1,1 0,2 1,2 2,2 18 34.3 The Reciprocl Lttice The inverse of the intersections of plne with the unit cell xes is used to find the Miller indices of the plne. The inverse of the d-spcing etween plnes ppers in expressions

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

Physics 201 Lab 3: Measurement of Earth s local gravitational field I Data Acquisition and Preliminary Analysis Dr. Timothy C. Black Summer I, 2018

Physics 201 Lab 3: Measurement of Earth s local gravitational field I Data Acquisition and Preliminary Analysis Dr. Timothy C. Black Summer I, 2018 Physics 201 Lb 3: Mesurement of Erth s locl grvittionl field I Dt Acquisition nd Preliminry Anlysis Dr. Timothy C. Blck Summer I, 2018 Theoreticl Discussion Grvity is one of the four known fundmentl forces.

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

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Reading from Young & Freedman: For this topic, read the introduction to chapter 24 and sections 24.1 to 24.5.

Reading from Young & Freedman: For this topic, read the introduction to chapter 24 and sections 24.1 to 24.5. PHY1 Electricity Topic 5 (Lectures 7 & 8) pcitors nd Dielectrics In this topic, we will cover: 1) pcitors nd pcitnce ) omintions of pcitors Series nd Prllel 3) The energy stored in cpcitor 4) Dielectrics

More information

Review of Gaussian Quadrature method

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

Fault Modeling. EE5375 ADD II Prof. MacDonald

Fault Modeling. EE5375 ADD II Prof. MacDonald Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology

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

SOUND INTENSITY PROBE CALIBRATOR FOR FIELD USE: CALCULATING THE SOUND FIELD IN THE CALIBRATOR USING BOUNDARY ELEMENT MODELLING

SOUND INTENSITY PROBE CALIBRATOR FOR FIELD USE: CALCULATING THE SOUND FIELD IN THE CALIBRATOR USING BOUNDARY ELEMENT MODELLING Pge 1 of 1 SOUND INTENSITY PROBE CALIBRATOR FOR FIELD USE: CALCULATING THE SOUND FIELD IN THE CALIBRATOR USING BOUNDARY ELEMENT MODELLING PACS REFERENCE: 43.58 Fm Ginn, Bernrd; Olsen,Erling; Cutnd,Vicente;

More information

Model Reduction of Finite State Machines by Contraction

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

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

On the application of explicit spatial filtering to the variables or fluxes of linear equations

On the application of explicit spatial filtering to the variables or fluxes of linear equations Journl of Computtionl Physics 225 (27) 2 27 www.elsevier.com/locte/jcp Short Note On the ppliction of explicit sptil filtering to the vriles or fluxes of liner equtions Christophe Bogey *, Christophe Billy

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

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

Linear Systems with Constant Coefficients

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

New data structures to reduce data size and search time

New data structures to reduce data size and search time New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

potentials A z, F z TE z Modes We use the e j z z =0 we can simply say that the x dependence of E y (1)

potentials A z, F z TE z Modes We use the e j z z =0 we can simply say that the x dependence of E y (1) 3e. Introduction Lecture 3e Rectngulr wveguide So fr in rectngulr coordintes we hve delt with plne wves propgting in simple nd inhomogeneous medi. The power density of plne wve extends over ll spce. Therefore

More information

8Similarity UNCORRECTED PAGE PROOFS. 8.1 Kick off with CAS 8.2 Similar objects 8.3 Linear scale factors. 8.4 Area and volume scale factors 8.

8Similarity UNCORRECTED PAGE PROOFS. 8.1 Kick off with CAS 8.2 Similar objects 8.3 Linear scale factors. 8.4 Area and volume scale factors 8. 8.1 Kick off with S 8. Similr ojects 8. Liner scle fctors 8Similrity 8. re nd volume scle fctors 8. Review U N O R R E TE D P G E PR O O FS 8.1 Kick off with S Plese refer to the Resources t in the Prelims

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

Special Relativity solved examples using an Electrical Analog Circuit

Special Relativity solved examples using an Electrical Analog Circuit 1-1-15 Specil Reltivity solved exmples using n Electricl Anlog Circuit Mourici Shchter mourici@gmil.com mourici@wll.co.il ISRAE, HOON 54-54855 Introduction In this pper, I develop simple nlog electricl

More information

Chapter 9 Definite Integrals

Chapter 9 Definite Integrals Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished

More information

The Influence of Interface and Semiconductor Bulk Traps Generated Under HEFS on MOSFET`s Electrical Characteristics

The Influence of Interface and Semiconductor Bulk Traps Generated Under HEFS on MOSFET`s Electrical Characteristics Proceedings of the 5th Smll Systems Simultion Symposium 2014, Niš, Seri, 12th-14th Ferury 2014 The Influence of Interfce nd Semiconductor Bulk Trps Generted Under HEFS on MOSFET`s Electricl Chrcteristics

More information

Bases for Vector Spaces

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

SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE

SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE RGMIA Reserch Report Collection, Vol., No., 998 http://sci.vut.edu.u/ rgmi SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE S.S. DRAGOMIR Astrct. Some clssicl nd new integrl inequlities of Grüss type re presented.

More information

Homework Assignment 3 Solution Set

Homework Assignment 3 Solution Set Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.

More information

Electrically Tunable g Factors in Quantum Dot Molecular Spin States

Electrically Tunable g Factors in Quantum Dot Molecular Spin States Electriclly Tunle g ctors in Quntum Dot Moleculr Spin Sttes M.. Doty,, * M. Scheiner, I. V. Ponomrev, E. A. Stinff, A. S. Brcker, V. L. Korenev, 2 T. L. Reinecke, nd D. Gmmon Nvl Reserch Lortory, Wshington,

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

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

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

8Similarity ONLINE PAGE PROOFS. 8.1 Kick off with CAS 8.2 Similar objects 8.3 Linear scale factors. 8.4 Area and volume scale factors 8.

8Similarity ONLINE PAGE PROOFS. 8.1 Kick off with CAS 8.2 Similar objects 8.3 Linear scale factors. 8.4 Area and volume scale factors 8. 8.1 Kick off with S 8. Similr ojects 8. Liner scle fctors 8Similrity 8.4 re nd volume scle fctors 8. Review Plese refer to the Resources t in the Prelims section of your eookplus for comprehensive step-y-step

More information

ORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD

ORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD Author Nme et. l. / Interntionl Journl of New Technologies in Science nd Engineering Vol., Issue., 7, ISSN 9-78 ORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD A Chinn Nidu* G Dileep**

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Lecture 08: Feb. 08, 2019

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

More information

Quantum physics has come a long way

Quantum physics has come a long way www.nture.com/nture Vol 453 Issue no. 7198 19 June 28 QUANTUM COHERENCE Cover illustrtion The entngling of toms through spin coupling in doule-well potentil (Courtesy of I. Bloch) Editor, Nture Philip

More information

(See Notes on Spontaneous Emission)

(See Notes on Spontaneous Emission) ECE 240 for Cvity from ECE 240 (See Notes on ) Quntum Rdition in ECE 240 Lsers - Fll 2017 Lecture 11 1 Free Spce ECE 240 for Cvity from Quntum Rdition in The electromgnetic mode density in free spce is

More information

OVER-DETERMINATION IN ACOUSTIC TWO-PORT DATA MEASUREMENT

OVER-DETERMINATION IN ACOUSTIC TWO-PORT DATA MEASUREMENT OVER-DEERMINAION IN ACOUSIC WO-POR DAA MEASUREMEN Sry Allm, Hns Bodén nd Mts Åom he Mrcus Wllenerg Lortory for Sound nd Virtion Reserch Dept. of Aeronuticl nd Vehicle Engineering, KH, SE-0044 Stockholm,

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

CSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science

CSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny

More information

Lecture 09: Myhill-Nerode Theorem

Lecture 09: Myhill-Nerode Theorem CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives

More information

EECS 141 Due 04/19/02, 5pm, in 558 Cory

EECS 141 Due 04/19/02, 5pm, in 558 Cory UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework

More information

Quantum Non-demolition Detection of Single Microwave Photons in a Circuit

Quantum Non-demolition Detection of Single Microwave Photons in a Circuit Quntum Non-demolition Detection of Single Microwve Photons in Circuit B. R. Johnson, 1 M. D. Reed, 1 A. A. Houck, 2 D. I. Schuster, 1 Lev S. Bishop, 1 E. Ginossr, 1 J. M. Gmett, 3 L. DiCrlo, 1 L. Frunzio,

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

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

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

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

Resistive Network Analysis

Resistive Network Analysis C H A P T E R 3 Resistive Network Anlysis his chpter will illustrte the fundmentl techniques for the nlysis of resistive circuits. The methods introduced re sed on the circuit lws presented in Chpter 2:

More information

Flexible Beam. Objectives

Flexible Beam. Objectives Flexile Bem Ojectives The ojective of this l is to lern out the chllenges posed y resonnces in feedck systems. An intuitive understnding will e gined through the mnul control of flexile em resemling lrge

More information

Measurement-Only Topological Quantum Computation

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

More information

Designing Information Devices and Systems I Discussion 8B

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

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

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

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

Week 10: Line Integrals

Week 10: Line Integrals Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.

More information

Surface maps into free groups

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

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.

Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So. 5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth

More information

Characterization of Impact Test Response of PCCP with System Identification Approaches

Characterization of Impact Test Response of PCCP with System Identification Approaches 7th World Conference on Nondestructive Testing, 25-28 Oct 2008, Shnghi, Chin Chrcteriztion of Impct Test Response of PCCP with System Identifiction Approches Astrct Zheng LIU, Alex WANG, nd Dennis KRYS

More information

Electron Correlation Methods

Electron Correlation Methods Electron Correltion Methods HF method: electron-electron interction is replced by n verge interction E HF c E 0 E HF E 0 exct ground stte energy E HF HF energy for given bsis set HF Ec 0 - represents mesure

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

221A Lecture Notes WKB Method

221A Lecture Notes WKB Method A Lecture Notes WKB Method Hmilton Jcobi Eqution We strt from the Schrödinger eqution for single prticle in potentil i h t ψ x, t = [ ] h m + V x ψ x, t. We cn rewrite this eqution by using ψ x, t = e

More information

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus 7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e

More information

Probabilistic Investigation of Sensitivities of Advanced Test- Analysis Model Correlation Methods

Probabilistic Investigation of Sensitivities of Advanced Test- Analysis Model Correlation Methods Probbilistic Investigtion of Sensitivities of Advnced Test- Anlysis Model Correltion Methods Liz Bergmn, Mtthew S. Allen, nd Dniel C. Kmmer Dept. of Engineering Physics University of Wisconsin-Mdison Rndll

More information

Synoptic Meteorology I: Finite Differences September Partial Derivatives (or, Why Do We Care About Finite Differences?

Synoptic Meteorology I: Finite Differences September Partial Derivatives (or, Why Do We Care About Finite Differences? Synoptic Meteorology I: Finite Differences 16-18 September 2014 Prtil Derivtives (or, Why Do We Cre About Finite Differences?) With the exception of the idel gs lw, the equtions tht govern the evolution

More information

CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University

CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted

More information

Using Pisarenko Harmonic Decomposition for the design of 2-D IIR Notch filters

Using Pisarenko Harmonic Decomposition for the design of 2-D IIR Notch filters WSEAS RANSACIONS on SIGNAL PROCESSING Using Prenko Hrmonic Decomposition for the design of -D IIR Notch filters Astrct In th pper, the Prenko Hrmonic Decomposition used for the design of -D (wo- Dimensionl

More information

arxiv:hep-ex/ v1 12 Sep 1998

arxiv:hep-ex/ v1 12 Sep 1998 Evidence of the φ ηπ γ decy rxiv:hep-ex/9891v1 12 Sep 1998 Astrct M.N.Achsov, V.M.Aulchenko, S.E.Bru, A.V.Berdyugin, A.V.Bozhenok, A.D.Bukin, D.A.Bukin, S.V.Burdin, T.V.Dimov, S.I.Dolinski, V.P.Druzhinin,

More information

Matching patterns of line segments by eigenvector decomposition

Matching patterns of line segments by eigenvector decomposition Title Mtching ptterns of line segments y eigenvector decomposition Author(s) Chn, BHB; Hung, YS Cittion The 5th IEEE Southwest Symposium on Imge Anlysis nd Interprettion Proceedings, Snte Fe, NM., 7-9

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thoms Whithm Sith Form Pure Mthemtics Unit C Alger Trigonometry Geometry Clculus Vectors Trigonometry Compound ngle formule sin sin cos cos Pge A B sin Acos B cos Asin B A B sin Acos B cos Asin B A B cos

More information

INTRODUCTION. The three general approaches to the solution of kinetics problems are:

INTRODUCTION. The three general approaches to the solution of kinetics problems are: INTRODUCTION According to Newton s lw, prticle will ccelerte when it is subjected to unblnced forces. Kinetics is the study of the reltions between unblnced forces nd the resulting chnges in motion. The

More information