Meeting 7.1: BQP and QMA

I define BQP ("bounded error quantum polynomial time") and pay lip service to the Solovay-Kitaev theorem (hopefully a student will prove it in a talk at the end of the semester).  I also discuss QMA ("Quantum Merlin Arthur"), the quantum analog of NP, or, better yet, the quantum analog of MA.