QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth

Sashank J. Reddi, Satyen Kale and Sanjiv Kumar, “On the Convergence of ADAM and Beyond" (2018) arXiv:1904.09237

Original

1904

Earlier work this paper cites.

Magnus R. Hestenes and Eduard Stiefel, “Methods of Conjugate Gradients for Solving Linear Systems," Journal of Research of the National Bureau of Standards, Vol. 49, No. 6 (1952)

1952

Earlier work this paper cites.

M. J. D. Powell, “An efficient method for finding the minimum of a function of several variables without calculating derivatives," Computer Journal, Vol. 7, Iss. 2, Pp. 155–162 (1964)

1964

Earlier work this paper cites.

J. A. Nelder and R. Mead, “A simplex method for function minimization," The Computer Journal, Vol. 7, Iss. 4, Pp. 308–313 (1965)

1965

Earlier work this paper cites.

R. Fletcher, “A new approach to variable metric algorithms," The Computer Journal, Vol. 13, Iss. 3, Pp 317–322 (1970)

1970

Earlier work this paper cites.

J. C. Spall. “Multivariate Stochastic Approximation Using a Simultaneous Perturbation Gradient Approximation," IEEE Transactions on Automatic Control, Vol. 37, No. 3, Pp. 332–341, (1992)

1992

Earlier work this paper cites.

Shor, Peter W., “Algorithms for quantum computation: discrete logarithms and factoring," In Proceedings 35th annual symposium on foundations of computer science, Ieee, Pp. 124-134 (1994)

1994

Earlier work this paper cites.

M. J. D. Powell, “A direct search optimization method that models the objective and constraint functions by linear interpolation," Advances in Optimization and Numerical Analysis, Pp. 51-67 (1994)

1994

Earlier work this paper cites.

Richard H. Byrd, Peihuang Lu, Jorge Nocedal and Ciyou Zhu, “A Limited Memory Algorithm for Bound Constrained Optimization," SIAM Journal on Scientific Computing, Vol. 16, Pp. 1190-1208 (1995)

1995

Cited alongside, same era.

Grover, L. K., “A fast quantum mechanical algorithm for database search," In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, Pp. 212-219 (1996)

1996

Cited alongside, same era.

Paul T. Boggs, Jon W. Tolle, “Sequential Quadratic Programming," Acta Numerica, Vol. 4, Pp 1-51 (1996)

1996

Cited alongside, same era.

Nielsen, M. A., and Chuang I., “Quantum computation and quantum information," (2002)

2002

Cited alongside, same era.

Peruzzo A, et al. “A variational eigenvalue solver on a photonic quantum processor," Nature communications, Vol. 5, Iss. 1, Pp. 4213 (2014)

2014

Cited alongside, same era.

Grimsley, H.R., Economou, S.E., Barnes, E. et al. “An adaptive variational algorithm for exact molecular simulations on a quantum computer", Nat Commun 10, 3007 (2019)

2019

Later among the works it cites.

Zhou, L., Wang, S. T., Choi, S., Pichler, H., and Lukin, M. D., “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices," Physical Review X, Vol. 10, Iss. 2, Pp. 021067 (2020)

2020

Later among the works it cites.

Pellow-Jarman, A, et al., “A comparison of various classical optimizers for a variational quantum linear solver," Quantum Information Processing, Vol. 20, Iss. 6, Pp. 202 (2021)

2021

Later among the works it cites.

Pelofske, E., Hahn, G. and Djidjev, H., “Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer", Journal of Signal Processing Systems, Vol. 93, Pp 405-420 (2021)

2021

Later among the works it cites.