Physically-motivated dynamical algorithms for the graph isomorphism problem

Quantum Information and Computation

Volumn 5, Issue 6, 2005, Pages 492-506

  Shiau, Shiue Yuan ^a   Joynt, Robert ^a   Coppersmith, S N ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Graph isomorphism; Quantum computing

Indexed keywords

COMPUTATIONAL CHEMISTRY; DYNAMICAL SYSTEMS; GRAPH STRUCTURES; GRAPH THEORY; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS; SET THEORY;

GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; NON-ISOMORPHIC; PHYSICS-BASED; POLYNOMIAL-TIME ALGORITHMS; QUANTUM COMPUTING; STRONGLY REGULAR GRAPHS; TWO PARTICLES;

GRAPH ALGORITHMS;

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

References (34)

1. J. Köbler, U. Schöning, and J. Toràn. The Graph Isomorphism Problem - Its Structural Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1993.
2. S. Fortin, The graph isomorphism problem, Tech. Report TR 96-20, Dept. of Computing Science, University of Alberta, 1996.
3. X. Liu and D.J. Klein, The graph isomorphism problem, J. Comput. Chem. 12, 1243-1251 (1991).
4. 2 algorithm for determining isomorphism of planar graphs, Information Processing Letters 1, 32-34 (1971).
5. Hopcroft, J.E. and Wong, J.K., Linear time algorithm for isomorphism of planar graphs, Proc. 6th ACM Symposium on Theory of Comput., 1974, 172-184.
6. Luks, E.M., Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. Sys. Sci. 25, 42-65 (1982)
7. Hoffmann, C.M., Group-theoretic algorithms and graph isomorphism. Springer-Verlag, Berlin, 1982.
8. L. Babai, D. Grigoryev, and D. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity. In Proc. 14th ACM Symp. on Theory of Computing, pp. 310-324, 1982.
9. J. Chen, A linear-time algorithm for isomorphism of graphs of bounded average genus, SIAM J. Disc. Math. 7, 614-631 (1994).
10. L. Babai and E. Luks, Canonical labeling of graphs, in Proc. 15th ACM Symp. on Theory of Computing, 171-183 (1983).
11. R. Mathon, A note on the graph isomorphism counting problem, Information Processing Letters, 8, 131-132 (1979).
12. R. Boppana, J. Hastad, and S. Zachos, Does co-NP have short interactive proofs? In Information Processing Letters 25, pp. 27-32, 1987.
13. U. Schöning, Graph isomorphism is in the low hierarchy, J. Computer and System Sciences 37, 312-323 (1988).
14. Perhaps the best-known example of a problem believed to be neither in P nor NP-complete is factorization, for which no classical polynomial algorithm is known but which can be solved in polynomial time on a quantum computer [15].
15. P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Sci. Statis. Comput. 26, 1484 (1997).
16. M. Grigni, L. J. Schulman, M. Vazirani, and U. Vazirani, Quantum mechanical algorithms for the non-abelian hidden subgroup problem, in Proc. 33rd Annual ACM symposium on theory of computing, pp. 68-74 (2001).
17. S. Hallgren, A. Russell, and A. Ta-Shma, The hidden subgroup problem and quantum computation using group representations, SIAM J. Comput. 32, 916-934 (2003).
18. C. Moore, A. Russell, and L.J. Schulman, The symmetric group defies strong Fourier sampling, Part I. quant-phys 0501056.
19. C. Moore and A. Russell, The symmetric group defies strong Fourier sampling, Part II. quant-phys 0501066.
20. Aaronson Quantum Lower Bound for the Collision Problem in Proc. ACM Symp. on Theory of Computing, 635-642 (2002).
21. A well-known quantum algorithm motivated by physical processes is the adiabatic algorithm proposed by Farhi and collaborators [22, 23, 24]. The algorithms we examine are clearly different than the adiabatic algorithm, but the philosophy underlying the scheme is analogous.
22. E. Farhi et al., A quantum adiabatic algorithm applied to random instances of an NP-complete problem, Science 292, 472-475 (2001).
23. A.M. Childs, E. Farhi, and J. Preskill, Robustness of adiabatic quantum computation, Phys. Rev. A 65, 012322 (2002).
24. J. Roland and N.J. Cerf, Quantum search by local adiabatic evolution, Phys. Rev. A 65, 042308 (2002).
25. V. Gudkov and S. Nussinov, Graph equivalence and characterization via a continuous evolution of a physical analog, cond-mat/0209112.
26. T. Rudolph, Constructing physically intuitive graph invariants, quant-ph/0206068.
27. D.B. West, Introduction to Graph Theory, 2nd ed. Prentice-Hall, Englewood Cliffs, NJ (2000).
28. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, SpringerVerlag, Berlin, 1989.
29. Denes, J.; Keedwell, A. D.: Latin Squares and Their Application. Academic Press, New York, London, 1974.
30. J. Hubbard, Proc. R. Soc. London Sr. A 276, 238 (1963);
31. M. Gutzwiller, Phys. Rev. Lett. 10, 159 (1963);
32. J. Kanamori, Prog. Theor. Phys. 30, 275 (1963).
33. Aharonov and Ta-Shma, Adiabatic Quantum State Generation and Statistical Zero Knowledge, in Proc. ACM Symp. on Theory of Computing, 20-29 (2003).
34. p > 2.