Fetching the paper…
Reading the bibliography…
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques.
A linear time heuristic for improving network partitions
Fiduccia, C. and Mattheyses, R. (1982) · 1982
Earlier work this paper cites.
Optimization by simulated annealing
Kirkpatrick, S., Gelatt Jr, C., and Vecchi, M. (1983) · 1983
Earlier work this paper cites.
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images
Geman, S. and Geman, D. (1984) · 1984
Earlier work this paper cites.
Finding a maximum clique in an arbitrary graph
Balas, E. and Yu, C. (1986) · 1986
Earlier work this paper cites.
Quantum annealing in the transverse ising model
Kadowaki, T. and Nishimori, H. (1998) · 1998
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
Karypis, G. and Kumar, V. (1999) · 1999
Earlier work this paper cites.
Finding cliques by quantum adiabatic evolution
Childs, A. M., Farhi, E., Goldstone, J., and Gutmann, S. (2000) · 2000
Earlier work this paper cites.
Sequential monte carlo samplers
Del Moral, P., Doucet, A., and Jasra, A. (2006) · 2006
Cited alongside, same era.
A simple simulated annealing algorithm for the maximum clique problem
Geng, X., Xu, J., Xiao, J., and Pan, L. (2007) · 2007
Cited alongside, same era.
Quantum annealing with manufactured spins
Johnson, M., Amin, M., Gildert, S., Lanting, T. Hamze, F., Dickson, N., Harris, R., Berkley, A., Johansson, J., Bunyk, P., Chapple, E., Enderud, C., Hilton, J., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M., Tolkacheva, E., Truncik, C., Uchaikin, S., Wang, J., B., W., and Rose, G. (2011) · 2011
Cited alongside, same era.
Fast algorithms for the maximum clique problem on massive sparse graphs
Pattabiraman, B., Patwary, M. M. A., Gebremedhin, A. H., Liao, W.-k., and Choudhary, A. (2013) · 2013
Cited alongside, same era.
Architectural considerations in the design of a superconducting quantum annealing processor
Bunyk, P., Hoskinson, E., Johnson, M., Tolkacheva, E., Altomare, F., Berkley, A., Harris, R., Hilton, J., Lanting, T., Przybysz, A., and Whittaker, J. (2014) · 2014
Cited alongside, same era.
Defining and detecting quantum speedup
Rønnow, T.F. Wang, Z., Job, J., Boixo, S., Isakov, S., Wecker, D., Martinis, J., Lidar, D., and Troyer, M. (2014) · 2014
Later among the works it cites.
Recent advances in graph partitioning
Buluc, A., Meyerhenke, H., Safro, I., Sanders, P., and Schulz, C. (2015) · 2015
Later among the works it cites.
Gurobi optimizer reference manual
Gurobi Optimization, I. (2015) · 2015
Later among the works it cites.
Benchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M., Hilton, J., and McGeoch, C. (2015) · 2015
Later among the works it cites.
What is the computational value of finite-range tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., and Neven, H. (2016) · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ising formulations of many np problems
Lucas, A. (2014) · 2014
Cited alongside, same era.
D-wave developer guide
D-Wave Sys, I. (2016a)
Cited in the paper.
D-wave post-processing guide
D-Wave Sys, I. (2016b)
Cited in the paper.
Introduction to the d-wave quantum hardware
D-Wave Sys, I. (2016c)
Cited in the paper.
Later among the works it cites.
Graph partitioning methods for fast parallel quantum molecular dynamics
Djidjev, H., Hahn, G., Mniszewski, S., Negre, C., Niklasson, A., and Sardeshmukh, V. (2016) · 2016
Later among the works it cites.