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?
Not ENTIRELY sure on whether this should be community wiki or not, will go with not for now, will update if someone thinks its appropriately classified as community wiki.
I am also not well read in complexity theory in general, so I may have made an ill-posed question here.
