Fetching the paper…
Reading the bibliography…
The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems.
J. A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal 7
1965
Earlier work this paper cites.
J. C. Spall, Multivariate stochastic approximation using a simultaneous perturbation gradient approximation, IEEE Transactions on Automatic Control 37
1992
Earlier work this paper cites.
M. J. D. Powell, A direct search optimization method that models the objective and constraint functions by linear interpolation, in Advances in Optimization and Numerical Analysis , Mathematics and Its Applications, Vol. 275, edited by S. Gomez and J.-P. Hennart (Springer, 1994) pp. 51–67
1994
Earlier work this paper cites.
C. Dürr and P. Høyer, A quantum algorithm for finding the minimum, arXiv:quant-ph/9607014 (1996)
1996
Earlier work this paper cites.
T. Hogg and D. Portnov, Quantum optimization, Information Sciences 128
2000
Earlier work this paper cites.
J. M. Gablonsky and C. T. Kelley, A locally-biased form of the DIRECT algorithm, Journal of Global Optimization 21
2001
Earlier work this paper cites.
M. J. Powell, UOBYQA: Unconstrained optimization by quadratic approximation, Mathematical Programming 92
2002
Earlier work this paper cites.
P. Kaelo and M. Ali, Some variants of the controlled random search algorithm for global optimization, Journal of Optimization Theory and Applications 130
2006
Earlier work this paper cites.
M. J. D. Powell, The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization , Nonconvex Optimization and Its Applications, Vol. 83, edited by G. D. Pillo and M. Roma (Springer, 2006) pp. 255–297
2006
Earlier work this paper cites.
S. G. Johnson, The NLopt nonlinear-optimization package, https://github.com/stevengj/nlopt (2007)
2007
Earlier work this paper cites.
R. D. Somma, S. Boixo, H. Barnum, and E. Knill, Quantum simulations of classical annealing processes, Physical Review Letters 101
2008
Earlier work this paper cites.
P. Wocjan and A. Abeyesinghe, Speedup via quantum sampling, Physical Review A 78
2008
Earlier work this paper cites.
W. Huyer and A. Neumaier, SNOBFIT–Stable noisy optimization by branch and fit, ACM Transactions on Mathematical Software 35
2008
Earlier work this paper cites.
M. J. D. Powell, The BOBYQA algorithm for bound constrained optimization without derivatives , Tech. Rep. NA2009/06 (Department of Applied Mathematics and Theoretical Physics, Cambridge University, Cambridge, UK, 2009)
2009
Earlier work this paper cites.
C. H. da Silva Santos, M. S. Goncalves, and H. E. Hernandez-Figueroa, Designing novel photonic devices by bio-inspired computing, IEEE Photonics Technology Letters 22
2010
Earlier work this paper cites.
C. T. Kelley, Implicit Filtering (SIAM, 2011)
2011
Earlier work this paper cites.
2014
Earlier work this paper cites.
M. J. D. Powell, On fast trust region methods for quadratic models with linear constraints, Mathematical Programming Computation 7
2015
Earlier work this paper cites.
J. Larson and S. C. Billups, Stochastic derivative-free optimization using a trust region framework, Computational Optimization and Applications 64
2016
Earlier work this paper cites.
P. Billingsley, Probability and Measure (John Wiley & Sons, 2017)
2017
Earlier work this paper cites.
A. Montanaro, Quantum-walk speedup of backtracking algorithms, Theory Of Computing 14
2018
Earlier work this paper cites.
R. Chen, M. Menickelly, and K. Scheinberg, Stochastic optimization using a trust-region method and random models, Mathematical Programming 169
2018
Earlier work this paper cites.
S. Shashaani, F. S. Hashemi, and R. Pasupathy, ASTRO-DF: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization, SIAM Journal on Optimization 28
2018
Earlier work this paper cites.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Algorithms 12
2019
Cited alongside, same era.
R. Shaydulin, I. Safro, and J. Larson, Multistart methods for quantum approximate optimization, in High Performance Extreme Computing Conference (IEEE, 2019)
2019
Cited alongside, same era.
J. Larson, M. Menickelly, and S. M. Wild, Derivative-free optimization methods, Acta Numerica 28
2019
Cited alongside, same era.
A. Bärtschi and S. Eidenbenz, Deterministic preparation of Dicke states, in International Symposium on Fundamentals of Computation Theory (Springer, 2019) pp. 126–139
2019
Cited alongside, same era.
C. Cartis, J. Fiala, B. Marteau, and L. Roberts, Improving the flexibility and robustness of model-based derivative-free optimization solvers, ACM Transactions on Mathematical Software (TOMS) 45
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 626
2023
Later among the works it cites.
2023
Later among the works it cites.
M. Menickelly, Y. Ha, and M. Otten, Latency considerations for stochastic optimizers in variational quantum algorithms, Quantum 7
2023
Later among the works it cites.
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
A. Montanaro, Quantum speedup of branch-and-bound algorithms, Physical Review Research 2
2020
Cited alongside, same era.
2020
Cited alongside, same era.
K. J. Sung, J. Yao, M. P. Harrigan, N. C. Rubin, Z. Jiang, L. Lin, R. Babbush, and J. R. McClean, Using models to improve optimizers for variational quantum algorithms, Quantum Science and Technology 5
2020
Cited alongside, same era.
J. M. Kübler, A. Arrasmith, L. Cincio, and P. J. Coles, An adaptive optimizer for measurement-frugal variational algorithms, Quantum 4
2020
Cited alongside, same era.
P. Virtanen, R. Gommers, T. E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, S. J. van der Walt, M. Brett, J. Wilson, K. J. Millman, N. Mayorov, A. R. J. Nelson, E. Jones, R. Kern, E. Larson, C. J. Carey, İ. Polat, Y. Feng, E. W. Moore, J. VanderPlas, D. Laxalde, J. Perktold, R. Cimrman, I. Henriksen, E. A. Quintero, C. R. Harris, A. M. Archibald, A. H. Ribeiro, F. Pedregosa, P. van Mulbregt, and SciPy 1.0 Contributors, SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, Nature Methods 17
2020
Cited alongside, same era.
W. Lavrijsen, A. Tudor, J. Müller, C. Iancu, and W. De Jong, Classical optimizers for noisy intermediate-scale quantum devices, in International Conference on Quantum Computing and Engineering (IEEE, 2020) pp. 267–277
2020
Cited alongside, same era.
2021
Cited alongside, same era.
C. Moussa, M. H. Gordon, M. Baczyk, M. Cerezo, L. Cincio, and P. J. Coles, Resource frugal optimizer for quantum machine learning, Quantum Science and Technology 8
2023
Later among the works it cites.
2023
Later among the works it cites.
M. DeCross, E. Chertkov, M. Kohagen, and M. Foss-Feig, Qubit-reuse compilation with mid-circuit measurement and reset, Physical Review X 13
2023
Later among the works it cites.
Quantinuum H1-1, https://www.quantinuum.com/ , Nov. 10 - Nov. 28, 2023
2023
Later among the works it cites.
D. Lykov, R. Shaydulin, Y. Sun, Y. Alexeev, and M. Pistoia, Fast simulation of high-depth QAOA circuits, in Proceedings of the SC ’23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis , SC-W 2023 (ACM, 2023)
2023
Later among the works it cites.
T. Hao, K. Liu, and S. Tannu, Enabling high performance debugging for variational quantum algorithms using compressed sensing, in Proceedings of the 50th Annual International Symposium on Computer Architecture (Association for Computing Machinery, New York, NY, USA, 2023)
2023
Later among the works it cites.
S. H. Sureshbabu, D. Herman, R. Shaydulin, J. Basso, S. Chakrabarti, Y. Sun, and M. Pistoia, Parameter setting in quantum approximate optimization of weighted problems, Quantum 8
2024
Closest in time.
S. Boulebnane and A. Montanaro, Solving Boolean satisfiability problems with the quantum approximate optimization algorithm, PRX Quantum 5
2024
Closest in time.
R. Shaydulin, C. Li, S. Chakrabarti, M. DeCross, D. Herman, N. Kumar, J. Larson, D. Lykov, P. Minssen, Y. Sun, et al. , Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem, Science Advances 10
2024
Closest in time.
Z. He, B. Peng, Y. Alexeev, and Z. Zhang, Distributionally robust variational quantum algorithms with shifted noise, IEEE Transactions on Quantum Engineering 5
2024
Closest in time.
T. Hao, Z. He, R. Shaydulin, M. Pistoia, and S. Tannu, Variational quantum algorithm landscape reconstruction by low-rank tensor completion, in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) , Vol. 1 (IEEE, 2024) pp. 1184–1190
2024
Closest in time.
G. Scriva, N. Astrakhantsev, S. Pilati, and G. Mazzola, Challenges of variational quantum optimization with measurement shot noise, Phys. Rev. A 109
2024
Closest in time.
2024
Closest in time.
L. Zhu, S. Liang, C. Yang, and X. Li, Optimizing shot assignment in variational quantum eigensolver measurement, Journal of Chemical Theory and Computation 20
2024
Closest in time.
L. Cheng, Y.-Q. Chen, S.-X. Zhang, and S. Zhang, Quantum approximate optimization via learning-based adaptive optimization, Communications Physics 7
2024
Closest in time.
2024
Closest in time.
Quantinuum H2-1, https://www.quantinuum.com/ , Jan. 10 - Jan. 23, 2024
2024
Closest in time.
M. DeCross, R. Haghshenas, M. Liu, Y. Alexeev, C. H. Baldwin, J. P. Bartolotta, M. Bohn, E. Chertkov, J. Colina, D. DelVento, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, C. N. Gilbreth, J. Gray, D. Gresh, N. Hewitt, R. B. Hutson, J. Johansen, D. Lucchetti, D. Lykov, I. S. Madjarov, K. Mayer, M. Mills, P. Niroula, E. Rinaldi, P. E. Siegfried, B. G. Tiemann, C. Volin, J. Walker, R. Shaydulin, M. Pistoia, S. A. Moses, D. Hayes, B. Neyenhuis, R. P. Stutz, and M. Foss-Feig, Computational power of random quantum circuits in arbitrary geometries, Physical Review X 15
2025
Closest in time.