Scribd
Upload
27 views79 pages

Quantum Computing For Computer Scientists

Each year Microsoft Research hosts hundreds of influential speakers from around the world including leading scientists, renowned experts in technology, book authors, and leading academics, and makes videos of these lectures freely available. 2016 © MicrosoftCorporation. All rights reserved.

Uploaded by

morphos2
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
27 views79 pages

Quantum Computing For Computer Scientists

Each year Microsoft Research hosts hundreds of influential speakers from around the world including leading scientists, renowned experts in technology, book authors, and leading academics, and makes videos of these lectures freely available. 2016 © MicrosoftCorporation. All rights reserved.

Uploaded by

morphos2
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
Microsoft Research Each year Microsoft Research hosts hundreds of influential speakers from around the world including leading scientists, renowned experts in technology, book authors, and leading academics, and makes videos of these lectures freely available. 2016 © Microsoft Corporation. Alll rights reserved. Quantum Computing for Computer Scientists Metal oR el Meal calor Why learn quantum computing? Quantum supremacy expected this year Microsoft, Google, Intel, IBM all investing in quantum computer development Revere Revel eRe fae eure cea oa) Efficiently factor large composite numbers, breaking RSA encryption (Shor's algorithm, 1994) Bleue au kel NCR Ci eos) Believed exponential speedup in simulating quantum mechanical systems intellectually interesting — quantum mechanics is outside your intuition! Get a small glimpse of what you don't know you don't know Learning objectives [Soren ne Rec ie oun ered serge) ecole tea tel eo) bits, superposition, and quantum logic gates The simplest problem where a quantum computer beats a classical computer Pea eee MMe ua Rah ares) Representing classical bits as a vector ‘One bit with the value 0, also written as |0) (Dirac vector notation) () One bit with the value 1, also written as |1) () Review: matrix multiplication Gi Dy x) _ (ax + by c d/\y)~ \cx +dy, CWE NN oe Dae. AOR ieee? Ue ACM a re a ree) Pat isthe) = as re neces sess =< Operations on one classical bit (cbit) wonty =x TI 6 NG=G) GC DG)-) Seema SCO) COL) erst 7-8 ee, Teale) te adele alae See) 0) COE) Reversible computing Reversible means given the operation and output value, you can find the input value Poe ee eu Pree Ta ed Cee en Ng ata Me ACN ern eel elo eee RD ea mege Nee Cien Recs Constant-0 and Constant-1 are not reversible Quantum computers use only reversible operations, so we will only care about those In fact, all quantum operators are their own inverses Operations on one classical bit (cbit) wonty =x TI 6 NG=G) GC DG)-) Seema SCO) COL) erst 7-8 ee, Teale) te adele alae See) 0) COE) Reversible computing Reversible means given the operation and output value, you can find the input value Poe ee eu Pree Ta ed Cee en Ng ata Me ACN ern eel elo eee RD ea mege Nee Cien Recs Constant-0 and Constant-1 are not reversible Quantum computers use only reversible operations, so we will only care about those In fact, all quantum operators are their own inverses Operations on one classical bit (cbit) wonty =x TI 6 NG=G) GC DG)-) Seema SCO) COL) erst 7-8 ee, Teale) te adele alae See) 0) COE) Reversible computing Reversible means given the operation and output value, you can find the input value For Ax = b, given b and A, you can uniquely find x Cee en Neg ata Me RCN ean See tel eee RD ee mege NC eCienR Ceca Constant-0 and Constant-1 are not reversible Quantum computers use only reversible operations, so we will only care about those In fact, all quantum operators are their own inverses Review: tensor product of vectors Representing multiple cbits SCORE meen | TU COnH mma On exer caer Mekal ema ee eo Nee a mel ea eee aOR Me Meee oy The product state of n bits is a vector of size 2" |4) = [100) a0 (Je 6) 7 Operations on multiple cbits: CNOT Operates on pairs of bits, one of which is the “control” bit and the other the “target” bit If the control bit is 1, then the target bit is flipped If the control bit is 0, then the target bit is unchanged The control bit is always unchanged With most-significant bit as control and least-significapt bit as target, action is as follows: et) Coe 10 0 0 c-(9 100 10 10 net ae ess Cnr aD Operations on multiple cbits: CNOT Operations on multiple cbits: CNOT Recap PCT Tt elke ersicte Nol TRC ro loaerd eNom Koo MCD ola Cero e one Reiley are eu eel een Racer Quantum computers only use reversible operations Multi-bit states are written as the tensor product of single-bit vectors The CNOT gate is a fundamental building block of reversible computing Qbits and superposition Surprise! We've actually been using qbils all along! The chit vectors we've been using are just special cases of qbit vectors ee Teal A Merten P aerosmith ea alee The cbit vectors (8) and (8) fit within this definition Dees Re et ee aeRO emo Example abit values: Fa vata) Sr ey Qbits and superposition Tr aseliRe Ke sR Mek Re CR = EO Rm eee Cs User Superposition means the qbit is both 0 and 1 and the same time PNRM CHUM gteMe|sTIA Reto eee eke aketal ol Nel UC Re Nora We usually do this at the end of a quantum computation to get the result Fiteke sao lUCN 9 Mn Wn Reel olsen MRM Ns ossl =a oUt MCU gn cos] Na alge Cu ae @) rere fe eee eos) $9Q.0r1 [coin fp} The abit (3) has a 100% chance of collapsing to 0, and (°) has a 100% chance of collapsing to 1 Qbits and superposition ac I eRe ECE eat cent Naa aes erie ON et (x) bd NS tea [rl ia eo e Geel eee eee) A F eee mA ey Cy ia Sa Si 3, Sere Re tee keke cae Rea NO APO ea eT) Operations on qbits ER ORR eel Reais A Ror Re A Re sce el elas ace ae Ree Ree RRR oN Cet Mae Rel Rea Intuition: the difference within the categories (negation) was neutralized, while the Ce eeaacd eam Reel erat ea eNO Mr naires) This problem seems pretty contrived (and it was, when it was published) A generalized version with an mbit black box ako exists (Deutsch-Josza problem) Determine whether the function returns the same valve for all 2" inputs (i.e. is constant) ere Rm ee eae ee her euN ie Roan sen cuaea ce ota The Deutsch oracle: constant-0 1) iY) p Con ot fee cg Output i) ett Le Output iy The Deutsch oracle: constant-1 1} ie) p Con hee cg Output ry ett La Output Ea ty The Deutsch oracle: identity i} by erty Lae etE i) ett La Output Input The Deutsch oracle eRe RMA Me ela Riel Aa ACN eon Reena Rem eel Mae Rael Rea Intuition: the difference withinthe categories (negation) was neutralized, while the difference between the categories (CNOT) was magnified This problem seems pretty contrived (and it was, when it was published) A generalized version with an mbit black box ako exists (Deutsch-Josza problem) Determine whether the function returns the same valve for all 2" inputs (i.e. is constant) A variant of the generalized version was an inspiration for Shor's algorithm! Full recap We learned how to model classical computation with basic linear algebra We leamed about qbits, superposition, and the Hadamard gate Prey ros RPC so gh oecel Stole ac Me ela Re lo ele teoel Bonus topics Quantum entanglement Quantum teleportation Entanglement If the product state of two qbits cannot be factored, they are said to be entangled Rg i ne i) 0 Pa it ne Me uo ee on aie Rol aR Neto oar Reet This has a 50% chance of collapsing to |00) and 50% chance of collapsing to |11) Entanglement How can we reach an entangled state? Easy! 0 10) ic fe as apa Ss @ aa S 1 5 — = arals C es _— Fe) lta Sl ied Entanglement If the product state of two qbits cannot be factored, they are said to be entangled Rg i ne i) 0 Pa it ne Me uo ee on aie Rol aR Neto oar Reet This has a 50% chance of collapsing to |00) and 50% chance of collapsing to |11) Entanglement oe aR Are eta ye teks cae OR 10) ic fe os oypas S @ Et LS T 5 —_ = lets C) es _— Te) feted ied Entanglement NSN con Regge Me ee Reree inet R Ong Measuring one abit also collapses the other in a correlated state Sn Reet Ts oI TS seu as oe RO Ce eto The coordination even happens faster than the speed of light! Itis instantaneous. ee tee ge nee eae eeu a Surely the qbits “decided” at the time of entanglement what they would do? IIR ial ax oro]l te Mualolo UR oles Malas Ree Ra eRe ecole means This does indeed break locally through faster-than-light coordination However — and this is the critical part — no information can be communicated Teleportation Cee Rs ER AM creed oy UAT Re RS Ree eee Me| ACR ons) Protease Cunt cd Mammut ec a5 You can transfer qbit states (cut & paste) but you cannot clone them (copy & paste) Ne Reels eee E re ee eae uA en enue em ec Rel ec an ua n oe a Teleportation ll ic a oe a Fle Further learning goals Deutsch-Jozsa algorithm and Simon's periodicity problem Former yields oracle separation between EQP and P, latter between BQP and BPP Shor's algorithm and Grover's algorithm feet Uae altel ih Roe eC ee Meee Mes Rate ReeR reel aia lua i) Cee eRe reo eer al eeKenuaeM ureter kee Entanglement TaN oieXe oti Col Memos eRe eae re ool Me eR NLT} i ne 0 0) Pa a Ne ea Ue Roe ee on aie Rol aR Neto Meare Re eae This has a 50% chance of collapsing to |00) and 50% chance of collapsing to |11) Further learning goals Deutsch-Jozsa algorithm and Simon's periodicity problem Former yields oracle separation between EQP and P, latter between BQP and BPP Shor's algorithm and Grover's algorithm Cer Uae ote Reo eC Pee Meee Mes Rec U nero aia i) eer eRe reo feel eee M eure ere Ree Further reading Trott so tletotal he Mea een Tale Meee) ee er a Others have recommended Quantum Computing: A Gentle introduction Pome N mural ete ene Nene mel ee Wes rely Bea Metered Re ela NPN oem Rs (oreo toa oe Una) Re esc eRe ee Ce cle Ser a ue el Some SOR yeaa ST gap eer acto liol Reel Mia cca Te Le ag Ne Nae te eu ol A ed Appendices ieee Rese teu a el ee? Quantum teleportation math 99 DevachOhce Misco ial So © & [ovis in Pee o-olg-oue ing =| Amery =) Sant =| BT i R Teen Tote Aahee‘Wdow Heo Pahoa > GH-|o-s60@ ean Decode (pet > S ropetes toy I > Sapte € 1 tae operation tetlachtoxConstant Saka bse) © (Q)) = (Boat) sueesie Snputterie = 202; D Oninneeas sng ebtes = bi23) ‘ Cheerinput, utp) Niue): Ere tsetoxtinge, out) B S/O moepeiene x |+ v oa x o@ hai * ees oma Hore + Devices Community Git Andeov Helier New experiment New Sve] [sens 2] switch oasm ear Backend: an r New experiment S] Switch o asm tor amy ay Quantum Scores Experiment #20180214115601 7] sich too wy Quantum Scores Refresh BSD wmaepeiene x | a o@ Quantum Scores (1 scores) elec Remove Al experiment 420100234125¢01 nassiocon ESD Executions BSD aepeione x | iS o@ quomemeperenceng beret Quantum Scores (1 scores) Retesh Remove Al Executions BSD aerpetence x [toy Confirm your execution (shots: 1024) Result from "ache New Execution Scetbsang sul nits a8) un a New Execution (3 Units) BSD wmaepeiene x | v a © @ |B os iqummepeinceng beri Experiment #20180214115601 Quantum State: Computation Basis Quantum Circuit OPENQASM 2.0

You might also like