On the impossibility of a quantum sieve algorithm for graph isomorphism

SIAM Journal on Computing

Volumn 39, Issue 6, 2010, Pages 2377-2396

  Moore, Cristopher ^a,b   Russell, Alexander ^c   Sniady, Piotr ^d  

^a MSC01 1070   (United States)

^b SANTA FE INSTITUTE   (United States)

^c University of Connecticut   (United States)

^d INSTITUTE OF MATHEMATICS   (Poland)

Author keywords

Algorithm; Graph isomorphism; Quantum computing; Representation theory; Symmetric group

Indexed keywords

GRAPH ISOMORPHISM; QUANTUM COMPUTING; REPRESENTATION THEORY; SYMMETRIC GROUP; SYMMETRIC GROUPS;

ALGORITHMS; BINARY CODES; GROUP TECHNOLOGY; QUANTUM COMPUTERS; QUANTUM ENTANGLEMENT; QUANTUM OPTICS; SET THEORY; SIEVES; TENSORS;

COMPUTATION THEORY;

EID: 77952271402     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080724101     Document Type: Article

References (30)

1. D. AHARONOV, V. JONES, AND Z. LANDAU, A polynomial quantum algorithm for approximating the Jones polynomial, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 427-436.
2. G. ALAGIĆ, C. MOORE, AND A. RUSSELL, Quantum algorithms for Simon's problem over non- abelian groups, ACM Trans. Algorithms, 6 (2009).
3. D. ALDOUS AND P. DIACONIS, Hammersley's interacting particle process and longest increasing subsequences, Probab. Theory Related Fields, 103 (1995), pp. 199-213.
4. L. BABAI, On the complexity of canonical labeling of strongly regular graphs, SIAM J. Comput., 9 (1980), pp. 212-216.
5. L. BABAI AND E. M. LUKS, Canonical labeling of graphs, in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 171-183.
6. D. BACON, A. CHILDS, AND W. VAN DAM, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 469-478.
7. D. BACON, A. CHILDS, AND W. VAN DAM, Optimal measurements for the dihedral hidden subgroup problem, Chic. J. Theoret. Comput. Sci., 2006, article 2.
8. P. BIANE, Representations of symmetric groups and free probability, Adv. Math., 138 (1998), pp. 126-181.
9. K. FRIEDL, G. IVANYOS, F. MAGNIEZ, M. SANTHA, AND P. SEN, Hidden translation and orbit coset in quantum computing, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 1-9.
10. W. FULTON, Young Tableaux: With Applications to Representation Theory and Geometry, London Math. Soc. Stud. Texts 35, D. Benson, M. W. Etheridge, M. W. Liebeck, J. R. Partington, R. M. Roberts, U. L. Tillmann, and J. F. Toland, eds., Cambridge University Press, Cambridge, UK, 1997.
11. M. GRIGNI, L. SCHULMAN, M. VAZIRANI, AND U. VAZIRANI, Quantum mechanical algorithms for the nonabelian hidden subgroup problem, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 68-74.
12. S. HALLGREN, Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem, J. ACM, 54 (2007).
13. S. HALLGREN, Fast quantum algorithms for computing the unit group and class group of a number field, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 468-474.
14. S. HALLGREN, C. MOORE, M. RÖLTTELER, A. RUSSELL, AND P. SEN, Limitations of quantum coset states for graph isomorphism, in Proceedings of the Annual ACM 38th Symposium on Theory of Computing, 2006, pp. 604-617.
15. S. HALLGREN, A. RUSSELL, AND A. TA-SHMA, The hidden subgroup problem and quantum computation using group representations, SIAM J. Comput., 32 (2003), pp. 916-934.
16. G. JAMES AND A. KERBER, The Representation Theory of the Symmetric Group, Encyclopedia Math. Appl. 16, Addison-Wesley, Reading, MA, 1981.
17. S. V. KEROV, Asymptotic Representation Theory ofthe Symmetric Group and its Applications in Analysis, Transl. Math. Monogr. 219, American Mathematical Society, 2003.
18. G. KUPERBERG, A subexponential-time quantum algorithm for the dihedral hidden subgroup, SIAM J. Computing, 35 (2005), pp. 170-188.
19. C. MOORE AND A. RUSSELL, On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism, Preprint quant-ph/0609138, 2006; available online from http://www.arXiv.org.
20. C. MOORE AND A. RUSSELL, Explicit Multiregister Measurements for Hidden Subgroup Problems; or, Fourier Sampling Strikes Back, Preprint quant-ph/0504067, 2005; available online from http://www.arXiv.org.
21. C. MOORE, D. N. ROCKMORE, A. RUSSELL, AND L. J. SCHULMAN, The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts,SIAM J. Comput., 37 (2007), pp. 938-958.
22. C. MOORE, A. RUSSELL, AND L. J. SCHULMAN, The symmetric group defies strong Fourier sampling, SIAM J. Comput., 37 (2008), pp. 1842-1864.
23. A. RATTAN AND P. SNIADY, Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula, Adv. Math., 218 (2008), pp. 673-695.
24. O. REGEV, Quantum computation and lattice problems, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 520-529.
25. J.-P. SERRE, Linear representations of finite groups, Grad. Texts Math. 42, Springer-Verlag, Berlin, 1977.
26. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
27. D. R. SIMON, On the power of quantum computation, SIAM, J. Comput., 26 (1997), pp. 1474-1483.
28. D. A. SPIELMAN, Faster isomorphism testing of strongly regular graphs, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 576-584.
29. A. M. VERSHIK AND S. V. KEROV, Asymptotic behavior of the maximum and generic dimensions of irreducible representations of the symmetric group, Funk. Anal. i Prolizhen, 19 (1985), pp. 25-36 (in Russian);
30. Funct. Anal. Appl. 19 (1989), pp. 21-31 (in English).