Fetching the paper…
Reading the bibliography…
We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices.
A formal basis for the heuristic determination of minimum cost paths
P. E. Hart, N. J. Nilsson, and B. Raphael · 1968
Earlier work this paper cites.
On the computational complexity of ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
Graph minors XIII: the disjoint paths problem
N. Robertson and P. D. Seymour · 1995
Earlier work this paper cites.
Short paths in expander graphs
J. Kleinberg and R. Rubinfeld · 1996
Earlier work this paper cites.
Quantum computation by adiabatic evolution
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 2000
Earlier work this paper cites.
Pseudo-boolean optimization
Endre Boros and Peter Hammer · 2002
Earlier work this paper cites.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2007
Earlier work this paper cites.
Minor-embedding in adiabatic quantum computation: I. the parameter setting problem
V. Choi · 2008
Cited alongside, same era.
The order of the largest complete minor in a random graph
N. Fountoulakis, D. Kühn, and D. Osthus · 2008
Cited alongside, same era.
Minors in random regular graphs
N. Fountoulakis, D. Kühn, and D. Osthus · 2009
Cited alongside, same era.
Minors in expanding graphs
M. Krivelevich and B. Sudakov · 2009
Cited alongside, same era.
The Ising model: teaching an old problem new tricks
Z. Bian, F. Chudak, W. G. Macready, and G. Rose · 2010
Cited alongside, same era.
Experimental demonstration of a robust and scalable flux qubit
R. Harris, J. Johansson, A. J. Berkley, M. W. Johnson, T. Lanting, S. Han, P. Bunyk, E. Ladizinsky, T. Oh, I. Perminov, E. Tolkacheva, S. Uchaikin, E. M. Chapple, C. Enderud, C. Rich, M. Thom, J. Wang, B. Wilson, and G. Rose · 2010
Cited alongside, same era.
Quantum annealing with manufactured spins
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose · 2011
Later among the works it cites.
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
C. C. McGeoch and C. Wang · 2013
Later among the works it cites.
Comment on comparison with classical computers
A. Selby · 2013
Later among the works it cites.
Architectural considerations in the design of a superconducting quantum annealing processor
P. I. Bunyk, E. Hoskinson, M. W. Johnson, E. Tolkacheva, F. Altomare, A. J. Berkley, R. Harris, J. P. Hilton, T. Lanting, and J. Whittaker · 2014
Closest in time.
Where do we stand on benchmarking the D-Wave 2?
Google Quantum Artificial Intelligence Laboratory · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Faster parameterized algorithms for minor containment
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, and Dimitrios M. Thilikos · 2011
Cited alongside, same era.
Defining and detecting quantum speedup
T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer · 2014
Closest in time.