How is Quantum Algorithms and Complexity Theory essentially different from Classical Counterparts?
Also how are non-deterministic Turing Machines(NTM) different from Quantum Turing Machines(QTM)? More precisely, Is there an QTM that can solve the SAT 'fairly fast'?
I wanted to know how are QTMs different from NTMs, for instance we have parallelism in NTMs which (i think) are not exhibited by QTMs, also there are certain class of problems (in linear optics) that the QTMs can solve easier than NTMs..
So, what are their limitations and computational powers?