{"id":1188,"date":"2006-02-12T17:51:33","date_gmt":"2006-02-13T00:51:33","guid":{"rendered":"http:\/\/dabacon.org\/pontiff\/?p=1188"},"modified":"2006-02-12T17:51:33","modified_gmt":"2006-02-13T00:51:33","slug":"cse-599d-lecture-notes-161718-and-19","status":"publish","type":"post","link":"https:\/\/dabacon.org\/pontiff\/2006\/02\/12\/cse-599d-lecture-notes-161718-and-19\/","title":{"rendered":"CSE 599d Lecture Notes 16,17,18, and 19"},"content":{"rendered":"

The latest additions will probably have lots of errors (well even more than my normal notes!) as I haven’t taught from these notes yet and I always find errors when I teach. (Plus they are on error correction!) But this completes this set of notes for this quarter. I’ll probably give these notes a good reading over sometime in the next month to correct all of the silly (and substantial) errors in the notes. I think I covered just about what I thought I would cover. We won’t get to quantum cryptography, but really to do this I’d need to spend some lectures on purification protocols and discuss some basic information theory to get at the Preskill-Shor proof of security. Unfortunately if I’m going to do this I probably would have to do it over a two quarter quantum computing course (for such a course I would add results on quantum communication complexity, and a lot of the basics of quantum information theory…certainly there is not a lack of subject to spend two quarters on!)
\nActually the next class I really want to teach is a class on the representation theory of finite and Lie groups and quantum information science. Maybe next year (next quarter I teach “Introduction to Digital Design” No, not quantum digital design ;))
\nLecture Notes
\nLecture Notes 1: Introduction and Basics of Quantum Theory<\/a>
\nLecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing<\/a>
\nLecture Notes 3: One Qubit, Two Qubit<\/a>
\nLecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding<\/a>
\nLecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation<\/a>
\nLecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm<\/a>
\nLecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm<\/a>
\nLecture Notes 8: Simon’s Algorithm<\/a>
\nLecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm<\/a>
\nLecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms<\/a>
\nLecture Notes 11: Shor’s Algorithm<\/a>
\nLecture Notes 12: Grover’s Algorithm<\/a>
\nLecture Notes 13: Mixed States and Open Quantum Systems<\/a>
\nLecture Notes 14: Quantum Entanglement and Bell’s Theorem<\/a>
\nLecture Notes 15: When Quantum Computers Fall Apart<\/a>
\nLecture Notes 16: Introduction to Quantum Error Correction<\/a>
\nLecture Notes 17: The Quantum Error Correcting Criteria<\/a>
\nLecture Notes 18: Stabilizer Quantum Error Correcting Codes<\/a>
\nLecture Notes 19: Fault-Tolerant Quantum Computation and the Threshold Theorem<\/a>
\nHomework
\nHomework 1<\/a>
\nHomework 2<\/a>
\nHomework 3<\/a>
\nHandouts
\nSyllabus<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

The latest additions will probably have lots of errors (well even more than my normal notes!) as I haven’t taught from these notes yet and I always find errors when I teach. (Plus they are on error correction!) But this completes this set of notes for this quarter. I’ll probably give these notes a good … <\/p>\n

Continue reading “CSE 599d Lecture Notes 16,17,18, and 19”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[20,63,83],"tags":[],"class_list":["post-1188","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-quantum","category-teaching"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1188","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/comments?post=1188"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/1188\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=1188"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=1188"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=1188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}