Delete comment from: Computational Complexity
This term I took a course at Waterloo on "Quantum Applications of Classical Complexity".
I found that Scott's PostBQP-based proof that PP is closed under intersection was very neat and good motivation to understand the basic formulation of quantum computing. My course project was to write this up, see http://en.wikipedia.org/wiki/PostBQP
On the other hand, my own feeling was that this was sort of a unique example -- the other topics in the course felt to me like quantum topics with quantum results. (Just an opinion, I don't mean to debate it, and certainly I am interested to see the upcoming survey paper.)
Aug 13, 2009, 2:54:12 PM
Posted to Is Quantum the new Random ?