Fetching the paper…
Reading the bibliography…
We consider some classical and quantum approximate optimization algorithms with bounded depth.
E. Aarts and J. Korst, Simulated annealing and Boltzmann machines (New York, NY; John Wiley and Sons Inc., 1988)
1988
Earlier work this paper cites.
S. R. White, Physical Review Letters 69
1992
Earlier work this paper cites.
G. Vidal, J. I. Latorre, E. Rico, and A. Kitaev, Physical Review Letters 90
2003
Earlier work this paper cites.
M. B. Hastings, Journal of Statistical Mechanics: Theory and Experiment 2007
2007
Earlier work this paper cites.
B. Pirvu, V. Murg, J. I. Cirac, and F. Verstraete, New Journal of Physics 12
2010
Earlier work this paper cites.
J. Suomela, ACM Computing Surveys (CSUR) 45
2013
Cited alongside, same era.
J. Hirvonen, J. Rybicki, S. Schmid, and J. Suomela, arXiv preprint arXiv:1402.2543 (2014)
2014
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, arXiv preprint arXiv:1412.6062 (2014)
2014
Cited alongside, same era.
R. O’Donnell, Analysis of boolean functions (Cambridge University Press, 2014)
2014
Cited alongside, same era.
2015
Later among the works it cites.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, Physical Review A 97
2018
Later among the works it cites.
C. Ryan-Anderson, arXiv preprint arXiv:1812.04735 (2018)
2018
Later among the works it cites.
M. B. Hastings, arXiv:1904.13339 (2019)
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…