Erratum: Hearing the shape of the ising model with a programmable superconducting-flux annealer (Scientific Reports (2014) 4 (5703) DOI: 10.1038/srep05703);Hearing the shape of the ising model with a programmable superconducting-flux annealer

Scientific Reports

Volumn 4, Issue , 2014, Pages

  Vinci, Walter ^a   Markström, Klas ^b   Boixo, Sergio ^c,d   Roy, Aidan ^e   Spedalieri, Federico M ^c   Warburton, Paul A ^a   Severini, Simone ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UMEÅ UNIVERSITY   (Sweden)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d GOOGLE INC   (United States)

^e D WAVE SYSTEMS INC   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84904497696     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep40651     Document Type: Erratum

References (41)

1. Kac, M. Can one hear the shape of a drum? The American Mathematical Monthly 73, 1-23 (1966).
2. Wikipedia contributors. Hearing the shape of a drum. Wikipedia, The Free Encyclopedia. http://en.wikipedia.org/wiki/Hearing-the-shape-of-a-drum (24/ 06/2014).
3. Gutkin, B. & Smilansky, U. Can one hear the shape of a graph? J. Phys. A. Math. Gen. 34, 6061-6068 (2001).
4. van Dam, E. R. & Haemers, W. H. Which graphs are determined by their spectrum? Linear Algebra Appl. 373, 241-272 (2003).
5. Godsil, C. D. &McKay, B. D. Constructing cospectral graphs. Aequationes Math. 25, 257-268 (1982).
6. Godsil, C. & Royle, G. Algebraic Graph Theory (Springer-Verlag, 2001).
7. Audenaert, K. et al. Symmetric squares of graphs. J. Comb. Theory, Ser. B 97(1), 74-90 (2007).
8. Emms, D. et al. A matrix representation of graphs and its spectrum as a graph invariant. Electron. J. Combin. 13(1), R34 (2006).
9. Gamble, J. K., Friesen, M., Zhou, D., Joynt, R. & Coppersmith, S. N. Two-particle quantum walks applied to the graph isomorphism problem. Phys. Rev. A 81, 052313 (2010).
10. Konno, N. Quantum walks. Quantum Potential Theory, Lecture Notes in Mathematics [309-452] (Springer-Verlag, Berlin Heidelberg, 2008).
11. Ising, E. Beitrag zur Theorie des Ferromagnetismus. Z. Physik 31, 253-258 (1925).
12. Huang, K. Statistical Mechanics (Wiley, John & Sons, 1990).
13. Johnson, M.W. et al. Quantum annealing with manufactured spins. Nature 473, 194198 (2011).
14. Santoro, G. E. et al. Theory of Quantum Annealing of an Ising Spin Glass. Science 295, 24272430 (2002).
15. Cipra, B. A. An Introduction to the Ising Model. Amer. Math. Monthly 94, 937-959 (1987).
16. Fortuin, C. M. & Kasteleyn, P. W. On the random cluster model. I. Introduction and relation to other models. Physica 57, 536-564 (1972).
17. Tutte, W. T. A contribution to the theory of chromatic polynomials. Canad. J. Math. 6, 80-91 (1954)
18. Whitney, H. The coloring of graphs. Ann. Math. 33, 688-718 (1932).
19. Welsh, D. J. A. Complexity: knots, colorings and counting. London Mathematical Society Lecture Note Series 186 (Cambridge University Press, Cambridge, 1993).
20. de Mier, A. & Noy, M. On graphs determined by their Tutte polynomial. Graph. Comb. 20, 105-119 1 (2004).
21. Garijo, D., Goodall, A. & Nesetril, J. Distinguishing graphs by their left and right homomorphism profiles. Eur. J. Comb. 32, 1025-1053 (2011).
22. Andren, D. & Markstrom, K. The bivariate Ising polynomial of a graph. Discrete Appl. Math. 157(11), 2515-2524 (2009).
23. Goldberg, L. A., Jerrum,M. & Paterson, M. The computational complexity of twostate spin systems. Random Struct. Alg. 23, 133-154 (2003).
24. Kotek, T. Complexity of Ising polynomials. Combin. Probab. Comput. 21, 743-772 (2012).
25. van der Waerden, B. L. Die lange reichweite der regelmassigen atomanordnung in mischkristallen. Zeitschrift für Physik 118, 573-479 (1941).
26. Hen, I., & Young, A. P. Solving the graph-isomorphism problem with a quantum annealer. Phys. Rev. A 86, 042310 (2012).
27. Lieb, E., Schultz, T. & Mattis, D. Two soluble models of an antiferromagnetic chain. Ann. Phys. 16, 407-466 (1961).
28. Sachdev, S. Quantum Phase Transitions (Cambridge University Press, Cambridge, 1999).
29. Dutta, A. et al. Quantum phase transitions in transverse field spin models: From Statistical Physics to Quantum Information. arXiv:1012.0653.
30. Arvind, V. & Torán, J. Isomorphism Testing: Perspective and Open Problems. Bulletin of the EATCS 86, 66-84 (2005).
31. Brooke et al. J. Quantum Annealing of a Disordered Magnet. Science 284, 779781 (1999).
32. Finnila, A. et al. Quantum annealing: a new method for minimizing multidimensional functions. Chem. Phys. Lett. 219, 343-348 (1994).
33. Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355-5363 (1998).
34. Farhi, E. et al. Quantum Computation by Adiabatic Evolution. arXiv:quant-ph/ 0001106.
35. Aharonov, D. et al. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37, 166 (2007).
36. Boixo, S. et al. Experimental signature of programmable quantum annealing. Nature Comm. 4, 3067 (2013)
37. Boixo, S. et al. Evidence for quantum annealing with more than one hundred qubits. Nature Physics 10, 218 (2014).
38. Smolin, J. A. & Smith, S. Classical signature of quantum annealing. arXiv:1305.4904.
39. Shin, S. W. et al. How ''Quantum'' is the D-Wave Machine? arXiv:1401.7087.
40. Vinci, W. et al. Distinguishing Classical and Quantum Models for the D-Wave Device. arXiv:1403.4228.
41. Albash, T. et al. Quantum adiabatic Markovian master equations. New J. Phys. 14, 123016 (2012).