On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism Jan 1, 2007· Cristopher Moore , Alexander Russell , Piotr Sniady · 0 min read Cite DOI URL Type Conference paper Publication Proceedings of the thirty-ninth annual ACM symposium on Theory of computing Last updated on Jan 1, 2007 ← For Distinguishing Conjugate Hidden Subgroups, the Pretty Good Measurement is as Good as it Gets Jan 1, 2007 On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics Jan 1, 2007 →