Limitations of quantum coset states for graph isomorphism

Journal of the ACM

Volumn 57, Issue 6, 2010, Pages

  Hallgren, Sean ^a   Moore, Cristopher ^b   Rötteler, Martin ^c   Russell, Alexander ^d   Sen, Pranab ^e  

^a The Pennsylvania State University   (United States)

^b University of New Mexico   (United States)

^c NEC LABORATORIES AMERICA   (United States)

^d University of Connecticut   (United States)

^e TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

Graph isomorphism; Hidden subgroup problem; Quantum algorithms; Quantum computation

Indexed keywords

AMOUNT OF INFORMATION; COMMON FEATURES; COSET STATE; GRAPH ISOMORPHISM; HIDDEN SUBGROUP PROBLEM; JOINT MEASUREMENT; POTENTIAL SOURCES; QUANTUM ALGORITHMS; QUANTUM COMPUTATION; QUANTUM MEASUREMENT; UPPER BOUND;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; QUANTUM COMPUTERS; SET THEORY;

QUANTUM ENTANGLEMENT;

EID: 78649239030     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1857914.1857918     Document Type: Article

References (48)

1. AHARONOV, D., KITAEV, A., AND NISAN, N. 1998. Quantum circuits with mixed states. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC'98). ACM, New York, 20-30.
2. AHARONOV, D., AND TA-SHMA, A. 2003. Adiabatic quantum state generation and statistical zero knowledge. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC'03).ACM, New York, 20-29. (Also: ArXiv preprint quant-ph/0301023).
3. ALAGIC, G., MOORE, C., AND RUSSELL, A. 2007. Quantum algorithms for Simon's problem over general groups. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07). ACM, New York, 1217-1224. (Also: ArXiv preprint quant-ph/0603251.)
4. BACON, D., CHILDS, A., AND VAN DAM, W. 2005. 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 (FOCS'05). IEEE Computer Society Press, Los Alamitos, CA. Also: ArXiv preprint quant-ph/0504083.
5. BACON, D., CHILDS, A., AND DAM, W. V. 2006. Optimal measurements forthe dihedral hidden subgroup problem. Chicago J. Theoret. Comput. Sci. 2006, 2, 1-25. (Also: ArXiv preprint quant-ph/0501044).
6. BEALS, R. 1997. Quantum computation of Fourier transforms over the symmetric groups. In Proceedings of the Symposium on Theory of Computing (STOC'97). ACM, New York, 48-53.
7. BENNETT, C., BERNSTEIN, E., BRASSARD, G., AND VAZIRANI, U. 1997. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 5, 1510-1523.
8. BERKOVICH, Y.G., AND ZHMUD, E. M. 1999. Characters of Finite Groups, Part 2. Translations of Mathematical Monographs, vol. 181. American Mathematical Society, New York.
9. BRASSARD, G., AND HøYER, P. 1997. An exact polynomial-time algorithm for Simon's problem. In Proceedings of 5th Israeli Symposium on Theory of Computing and Systems. ISTCS, IEEE Computer Society Press, Los Alamitos, CA, 12-33. (Also: ArXiv preprint quant-ph/9704027.)
10. CHILDS, A., AND WOCJAN, P. 2007. On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quant. Inf. Comput. 7, 5&6, 371-382. (Also: ArXiv preprint quant-ph/0510185.)
11. ETTINGER, M., AND HøYER, P. 2000. On quantum algorithms for noncommutative hidden subgroups.Adva. Appl. Math. 25, 3, 239-251.
12. ETTINGER, M., HøYER, P., AND KNILL, E. 1999a. A quantum observable for the graph isomorphism problem. (ArXiv preprint quant-ph/9901029.)
13. ETTINGER, M., HøYER, P., AND KNILL, E. 1999b. Hidden subgroup states are almost orthogonal. (ArXiv preprint quant-ph/9901034.)
14. ETTINGER, M., HøYER, P., AND KNILL, E. 2004. The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters 91, 1, 43-48. (Also: ArXiv preprint quant-ph/0401083).
15. FRIEDL, K., IVANYOS , G., MAGNIEZ, F., SANTHA, M. , AND SEN, P. 2003. Hidden translation and orbit coset in quantum computing. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC'03). ACM, New York, 1-9. (Also: ArXiv preprint quant-ph/0211091.)
16. FULTON, W., AND HARRIS, J. 1991. Representation Theory: A First Course. Graduate Texts in Mathematics, vol. 129. Springer, New York.
17. GALLAGHER, P. X. 1994. Character values at involutions. Proc. AMS 120, 3, 657-659.
18. GAVINS KY, D. 2004. Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups. Quant. Inf. Computat. 4, 3, 229-235.
19. GRIGNI, M., SCHULMAN, L., VAZIRANI, M., AND VAZIRANI, U. 2004. Quantum mechanical algorithms forthe nonabelian hidden subgroup problem. Combinatorica 24, 1, 137-154.
20. GROVER, L. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC'96). ACM, New York, 212-219. (Also: ArXiv preprint quant-ph/9605043.)
21. HALLGREN, R., MOORE, C., RÖTTELER, M., RUSSELL, A., AND SEN, P. 2006. Limitations of Quantum Coset States for Graph Isomorphism. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06). ACM, New York, 604-617.
22. HALLGREN, S. 2002. Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC'02). ACM, New York, 653-658.
23. HALLGREN, S. 2005. 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 (STOC'05).ACM, New York, 468-474.
24. HALLGREN, S., RUSSELL, A., AND TA-SHMA, A. 2003. The hidden subgroup problem and quantum computation using group representations. SIAM J. Comput. 32, 4, 916-934.
25. ISAACS, I. M. 1976. Character Theory of Finite Groups. Academic Press, New York.
26. IVANYOS, G., MAGNIEZ, F., AND SANTHA, M. 2003. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Int. J. Foundations of Computer Science 14, 5, 723-740. (Also: ArXiv preprint quant-ph/0102014.)
27. IVANYOS, G., SANSELME, L., AND SANTHA, M. 2007. An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07). Lecture Notes in Computer Science, vol. 4393. Springer- Verlag, Berlin, Germany, 586-597. (Also: ArXiv preprint quant-ph/0701235.)
28. JAMES, G., AND KERBER, A. 1981. The Representation Theory of the Symmetric Group. Addison-Wesley, Reading.
29. KITAEV, A. Y. 1995. Quantum measurements and the abelian stabilizer problem. (ArXiv preprint quant- ph/9511026.)
30. KÖBLER, J., SCHÖNING, U., AND TORÁN, J. 1993. The Graph Isomorphism Problem. Birkhäuser, Boston.
31. KUPERBERG, G. 2005. A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35, 1, 170-188. (Also arxiv preprint quant-ph/0302112.)
32. 2 over a finite field and related numerical experiments. Exp. Math. 1, 2, 115-139.
33. MOORE, C., ROCKMORE, D., RUSSELL, A., AND SCHULMAN, L. 2007a. The power of strong Fourier sampling: quantum algorithms for affine groups and hidden shifts. SIAM J. Comput. 37, 3, 938-958. (Also: ArXiv preprint quant-ph/0503095.)
34. MOORE, C., AND RUSSELL, A. 2005a. Explicit multiregister measurements for hidden subgroup problems. (ArXiv preprint quant-ph/0504067.)
35. MOORE, C., AND RUSSELL, A. 2005b. The symmetric group defies strong Fourier sampling: Part II. (ArXiv preprint quant-ph/0501066.)
36. MOORE, C., RUSSELL, A., AND SCHULMAN, L. 2005. The symmetric group defies strong Fourier sampling. In Proceedings of the 46th Annual IEEE Symposium on the Foundations of Computer Science (FOCS'05). IEEE Computer Society Press, Los Alamitos, CA, 479-488. (Also: ArXiv preprint quant-ph/0501056.)
37. MOORE, C., RUSSELL, A., AND ŚNIADY, P. 2007b. On the impossibility of a quantum sieve algorithm for graph isomorphism. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC'07). ACM, New York, 536-545. (Also: ArXiv preprint quant-ph/0612089.)
38. MOORE, C., RUSSELL, A., AND VAZIRANI, U. 2007c. A classical one-way function to confound quantum adversaries. (ArXiv preprint quant-ph/0701115.)
39. MOSCA, M., AND EKERT, A. 1998. The hidden subgroup problem and eigenvalue estimation on a quantum computer. In Quantum Computing and Quantum Communications. Lecture Notes in Computer Science, vol. 1509. Springer-Verlag, Berlin, Germany, 174-188.
40. NIELSEN, M., AND CHUANG, I. 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK.
41. RADHAKRISHNAN, J., RÖTTELER, M., AND SEN, P. 2009. Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. Algorithmica 55, 3, 490-516. (Also: ArXiv preprints quant-ph/0503114 and quant-ph/0512085.)
42. REGEV, O. 2004a. New lattice-based cryptographic constructions. J. ACM 51, 6, 899-942.
43. REGEV, O. 2004b. Quantum computation and lattice problems. SIAM J. Comput. 33, 2, 738-760.
44. ROICHMAN, Y. 1996. Upper bound on the characters of the symmetric groups. Invent. Math. 125, 451485.
45. SCHMIDT, A., AND VOLLMER, U. 2005. Polynomial time quantum algorithm for the computation of the unit group of a number field. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC'05). ACM, New York, 475-480.
46. SERRE, J. P. 1977. Linear Representations of Finite Groups. Springer, New York.
47. SHOR, P. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5, 1484-1509.
48. SIMON, D. R. 1994. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS'94). IEEE Computer Society Press, Los Alamitos, CA 116-123.