Possible Duplicate:NP-intermediate problems with efficient quantum solutions Many suspect that quantum computers will not be able to efficiently solve NP-complete problems and  thus focus on the class NPI. Among the problems regarded as likely canditates to be in NPI are factoring and graph isomorphism. Known yet Shor's algorithm for efficient factorization, what steps have been done towards the design of a polynomial algorithm for graph isomorphism? 
Polynomial Quantum Algorithm for Graph Isomorphism?
cc.complexity theory;quantum computing;np