Solving the graph-isomorphism problem with a quantum annealer

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 86, Issue 4, 2012, Pages

  Hen, Itay ^a   Young, A P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ISOMORPHISM PROBLEM; HIGH SYMMETRY; RELABELING; STRONGLY REGULAR GRAPHS; TWO-GRAPHS;

QUANTUM COMPUTERS; SET THEORY;

GRAPH THEORY;

EID: 84867316019     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.86.042310     Document Type: Article

References (50)

1. L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, Nature (London) NATUAS 0028-0836 10.1038/414883a 414, 883 (2001). (Pubitemid 34024733)
2. Z. Bian, F. Chudak, W. G. Macready, L. Clark, and F. Gaitan, arXiv: 1201.1842.
3. T. Kadowaki and H. Nishimori, Phys. Rev. E 1539-3755 10.1103/PhysRevE.58. 5355 58, 5355 (1998).
4. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, Science SCIEAS 0036-8075 10.1126/science.1057726 292, 472 (2001)
5. The QAA is similar to quantum annealing, proposed by T. Kadowaki and H. Nishimori, Phys. Rev. E PLEEE8 1539-3755 10.1103/PhysRevE.58.5355 58, 5355 (1998).
6. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, Science SCIEAS 0036-8075 10.1126/science.1057726 292, 472 (2001).
7. A longer version of the paper appeared in arXiv: quant-ph/0104129.
8. N. Xu, J. Zhu, D. Lu, X. Zhou, X. Peng, and J. Du, arXiv: 1111.3726v1.
9. M. W. Johnson, Nature (London) 473, 194198 (2011).
10. F. Gaitan and L. Clark, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.108.010501 108, 010501 (2012).
11. D. A. Spielman, in STOC '96: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1996), pp. 576-584.
12. P. W. Shor, in Proceedings of the 35th Symposium on Foundations of Computer Science, edited by, S. Goldwasser, (IEEE Computer Society, Washington, DC, 1994), p. 124.
13. M. K. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (H. H. Freeman, New York, 1997).
14. T. Rudolph, arXiv: quant-ph/0206068v1.
15. V. Gudkov and S. Nussinov, arXiv: cond-mat/0209112v2.
16. S. Shiau, R. Joynt, and S. Coppersmith, Quantum Inf. Comput. 5, 492 (2005).
17. J. K. Gamble, M. Friesen, D. Zhou, R. Joynt, and S. N. Coppersmith, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.81.052313 81, 052313 (2010).
18. K. Rudinger, J. K. Gamble, M. Wellons, E. Bach, M. Friesen, R. Joynt, and S. N. Coppersmith, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.86.022334 86, 022334 (2012).
19. Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.48.1687 48, 1687 (1993).
20. E. Bach, S. Coppersmith, M. P. Goldschen, R. Joynt, and J. Watrous, J. Comput. Syst. Sci. JCSSBM 0022-0000 10.1016/j.jcss.2004.03.005 69, 562 (2004).
21. D. Solenov and L. Fedichkin, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.73.012313 73, 012313 (2006). (Pubitemid 43270054)
22. A. Childs, E. Farhi, and S. Gutmann, Quantum Inf. Process. 1570-0755 10.1023/A:1019609420309 1, 35 (2002).
23. N. Shenvi, J. Kempe, and K. Birgitta Whaley, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.67.052307 67, 052307 (2003).
24. A. Ambainis, Int. J. Quantum Inf. 0219-7499 10.1142/S0219749903000383 1, 507 (2003).
25. A. Ambainis, in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (IEEE Computer Society, Washington, DC, 2004), pp. 22-31.
26. F. Magniez, A. Nayak, J. Roland, and M. Santha, in STOC '07: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 2007), p. 575.
27. V. Potoček, A. Gábris, T. Kiss, and I. Jex, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.79.012325 79, 012325 (2009).
28. D. Reitzner, M. Hillery, E. Feldman, and V. Buek, J. Phys. A: Math. Gen. PLRAAN 1050-2947 10.1103/PhysRevA.79.012323 79, 012323 (2009).
29. B. Douglas and J. Wang, J. Phys. A: Math. Theor. 1751-8113 10.1088/1751-8113/41/7/075303 41, 075303 (2008).
30. D. Emms, E. Hancock, S. Severini, and R. Wilson, Electron. J. Combinatorics 13, R34 (2006).
31. D. Emms, S. Severini, R. Wilson, and E. Hancock, Pattern Recognit. PTNRA8 0031-3203 10.1016/j.patcog.2008.10.025 42, 1988 (2009).
32. T. Kato, J. Phys. Soc. Jpn. JUPSAU 0031-9015 10.1143/JPSJ.5.435 5, 435 (1951).
33. A. Messiah, Quantum Mechanics (North-Holland, Amsterdam, 1962).
34. M. Mézard and G. Parisi, Eur. Phys. J. B EPJBFY 1434-6028 10.1007/PL00011099 20, 217 (2001).
35. M. Mézard and G. Parisi, J. Stat. Phys. JSTPBS 0022-4715 10.1023/A:1022221005097 111, 1 (2003).
36. L. Zdeborová and S. Boettcher, J. Stat. Mech.: Theory Exp. 2, 20 (2010).
37. E. Farhi, D. Gosset, I. Hen, A. W. Sandvik, P. Shor, A. P. Young, and F. Zamponi (private communication).
38. M. H. S. Amin, D. V. Averin, and J. A. Nesteroff, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.79.022107 79, 022107 (2009).
39. C. Godsil and G. Royle, Algebraic Graph Theory (Springer, New York, 2001).
40. E. W. Weisstein, http://mathworld.wolfram.com/StronglyRegularGraph.html.
41. E. Spence, http://www.maths.gla.ac.uk/~es/srgraphs.html.
42. B. McKay, http://cs.anu.edu.au/~bdm/data/graphs.html.
43. K. Rudinger (private communication).
44. A. P. Young, S. Knysh, and V. N. Smelyanskiy, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.101.170503 101, 170503 (2008).
45. A. P. Young, S. Knysh, and V. N. Smelyanskiy, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.104.020502 104, 020502 (2010).
46. K. J. Guo, Ph.D. thesis, University of Waterloo, 2010.
47. J. Y. Cai, M. Fürer, and N. Immerman, in SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (IEEE Computer Society, Washington, DC, 1989), pp. 612-617.
48. E. Farhi (private communication).
49. I. Hen and A. P. Young, Phys. Rev. E PLEEE8 1539-3755 10.1103/PhysRevE.84.061152 84, 061152 (2011).
50. M. Amin (private communication).