Washington Education Roundup

And now for something a little different 🙂 Yeah I’m growing tired of complaining about fault-tolerant haters too 😉
This article in the New York Times highlights concerns about math education here in the great state of Washington. Money quote:

In part, the math wars have grown out of a struggle between professional mathematicians, who say too many American students never master basic math skills, and math educators, who say children who construct their own problem-solving strategies retain their math skills better than those who just memorize the algorithm that produces the correct answer.

Which of course is silly. Mastery of basic math skills AND construction of their own problem-solving strategies is important for math education. It’s not an OR sort of game. Sadly I think “construction of their own problem-solving strategies” is a proxy for “water down the curriculum” while at the same time “mastery of basic math skills” is proxy for “only accepting answers done by the accepted algorithm.” Both are anoying as heck.
In related news, extremely long time readers of this blog are familiar with the WIT: the Washington Institute of Technology. WIT is my dream university which I’m planning on founding once I find the necessary billions of dollars to get it started. Well I’d better hurry up because the beginnings of a movement to build a polytechnic here in Washington: Seattle Times article here.

Quantum Computing Undergrad Labs

One of the cool talks at the northwest APS meeting I attend a little over a week ago was a talk by Mark Beck from Whitman college on implementing Hardy’s test of local realism in an undergraduate lab. I sure wish I’d had this lab when I was an undergraduate (as it is I most remember a lab in which we made a high temperature superconductor…mostly due, unfortunately, to the ungodly amount of time we spent trying to get the stuff to superconduct!) There aren’t many labs where you can get your hands on an experiment related to quantum informatino information processing, are there. In fact the only other one I know of is in the Junior lab at MIT where they do an NMR quantum computing experiment. Anyone know of any other undergraduate labs which are relevant to quantum computing?

A Puzzling Class Obmission

I was an undergraduate at Caltech, which is located in southern California in the city of Pasadena. This meant that when I went home for the holidays, I would have to drive ten hours north to my home in Yreka, California (by the way, the San Francisco bay area is NOT Northern California!) Along the way I would often stop to pick up my friend Luis who was going to school in Berkeley. Even from Berkeley the drive to Yreka is about five hours. So what would we do during this long drive? Puzzles. Riddles. Brain teasers. Five hours of brain busting fun! And on the way back: five more hours of brain busting fun! Which got me thinking the other day: why aren’t there classes in puzzles and games? I mean I have no doubt that doing these teasers, even at my advanced age, is good for my brain. Actually, come to think of it, especially at my advanced age! It seems kind of strange to me that such an important tool for keeping your brain sharp is so completely (at least as far as I’ve seen) ignored by higher education. I’m not sure what can be done about this puzzling obmission from education, but certainly it would be excellent to teach a class in puzzles, brain teasers, and games. Plus there is the added benefit that it might increase your chances of getting hired at a hedge fund 😉

CSE 599d Lecture Notes 16,17,18, and 19

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!)
Actually 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 ;))
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Lecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm
Lecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms
Lecture Notes 11: Shor’s Algorithm
Lecture Notes 12: Grover’s Algorithm
Lecture Notes 13: Mixed States and Open Quantum Systems
Lecture Notes 14: Quantum Entanglement and Bell’s Theorem
Lecture Notes 15: When Quantum Computers Fall Apart
Lecture Notes 16: Introduction to Quantum Error Correction
Lecture Notes 17: The Quantum Error Correcting Criteria
Lecture Notes 18: Stabilizer Quantum Error Correcting Codes
Lecture Notes 19: Fault-Tolerant Quantum Computation and the Threshold Theorem
Homework
Homework 1
Homework 2
Homework 3
Handouts
Syllabus

CSE 599d Lecture Notes 13,14 and 15

Hindsight I taught things a bit out of order. What I should have done was do entanglement after Grover’s algorithm. Then it would have been nice to have a lecture on quantum communication complexity, but seeing as how things are rapidly heading towards the end (four more lectures to go) and I want to get to the threshold for fault-tolerant quantum computing I decided not to keep this. So the next lectures will introduce quantum error correction, deduce the quantum error correcting criteria, discuss classical linear and then CSS codes, discuss stabilizer codes, and then more on to fault-tolerant constructions. We might just make it.
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Lecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm
Lecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms
Lecture Notes 11: Shor’s Algorithm
Lecture Notes 12: Grover’s Algorithm
Lecture Notes 13: Mixed States and Open Quantum Systems
Lecture Notes 14: Quantum Entanglement and Bell’s Theorem
Lecture Notes 15: When Quantum Computers Fall Apart
Homework
Homework 1
Homework 2
Handouts
Syllabus

CSE 599d Lecture Notes 11 and 12

We’ve reached the Shor and then searched for a needle in a quantum haystack.
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Lecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm
Lecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms
Lecture Notes 11: Shor’s Algorithm
Lecture Notes 12: Grover’s Algorithm
Homework
Homework 1
Homework 2
Handouts
Syllabus

CSE 599d Lecture Notes 9 and 10

New notes on Fourier transforms. Also note that the old notes have some typos fixed. Almost to factoring!
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Lecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm
Lecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms
Homework
Homework 1
Homework 2
Handouts
Syllabus

CSE 599d Lecture Notes 8

New notes on Simon’s algorithm. Almost to factoring!
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Homework
Homework 1
Homework 2
Handouts
Syllabus

CSE 599d Lecture Notes 7

More notes and a new homework.
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Homework
Homework 1
Homework 2
Handouts
Syllabus

CSE 599d Lecture Notes 6

More notes. This Friday there will be a new problem set.
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Homework
Homework 1
Handouts
Syllabus