Fetching the paper…
Reading the bibliography…
The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently.
E. Ising, “Beitrag zur Theorie des Ferromagnetismus,” Zeitschrift für Physik A Hadrons and Nuclei
1925
Earlier work this paper cites.
M. Born and V. Fock, “Beweis des Adiabatensatzes,” Zeitschrift für Physik
1928
Earlier work this paper cites.
R. Peierls, “On a minimum property of the free energy,” Physical Review
1938
Earlier work this paper cites.
L. Onsager, “Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition,” Phys. Rev
1944
Earlier work this paper cites.
T. Kato, “On the Adiabatic Theorem of Quantum Mechanics,” Journal of the Physical Society of Japan
1950
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of computer computations
1972
Earlier work this paper cites.
Academic Press, 1982
R. Baxter, Exactly Solved Models in Statistical Mechanics · 1982
Earlier work this paper cites.
F. Barahona, “On the computational complexity of Ising spin glass models,” Journal of Physics A: Mathematical and General
1982
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” science
1983
Earlier work this paper cites.
V. Černý, “Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm,” Journal of Optimization Theory and Applications
1985
Earlier work this paper cites.
World Scientific Publishing Company, 1987
M. Mézard, G. Parisi, and M. Virasoro, Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications · 1987
Earlier work this paper cites.
G. Bilbro, R. Mann, T. Miller, W. Snyder, D. van den Bout, and M. White, “Optimization by mean field annealing,” Advances in neural information processing systems
1988
Earlier work this paper cites.
M. Padberg and G. Rinaldi, “A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems,” SIAM review
1991
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of the ACM (JACM)
1995
Earlier work this paper cites.
S. Poljak and F. Rendl, “Solving the max-cut problem using eigenvalues,” Discrete Applied Mathematics
1995
Cited alongside, same era.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv preprint quant-ph/0001106
2000
Cited alongside, same era.
C. Helmberg and F. Rendl, “A spectral bundle method for semidefinite programming,” SIAM Journal on Optimization
2000
Cited alongside, same era.
MIT press, 2001
M. Opper and D. Saad, Advanced mean field methods: Theory and practice · 2001
Cited alongside, same era.
J. Roland and N. J. Cerf, “Quantum search by local adiabatic evolution,” Physical Review A
2002
Cited alongside, same era.
P. Festa, P. M. Pardalos, M. G. Resende, and C. C. Ribeiro, “Randomized heuristics for the MAX-CUT problem,” Optimization methods and software
S. V. Isakov, I. N. Zintchenko, T. F. Rønnow, and M. Troyer, “Optimised simulated annealing for Ising spin glasses,” Computer Physics Communications
2015
Later among the works it cites.
2015
Later among the works it cites.
T. Inagaki, Y. Haribara, K. Igarashi, T. Sonobe, S. Tamate, T. Honjo, A. Marandi, P. L. McMahon, T. Umeki, K. Enbutsu, et al
2016
Later among the works it cites.
Y. Haribara, S. Utsunomiya, and Y. Yamamoto, “A coherent Ising machine for MAX-CUT problems: performance evaluation against semidefinite programming and simulated annealing,” in Principles and Methods of Quantum Information Technologies
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
M. Steffen, W. van Dam, T. Hogg, G. Breyta, and I. Chuang, “Experimental implementation of an adiabatic quantum optimization algorithm,” Physical Review Letters
2003
Cited alongside, same era.
Springer Science & Business Media, 2007
J. Sólyom, Fundamentals of the Physics of Solids: Volume 1: Structure and Dynamics · 2007
Cited alongside, same era.
F. Rendl, G. Rinaldi, and A. Wiegele, “A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations,” in International Conference on Integer Programming and Combinatorial Optimization
2007
Cited alongside, same era.
F. Glover, Z. Lü, and J.-K. Hao, “Diversification-driven tabu search for unconstrained binary quadratic problems,” 4OR
2010
Cited alongside, same era.
F. Rendl, G. Rinaldi, and A. Wiegele, “Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations,” Mathematical Programming
2010
Cited alongside, same era.
M. W. Johnson, M. H. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al
2011
Cited alongside, same era.
T. Leleu, Y. Yamamoto, S. Utsunomiya, and K. Aihara, “Combinatorial optimization using dynamical phase transitions in driven-dissipative systems,” Physical Review E
2017
Later among the works it cites.
F. Ma and J.-K. Hao, “A multiple search operator heuristic for the max-k-cut problem,” Annals of Operations Research
2017
Later among the works it cites.
R. Harris, Y. Sato, A. Berkley, M. Reis, F. Altomare, M. Amin, K. Boothby, P. Bunyk, C. Deng, C. Enderud, et al
2018
Later among the works it cites.
Cambridge University Press, 2018
D. J. Griffiths and D. F. Schroeter, Introduction to quantum mechanics · 2018
Later among the works it cites.
2018
Later among the works it cites.
R. Hamerly, T. Inagaki, P. L. McMahon, D. Venturelli, A. Marandi, T. Onodera, E. Ng, C. Langrock, K. Inaba, T. Honjo, et al
2019
Later among the works it cites.
H. Goto, K. Tatsumura, and A. R. Dixon, “Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems,” Science advances
2019
Later among the works it cites.
T. Wang, L. Wu, and J. Roychowdhury, “New computational results and hardware prototypes for oscillator-based Ising machines,” in Proceedings of the 56th Annual Design Automation Conference 2019
2019
Later among the works it cites.
Y. Matsuda, “Benchmarking the MAX-CUT problem on the Simulated Bifurcation Machine,” Dec 2019
2019
Later among the works it cites.