On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems

Quantum Information and Computation

Volumn 7, Issue 5-6, 2007, Pages 504-521

  Childs, Andrew M ^a   Wocjan, Pawel ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b University of Central Florida   (United States)

Author keywords

Hidden shift problem; Hidden subgroup problem; Quantum algorithms

Indexed keywords

QUANTUM COMPUTERS; QUANTUM THEORY;

EXPONENTIAL NUMBERS; GRAPH ISOMORPHISM; HIDDEN SHIFT PROBLEM; HIDDEN SUBGROUP PROBLEM; ISOMORPHISM PROBLEMS; N-VERTEX GRAPH; QUANTUM ALGORITHMS;

SET THEORY;

EID: 34547539405     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd ed., Wiley Interscience, New York, 2000.
2. L. Babai, W. M. Kantor, and E. M. Luks, Computational complexity and the classification of finite simple groups, Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 162-171.
3. D. Bacon, A. M. Childs, and W. van Dam, Optimal measurements for the dihedral hidden subgroup problem, Chicago Journal of Theoretical Computer Science (2006), no. 2. arXiv:quant-ph/0501044.
4. _, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005. arXiv:quant-ph/0504083.
5. R. Beals, Quantum computation of Fourier transforms over symmetric groups, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 48-53.
6. R. Bercov and L. Moser, On Abelian permutation groups, Canad. Math. Bull. 8 (1967), 627-630.
7. R. Boneh and R. Lipton, Quantum cryptanalysis of hidden linear functions, Advances in Cryptology - Crypto'95, 1995, pp. 424-437.
8. A. M. Childs and W. van Dam, Quantum algorithm for a generalized hidden shift problem, to appear in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, arXiv:quant-ph/0507190.
9. W. van Dam, S. Hallgren, and L. Ip, Quantum algorithms for some hidden shift problems, Proceedings of the 14th Annual ACM-SlAM Symposium on Discrete Algorithms, 2003, pp. 489-498. quant-ph/0211140.
10. M. Ettinger and P. Høyer, A quantum observable for the graph isomorphism problem. arXiv:quant-ph/9901029.
11. _, On quantum algorithms for noncommutative hidden subgroups, Advances in Applied Mathematics 25 (2000), no. 3, 239-251. arXiv:quant-ph/9807029.
12. M. Ettinger, P. Høyer, and E. Knill, The quantum query complexity of the hidden subgroup problem is polynomial, Information Processing Letters 91 (2004), no. 1, 43-48. arXiv:quant-ph/0401083.
13. K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen, Hidden translation and orbit coset in quantum computing, Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 1-9. arXiv:quant-ph/ 0211091.
14. D. Gavinsky, Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups, Quantum Information and Computation 4 (2004), no. 3, 229-235.
15. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem, Combinatorica 24 (2004), no. 1, 137-154.
16. L. Hales and S. Hallgren, An improved quantum Fourier transform algorithm and applications, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 515-525.
17. S. Hallgren, M. Rötteler, and P. Sen, Limitations of quantum coset states for graph isomorphism. arXiv:quant-ph/0511148.
18. S. Hallgren, A. Russell, and A. Ta-Shma, The hidden subgroup problem and quantum computation using group representations, SIAM J. Comput. 32 (2003), no. 4, 916-934.
19. C. W. Helstrom, Quantum Detection and Estimation Theory, Academic Press, New York, 1976.
20. P. Høyer, Efficient quantum transforms. arXiv:quant-ph/9702028.
21. G. Ivanyos, F. Magniez, and M. Santha, Efficient quantum algorithms for some instances of the nonabelian hidden subgroup problem, International Journal of Foundations of Computer Science 14 (2003), no. 5, 723-739. arXiv:quant-ph/0102014.
22. J. Kempe and A. Shalev, The hidden subgroup problem and permutation group theory, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005. arXiv:quant-ph/0406046.
23. A. Kitaev, Quantum measurements and the abelian stabilizer problem. arXiv:quant-ph/9511026.
24. G. Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem, SIAM Journal on Computing 38 (2005), no. 1, 170-188. arXiv:quant-ph/0302112.
25. C. Moore, D. N. Rockmore, A. Russell, and L. J. Schulman, The hidden subgroup problem in affine groups: Basis selection in Fourier sampling, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 1113-1122. arXiv:quant-ph/0211124, extended version at arXiv:quant-ph/ 0503095.
26. C. Moore and A. Russell, The symmetric group defies strong Fourier sampling: Part II. arXiv.quant-ph/0501066.
27. _, Tight results on multiregister Fourier sampling: Quantum measurements for graph isomorphism require entanglement. arXiv:quant-ph/0511149.
28. C. Moore, A. Russell, and L. J. Schulman, The symmetric group defies strong Fourier sampling: Part I, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005. arXiv:quant-ph/0501056.
29. E. Petrank and M. Roth, Is code equivalence easy to decide?, IEEE Trans. Inform. Theory 43 (1997), no. 5, 1602-1604.
30. O. Regev, Quantum computation and lattice problems, Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, 2002, pp. 520-529. arXiv:cs.DS/0304005.
31. _, A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv:quant-ph/0406151.
32. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26 (1997), no. 5, 1484-1509.
33. D. R. Simon, On the power of quantum computation, SIAM Journal on Computing 26 (1997), no. 5, 1474-1483.
34. N. J. A. Sloane, The on-line encyclopedia of integer sequences, 2005. http://www.research.att.com/-njas/sequences.
35. P. Wocjan and M. Horodecki, Characterization of combinatorially independent permutation separability criteria, Open Syst. Inf. Dyn. 12 (2005), no. 4, 331-345. arXiv:quant-ph/0503129.