{"id":927,"date":"2011-06-10T14:51:47","date_gmt":"2011-06-10T18:51:47","guid":{"rendered":"http:\/\/michaelnielsen.org\/blog\/?p=927"},"modified":"2011-10-02T13:23:30","modified_gmt":"2011-10-02T17:23:30","slug":"quantum-computing-for-the-determined","status":"publish","type":"post","link":"https:\/\/michaelnielsen.org\/blog\/quantum-computing-for-the-determined\/","title":{"rendered":"Quantum computing for the determined"},"content":{"rendered":"<p>I&#8217;ve posted to YouTube a series of 22 short videos giving an introduction to quantum computing.  Here&#8217;s the first video:<\/p>\n<p><iframe loading=\"lazy\" width=\"480\" height=\"292\" src=\"http:\/\/www.youtube.com\/embed\/X2q1PuI2RFI\" frameborder=\"0\" allowfullscreen><\/iframe><\/p>\n<p>Below I list the remaining 21 videos, which cover subjects including the basic model of quantum computing, entanglement, superdense coding, and quantum teleportation.<\/p>\n<p>To work through the videos you need to be comfortable with basic linear algebra, and with assimilating new mathematical terminology. If you&#8217;re not, working through the videos will be arduous at best! Apart from that background, the main prerequisite is determination, and the willingness to work more than once over material you don&#8217;t fully understand.<\/p>\n<p>In particular, you don&#8217;t need a background in quantum mechanics to follow the videos. <\/p>\n<p>The videos are short, from 5-15 minutes, and each video focuses on explaining one main concept from quantum mechanics or quantum computing.  In taking this approach I was inspired by the excellent <a href=\"http:\/\/www.khanacademy.org\/\">Khan Academy<\/a>.<\/p>\n<p>The course is not complete &#8212; I originally planned about 8 more videos.  The extra videos would complete my summary of basic quantum mechanics (+2 videos), and cover reversible computing (+2 videos), and Grover&#8217;s quantum search algorithm (+4 videos).  Unfortunately, work responsibilities that couldn&#8217;t be put aside meant I had to put the remaining videos on hold.  If lots of people work through the existing videos and are keen for more, then I&#8217;ll find time to finish them off.  As it is, I hope the incomplete series is still useful.<\/p>\n<p>One minor gotcha: originally, I was hoping to integrate the videos with a set of exercises.  Again, time prevented me from doing this: there are no exercises.  But as a remnant of this plan, in at least one video (video 7, the video on unitary matrices preserving length, and possibly elsewhere) I leave something &#8220;to the exercises&#8221;.  Hopefully it&#8217;s pretty clear what needs to be filled in at this point, and viewers can supply the missing details.<\/p>\n<p>Let me finish with two comments on approach.  First, the videos treat quantum bits &#8212; qubits &#8212; as abstract mathematical entities, in a way similar to how we can think of conventional (classical) bits as 0 or 1, not as voltages in a circuit, or magnetic domains on a hard disk.  I <em>don&#8217;t<\/em> get into the details of physical implementation at all. This approach bugs some people a lot, and others not at all.  If you think it&#8217;ll bug you, these videos aren&#8217;t for you.<\/p>\n<p>Second, the videos focus on the nuts-and-bolts of how things work.  If you want a high-level overview of quantum computing, why it&#8217;s interesting, and what quantum computers may be capable of, there are many available online, a Google search away.  Here&#8217;s a <a href=\"http:\/\/www.cs.virginia.edu\/~robins\/The_Limits_of_Quantum_Computers.pdf\">nice one<\/a>, from Scott Aaronson.  You may also enjoy David Deutsch&#8217;s <a href=\"http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.41.2382&#038;rep=rep1&#038;type=pdf\">original paper<\/a> about quantum computing.  It&#8217;s a bit harder to read than an article in Wired or Scientific American, but it&#8217;s worth the effort, for the paper gives a lot of insight into some of the fundamental reasons for thinking about quantum computing in the first place.  Such higher-level articles may be helpful to read in conjunction with the videos.<\/p>\n<p>Here&#8217;s the full list of videos, including the first one above.  Note that because this really does get into the nuts and bolts of how things work, it also builds cumulatively.  You can&#8217;t just skip straight to the quantum teleportation video and hope to understand it, you&#8217;ll need to work through the earlier videos, unless you already understand their content.<\/p>\n<h3>The basics<\/h3>\n<ul>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=X2q1PuI2RFI\">The qubit<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=Jo-RZ27o3Uw\">Tips for working with qubits<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=JDDSjsQLv80\">Our first quantum gate: the quantum NOT gate<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=x6gOp_o7Bi8\">The Hadamard gate<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=SMbh0GgCN7I\">Measuring a qubit<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=SWKuH9emuag\">General single-qubit gates<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=foNuXVzOtW0\">Why unitaries are the only matrices which preserve length<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=pYfVRyBHnCA\">Examples of single-qubit quantum gates<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=rLF-oHaXLtE\">The controlled-NOT gate<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=F2okky5vD8k\">Universal quantum computation<\/a>\n<\/ul>\n<h3>Superdense coding<\/h3>\n<ul>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=w5rCn593Dig\">Superdense coding: how to send two bits using one qubit<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=O2pYwsLMXo4\">Preparing the Bell state<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=aRglXdLI7KY\">What&#8217;s so special about entangled states anyway?<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=gT0xj5lSFkY\">Distinguishing quantum states<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=uC7J5JbiJaE\">Superdense coding redux: putting it all together<\/a>\n<\/ul>\n<h3>Quantum teleportation<\/h3>\n<ul>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=MG_9JWsrKtM\">Partial measurements<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=fU6M8EA2JRs\">Partial measurements in an arbitrary basis<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=3wZ35c3oYUE\">Quantum teleportation<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=Yfk7J1kBegw\">Quantum teleportation: discussion<\/a>\n<\/ul>\n<h3>The postulates of quantum mechanics (TBC)<\/h3>\n<ul>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=Zf_CyFwKbPQ\">The postulates of quantum mechanics I: states and state space<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=NZqRUH1uSlE\">The postulates of quantum mechanics II: dynamics<\/a>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=Amk46VKgaeg\">The postulates of quantum mechanics III: measurement<\/a>\n<\/ul>\n<p><em>Thanks to <a href=\"http:\/\/jendodd.com\/\">Jen Dodd<\/a>, <a href=\"http:\/\/www.igvita.com\/\">Ilya Grigorik<\/a> and <a href=\"http:\/\/www.hassanmasum.com\/\">Hassan Masum<\/a> for feedback on the videos, and for many enjoyable discussions about open education.<\/em><\/p>\n<p><em>If you enjoyed these videos, you may be interested in my forthcoming book, <a href=\"http:\/\/www.amazon.com\/Reinventing-Discovery-New-Networked-Science\/dp\/product-description\/0691148902\">Reinventing Discovery<\/a>, where I describe how online tools and open science are transforming the way scientific discoveries are made.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>I&#8217;ve posted to YouTube a series of 22 short videos giving an introduction to quantum computing. Here&#8217;s the first video: Below I list the remaining 21 videos, which cover subjects including the basic model of quantum computing, entanglement, superdense coding, and quantum teleportation. To work through the videos you need to be comfortable with basic&hellip; <a class=\"more-link\" href=\"https:\/\/michaelnielsen.org\/blog\/quantum-computing-for-the-determined\/\">Continue reading <span class=\"screen-reader-text\">Quantum computing for the determined<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-927","post","type-post","status-publish","format-standard","hentry","category-uncategorized","entry"],"_links":{"self":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/927","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/comments?post=927"}],"version-history":[{"count":16,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/927\/revisions"}],"predecessor-version":[{"id":978,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/posts\/927\/revisions\/978"}],"wp:attachment":[{"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/media?parent=927"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/categories?post=927"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/michaelnielsen.org\/blog\/wp-json\/wp\/v2\/tags?post=927"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}