Experimental quantum annealing: case study involving the graph isomorphism problem

P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hungar. Acad. Sci

1960

Earlier work this paper cites.

L. Babai and E. M. Luks, “Canonical labeling of graphs,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing

1983

Earlier work this paper cites.

C. Moore, A. Russell, and L. J. Schulman, “The symmetric group defies strong Fourier sampling,” SIAM Journal on Computing

2008

Earlier work this paper cites.

V. Choi, “Minor-embedding in adiabatic quantum computation: I. The parameter setting problem,” Quantum Information Processing

2008

Earlier work this paper cites.

Y. Kumar and P. Gupta, “External memory layout vs. schematic,” ACM Transactions on Design Automation of Electronic Systems (TODAES)

2009

Earlier work this paper cites.

S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen, “Limitations of quantum coset states for graph isomorphism,” Journal of the ACM (JACM)

2010

Earlier work this paper cites.

CRC Press, 2012

E. E. Reiter and C. M. Johnson, Limits of computation: an introduction to the undecidable and the intractable · 2012

Earlier work this paper cites.

I. Hen and A. Young, “Solving the graph-isomorphism problem with a quantum annealer,” Physical Review A

2012

Earlier work this paper cites.

S. Boixo, T. Albash, F. M. Spedalieri, N. Chancellor, and D. A. Lidar, “Experimental signature of programmable quantum annealing,” Nature Communications

2013

Cited alongside, same era.

B. D. McKay, “Graph isomorphism,” in Handbook of Graph Theory

Original

2013

Cited alongside, same era.

Morgan & Claypool Publishers, 2014

C. C. McGeoch, Adiabatic quantum computation and quantum annealing: Theory and practice · 2014

Cited alongside, same era.

S. Boixo, T. F. Rønnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, “Evidence for quantum annealing with more than one hundred qubits,” Nature Physics

2014

Cited alongside, same era.

T. Lanting, A. Przybysz, A. Y. Smirnov, F. Spedalieri, M. Amin, A. Berkley, R. Harris, F. Altomare, S. Boixo, P. Bunyk, et al

2014

Cited alongside, same era.

A. D. King and C. C. McGeoch, “Algorithm engineering for a quantum annealing platform,” arXiv preprint arXiv:1410.2628 [cs.DS]

Original

2014

Later among the works it cites.

W. Vinci, K. Markström, S. Boixo, A. Roy, F. M. Spedalieri, P. A. Warburton, and S. Severini, “Hearing the shape of the Ising model with a programmable superconducting-flux annealer,” Scientific Reports

2014

Later among the works it cites.

F. Gaitan and L. Clark, “Graph isomorphism and adiabatic quantum computing,” Phys. Rev. A

2014

Later among the works it cites.

A. Lucas, “Ising formulations of many NP problems,” Frontiers in Physics

2014

Later among the works it cites.

J. Cai, W. G. Macready, and A. Roy, “A practical heuristic for finding graph minors,” arXiv preprint arXiv:1406.2741 [quant-ph]

Original

2014