After reading a recent post on Church's Thesis, I ran into Turing-Church's Strong Thesis, that may be potentially disproven by advances in Quantum Computing. Does anyone know of a good resource that gets into the potential of quantum computing on complexity theory? And how complexity calculations would be done in that environment?


I am also not well read in complexity theory in general, so I may have made an ill-posed question here.



Quantum Computing Complexity?
This is a very active field of current research. The book "Quantum Computation and Quantum Information", By Michael Nielsen and Ike Chuang, is one of the standard references. 


Peter Shor found the original application of quantum computation to factorization, and I believe (without having full knowledge) that this still stands as one of the few instances of such an application - unfortunately, factorization is one of the few natural NP problems that are *not* known to be NP complete, so it may be the case that quantum computation "only" helps this particular problem (and problems trivially equivalent to it). The Wikipedia article on [BQP](http://en.wikipedia.org/wiki/BQP) is another useful reference. 


