Fetching the paper…
Reading the bibliography…
We present and apply a general-purpose, multi-start algorithm for improving the performance of low-energy samplers used for solving optimization problems.
F. Glover, Tabu search—Part I , ORSA Journal on Computing 1
1989
Earlier work this paper cites.
P. Ray, B. Chakrabarti, and A. Chakrabarti, Sherrington–Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations , Phys. Rev. B 39
1989
Earlier work this paper cites.
F. Glover, Tabu search—Part II , ORSA Journal on computing 2
1990
Earlier work this paper cites.
C. J. Geyer and E. A. Thompson, Constrained monte carlo maximum likelihood for dependent data , Journal of the Royal Statistical Society. Series B (Methodological) pp. 657–699 (1992)
1992
Earlier work this paper cites.
V. Chvátal and B. Reed, in Proceedings, 33rd Annual Symposium on Foundations of Computer Science, 1992 (IEEE, 1992), pp. 620–627
1992
Earlier work this paper cites.
W. F. de La Vega, On random 2-SAT , Unpublished manuscript (1992)
1992
Earlier work this paper cites.
A. E. Eiben, P.-E. Raue, and Z. Ruttkay, in International Conference on Parallel Problem Solving from Nature (Springer, 1994), pp. 78–87
1994
Earlier work this paper cites.
A. Finnila, M. Gomez, C. Sebenik, C. Stenson, and J. Doll, Quantum annealing: A new method for minimizing multidimensional functions , Chem. Phys. Lett. 219
1994
Earlier work this paper cites.
A. E. Eiben, C. H. van Kemenade, and J. N. Kok, in European Conference on Artificial Life (Springer, 1995), pp. 934–945
1995
Earlier work this paper cites.
P. Chardaire, J. L. Lutton, and A. Sutter, Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms , European Journal of Operational Research 86
1995
Earlier work this paper cites.
K. Hukushima and K. Nemoto, Exchange Monte Carlo method and application to spin glass simulations , J. Phys. Soc. Jpn. 65
1996
Earlier work this paper cites.
A. Goerdt, A threshold for unsatisfiability , J. Comput. Syst. Sci. 53
1996
Earlier work this paper cites.
J. Lis and A. E. Eiben, in IEEE International Conference on Evolutionary Computation, 1997 (IEEE, 1997), pp. 59–64
1997
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model , Phys. Rev. E 58
1998
Earlier work this paper cites.
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic ‘phase transitions’ , Nature 400
1999
Earlier work this paper cites.
D. Achlioptas, A. Chtcherba, G. Istrate, and C. Moore, in Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (Society for Industrial and Applied Mathematics, 2001), pp. 721–722
2001
Earlier work this paper cites.
G. E. Santoro, R. Martoňák, E. Tosatti, and R. Car, Theory of quantum annealing of an Ising spin glass , Science 295
2002
Earlier work this paper cites.
R. Martoňák, G. E. Santoro, and E. Tosatti, Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model , Phys. Rev. B 66
2002
Earlier work this paper cites.
M. Mézard and R. Zecchina, The random K-satisfiability problem: from an analytic solution to an efficient algorithm , Phys. Rev. E 66
2002
Earlier work this paper cites.
M. Mézard, G. Parisi, and R. Zecchina, Analytic and algorithmic solution of random satisfiability problems , Science 297
2002
Earlier work this paper cites.
W. Zhang, Configuration landscape analysis and backbone guided local search.: Part I: Satisfiability and maximum satisfiability , Artificial Intelligence 158
2004
Earlier work this paper cites.
C.-K. Ting, in European Conference on Artificial Life (Springer, 2005), pp. 403–412
2005
Cited alongside, same era.
D. A. Battaglia, G. E. Santoro, and E. Tosatti, Optimization by quantum annealing: Lessons from hard satisfiability problems , Phys. Rev. E 71
2005
Cited alongside, same era.
S. Mertens, M. Mézard, and R. Zecchina, Threshold values of random K-SAT from the cavity method , Random Structures & Algorithms 28
2006
Cited alongside, same era.
V. Choi, Minor-embedding in adiabatic quantum computation: I. the parameter setting problem , Quantum Information Processing 7
2008
Cited alongside, same era.
H. G. Katzgraber, Introduction to Monte Carlo methods , arXiv:0905.1629 (2009)
2009
Cited alongside, same era.
H. G. Katzgraber, F. Hamze, Z. Zhu, A. J. Ochoa, and H. Munoz-Bauza, Seeking quantum speedup through spin glasses: The good, the bad, and the ugly , Phys. Rev. X 5
2015
Later among the works it cites.
S. V. Isakov, I. N. Zintchenko, T. F. Rønnow, and M. Troyer, Optimised simulated annealing for Ising spin glasses , Computer Physics Communications 192
2015
Later among the works it cites.
Z. Zhu, A. J. Ochoa, and H. G. Katzgraber, Efficient cluster algorithm for spin glasses in any space dimension , Phys. Rev. Lett. 115
2015
Later among the works it cites.
C. Luo, S. Cai, W. Wu, Z. Jie, and K. Su, CCLS: An efficient local search algorithm for weighted maximum satisfiability , IEEE Trans. Comput. 64
2015
Later among the works it cites.
A. Abramé and D. Habet, Ahmaxsat: Description and evaluation of a branch and bound max-sat solver , Journal on Satisfiability, Boolean Modeling and Computation 9
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Matsuda, H. Nishimori, and H. G. Katzgraber, Ground-state statistics from annealing algorithms: Quantum versus classical approaches , New J. Phys. 11
2009
Cited alongside, same era.
Y. Wang, Z. Lü, F. Glover, and J.-K. Hao, Effective variable fixing and scoring strategies for binary quadratic programming , in Evolutionary Computation in Combinatorial Optimization (Springer, 2011), pp. 72–83
2011
Cited alongside, same era.
M. Johnson, M. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. Berkley, J. Johansson, P. Bunyk, et al., Quantum annealing with manufactured spins , Nature 473
2011
Cited alongside, same era.
V. Choi, Minor-embedding in adiabatic quantum computation: Ii. minor-universal graph design , Quantum Information Processing 10
2011
Cited alongside, same era.
Y. Wang, Z. Lü, F. Glover, and J.-K. Hao, Backbone guided tabu search for solving the ubqp problem , Journal of Heuristics 19
2013
Cited alongside, same era.
C. C. McGeoch and C. Wang, in Proceedings of the ACM International Conference on Computing Frontiers (ACM, 2013), p. 23
2013
Cited alongside, same era.
A. Selby, QUBO-Chimera , https://github.com/alex1770/QUBO-Chimera (2013)
2013
Cited alongside, same era.
2015
Later among the works it cites.
A. Perdomo-Ortiz, J. Fluegemann, S. Narasimhan, R. Biswas, and V. N. Smelyanskiy, A quantum annealing approach for fault detection and diagnosis of graph-based systems , Eur. Phys. J. Special Topics 224
2015
Later among the works it cites.
W. Vinci, T. Albash, G. Paz-Silva, I. Hen, and D. A. Lidar, Quantum annealing correction with minor embedding , Phys. Rev. A 92
2015
Later among the works it cites.
S. Muthukrishnan, T. Albash, and D. A. Lidar, Tunneling and speedup in quantum optimization for permutation-symmetric problems , Phys. Rev. X 6
2016
Later among the works it cites.
V. S. Denchev, S. Boixo, S. V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven, What is the computational value of finite-range tunneling? , Phys. Rev. X 6
2016
Later among the works it cites.
S. Mandrà, Z. Zhu, W. Wang, A. Perdomo-Ortiz, and H. G. Katzgraber, Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches , Phys. Rev. A 94
2016
Later among the works it cites.
2016
Later among the works it cites.
S. Boixo, V. N. Smelyanskiy, A. Shabani, S. V. Isakov, M. Dykman, V. S. Denchev, M. H. Amin, A. Y. Smirnov, M. Mohseni, and H. Neven, Computational multiqubit tunnelling in programmable quantum annealers , Nat. Commun. 7
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Closest in time.
S. Mandrá, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: Raising the bar for quantum annealers (again) , Quantum Science and Technology 2
2017
Closest in time.
H. Karimi and G. Rosenberg, Boosting quantum annealer performance via sample persistence , Quantum Information Processing 16
2017
Closest in time.
W. Wang, S. Mandrá, and H. G. Katzgraber, Patch-planting spin-glass solution for benchmarking , Phys. Rev. E 96
2017
Closest in time.
2017
Closest in time.
A. Zaribafiyan, D. J. Marchand, and S. S. C. Rezaei, Systematic and deterministic graph minor embedding for cartesian products of graphs , Quantum Information Processing 16
2017
Closest in time.
S. Mandrà, Z. Zhu, and H. G. Katzgraber, Exponentially biased ground-state sampling of quantum annealing machines with transverse-field driving Hamiltonians , Phys. Rev. Lett. 118
2017
Closest in time.
Note2, The chip at our disposal has 2023 active qubits, a working temperature of 14 ± \pm 1 mK, and a minimum annealing time of 5 μ \mu s
2023
Closest in time.