Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer

Evidence for quantum annealing with more than one hundred qubits

(2014) Sergio Boixo et al.   Nature Physics

Experimental signature of programmable quantum annealing

(2013) Sergio Boixo et al.   Nature Communications

Complexity of Ising Polynomials

(2012) TOMER KOTEK   COMBINATORICS PROBABILITY & COMPUTING

Quantum adiabatic Markovian master equations

(2012) Tameem Albash et al.   NEW JOURNAL OF PHYSICS

Solving the graph-isomorphism problem with a quantum annealer

(2012) Itay Hen et al.   PHYSICAL REVIEW A

Distinguishing graphs by their left and right homomorphism profiles

(2011) Delia Garijo et al.   EUROPEAN JOURNAL OF COMBINATORICS

Two-particle quantum walks applied to the graph isomorphism problem

(2010) John King Gamble et al.   PHYSICAL REVIEW A

The bivariate Ising polynomial of a graph

(2009) Daniel Andrén et al.   DISCRETE APPLIED MATHEMATICS