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
7×7=49
I’ve been hit by the seven by seven meme. Well, I guess this is okay, because seven times seven is forty nine, and I grew up a devout 49er fan. And besides, as Cosma points out this is a good way to procrastinate on working on lecture notes.
1. Seven things to do before I die
Things that I will air in the public: 1) Program a big quantum computer. 2) Ski down Mt. Shasta. 3) Live on a tropical island. 4) Live in a ski town. 5) Write an academic book. 6) Write a science fiction novel. 7) Discover the secrets of the universe. Okay, I’ll admit that last one is a bit ambitious.
2. Seven things I cannot do
1) Not laugh. 2) Ride a unicycle. 3) Understand what motivates mathematicians. 4) Tie my shoes correctly. 5) Be pessimistic. 6) Abandon reason. 7) Get enough sleep.
3. Seven things that attract me to [Seattle]
1) My sister. 2) My mother. 3) A girl I met in Hawaii. 4) My cousins! 5) Snow. 6) Blue. 7) The generosity of the computer science department and Mark Oskin for getting me my position here.
4. Seven things I say most often
1) “Sweet!” 2) “Dude.” 3) [beginning of sentence] “qubits” [end of sentence]. 4) “Off like a herd of turtles.” 5) “Vamanos?” 6) “It’s time to get up, it’s time to get up, it’s time to get up in the morning!” 7) “A man, a plan, a canal, Panama.”
5. Seven books (or series) that I love
1) Labyrinths
6.Seven movies that I watch over and over again (or would if I had the time)
1) Dr. Strangelove
7. Seven people I want to join in, too.
1) Scott Aaronson. 2) Aram. 3) Mic. 4) Steve Hsu. 5) Lisa. 6) Michael Nielsen. 7) Suz
Ski Season 05-06, Day 3
Skied at Crystal Mountain near Mt. Rainier. On the drive up I saw what I thought was a moose! But apparently there are no Moose near Mt. Rainir. Perhaps it was an elk or a mule deer, but I could have sworn it was a moose. It snowed most of the morning and then cleared a bit after noon. Crystal is nice and has many large fast lifts. However I spent most of my time on the smallest slowest lift they had: because it went to the best snow. Interestingly the lifts which serviced more intermediate and beginner lifts were very packed (although the lines went fast: especially when you go in the singles line, eh?)
A report on my new skis is probably in order. I have a pair of 2005 Rossignol Bandit B2s. Today I got to test them out in some heavy Pacific snow. And boy are they are good ski for cutting through this heavy snow. I’m also enjoying the easy and speed of the turns on my B2s. Interestingly I haven’t had any of the problems some others have described with catching tails. But I think this may be because I’m moving to a much shorter ski than my last pair which were 205s. The B2s seem pretty stable at high speed. The only place where I worry they may be a bit weak is on ice. But I only had a chance to test at the end of the day at the bottom of the mountain, which had much worse snow than the top of the mountain.
While many of you will be traveling to QIP in Paris, and I am disapointed that I will not be able to attend, ski days like this, however, can help to lessen the pain.
CSE 599d Lecture Notes 5
The Allegro notes continue. Today’s notes are brought to you courtesy the great espresso drink “an Americano.”
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
Homework
Homework 1
Handouts
Syllabus
SQuInT 2006 Program
The SQuInT conference program is now available online. OK, I am totally biased, but SQuInT is still one of my favorite conferences. Why? Green chiles! Just kiding. It is one of my favorite conferences because it is one of the few remaining conferences where you still see a good mix of experimental and theoretical quantum computing work and a good mix of computer science and physics. Of course there will always be theoreticians who are bored by experimental talks, and experimentalists who are bored by the obtuse theoreticians. Similarly there will always be computer scientists who don’t care much for the physics and physicists who don’t much care for the computer science. But I got into this field exactly because it does allow me to see both of these worlds. If you ask what I have missed the most in the last few years in going to conferences is that I haven’t seen as much experimental physics as I used to see. I therefore find it awesome that SQuInT still strives for a mixture of the often difuse worlds of quantum information science.
On a related note QIP 2006 starts next week. I am sad that I won’t be able to attend, but I’m guessing you will get good coverage from Scott Aaronson on his blog Shtetl-Optimized.
CSE 599d Lecture Notes 4
More notes for CSE599d Quantum Computing. I am calling these notes the Allegro notes because I have been spending a lot of time at the local coffee house called “Allegro.” Well at least it gives me a good excuse for the many many mistakes in the notes: they are obviously the fault of all the caffeine I consume at Allegro.
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
Homework
Homework 1
Handouts
Syllabus
CSE 599d Lecture Notes 3
More notes for CSE599d Quantum Computing
Lecture Notes
Introduction and Basics of Quantum Theory
Dirac Notation and Basic Linear Algebra for Quantum Computing
One Qubit, Two Qubit
Homework
Homework 1
Link Dumpage
My goal, of course, is to keep you from being productive (hence making me look more productive, wah hah hah!) Luckily some of my readers are kind enough to send me links that will aid me in this quest. The first, is from Tom, who send me a link to AtomChip® Quantum® II processor 6.8GHz with 256MB on-board memory. By the time we actually build a quantum computer, I fear that all of the good product names will have been taken!
And just in case you wanted to know about the end of the world in 2012, there is Prophet’s Manual – Fractal Supersymmetry of Double Helix. Chaos, physics, and biology…nice! When I was a graduate student our group consisted of physicist, chemists, and mathematicians. We were always looking for a biologist, so we could write a quantum bio nano paper.
CSE 599d Lecture Notes 2
More notes and a homework for CSE599d Quantum Computing
Lecture Notes
Introduction and Basics of Quantum Theory
Dirac Notation and Basic Linear Algebra for Quantum Computing
Homework
Homework 1
More Hot Water Fodder
Since, my remarks in the last post about classical computational complexity got me into such hot water with those who are much smarter than I am, I thought I’d post another of the less often expressed reasons for studying quantum computation from my notes:
It is often remarked upon by mathematicians and physicists that there is a mysterious harmony between these two disciplines. Indeed both fields have benefitted immensely from each other. The same can not be said, I think, for computer science. A good question to ask is why this is true? One idea floating around in research land is that the reason for the lack of such deep connections has been that this is because the wrong model of computation has been studied. It makes sense that if the universe obeys the laws of quantum theory, then we shouldn’t be surprised if a theory of computation based on classical theory doesn’t make connection to the physics of these devices. And going one further step it also seems likely that if we use the theory of computation which is more relevant to the way our world works, then we just might be able to prove and reason about these computers in a simpler manner. A rough analog might be that between real analysis and complex analysis: certainly those of you who have had a class on real analysis and complex analysis remember how “easier” everything is in complex analysis than in real analysis. Might quantum computers lead to a similar shift? Right now there are only a few results that I can point to along these directions, for example Scott Aaronson’s has a very eloquent proof that the complexity class PP is closed under intersection which begins by first showing that PP is equal to a model of quantum computing in which one can post-selection the outcome of the quantum computation and then is extremely simple due to the properties of the quantum model of computation to show closure under intersction. Might not more of the theory of computational complexity be as easy if we focus on the model of quantum computation?