Fetching the paper…
Reading the bibliography…
Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quantum computers for practical applications.
J. A. Nelder and R. Mead, “A simplex method for function minimization,” The Computer Journal , vol. 7, no. 4, pp. 308–313, 1965
1965
Earlier work this paper cites.
A. H. G. Rinnooy Kan and G. T. Timmer, “Stochastic global optimization methods, part I: Clustering methods,” Mathematical Programming , vol. 39, no. 1, pp. 27–56, 1987
1987
Earlier work this paper cites.
——, “Stochastic global optimization methods, part II: Multi level methods,” Mathematical Programming , vol. 39, no. 1, pp. 57–78, 1987
1987
Earlier work this paper cites.
T. H. Rowan, “Functional stability analysis of numerical algorithms.” Ph.D. dissertation, University of Texas at Austin, 1990
1990
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science . IEEE, 1994, pp. 124–134
1994
Earlier work this paper cites.
M. J. Powell, “A direct search optimization method that models the objective and constraint functions by linear interpolation,” in Advances in Optimization and Numerical Analysis . Springer, 1994, pp. 51–67
1994
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 , vol. 42, no. 6, pp. 1115–1145, 1995
1995
Earlier work this paper cites.
F. R. Chung and F. C. Graham, Spectral graph theory . American Mathematical Soc., 1997, no. 92
1997
Earlier work this paper cites.
M. Powell, “Direct search algorithms for optimization calculations,” Acta Numerica , vol. 7, pp. 287–336, 1998
1998
Earlier work this paper cites.
D. J. Watts, “Networks, dynamics, and the small-world phenomenon,” American Journal of Sociology , vol. 105, no. 2, pp. 493–527, 1999
1999
Earlier work this paper cites.
G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature , vol. 435, no. 7043, p. 814, 2005
2005
Earlier work this paper cites.
M. E. J. Newman, “From the cover: Modularity and community structure in networks,” Proceedings of the National Academy of Science , vol. 103, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer et al. , “Maximizing modularity is hard,” arXiv:physics/0608255 , 2006
2006
Earlier work this paper cites.
M. J. D. Powell, “The NEWUOA software for unconstrained optimization without derivatives,” in Large-scale Nonlinear Optimization . Springer, 2006, pp. 255–297
2006
Earlier work this paper cites.
A. A. Hagberg, D. A. Schult, and P. J. Swart, “Exploring network structure, dynamics, and function using NetworkX,” in Proceedings of the 7th Python in Science Conference (SciPy 2008) , G. Varoquaux, T. Vaught, and J. Millman, Eds., Pasadena, CA USA, 2008, pp. 11–15
2008
Earlier work this paper cites.
M. J. D. Powell, “The BOBYQA algorithm for bound constrained optimization without derivatives,” University of Cambridge, Tech. Rep. DAMTP 2009/NA06, 2009. [Online]. Available: http://www.damtp.cam.ac.uk/user/na/NA_papers/NA2009_06.pdf
2009
Earlier work this paper cites.
M. J. Powell, “The BOBYQA algorithm for bound constrained optimization without derivatives,” Cambridge NA Report NA2009/06, University of Cambridge, Cambridge , pp. 26–46, 2009
2009
Earlier work this paper cites.
G. Su, A. Kuchinsky, J. H. Morris, D. J. States, and F. Meng, “GLay: community structure analysis of biological networks,” Bioinformatics , vol. 26, no. 24, pp. 3135–3137, 2010
2010
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics Reports , vol. 486, no. 3-5, pp. 75–174, 2010
2010
Earlier work this paper cites.
R. R. Nadakuditi and M. E. Newman, “Graph spectra and the detectability of community structure in networks,” Physical Review Letters , vol. 108, no. 18, p. 188701, 2012
2012
Earlier work this paper cites.
R. P. Brent, Algorithms for minimization without derivatives . Courier Corporation, 2013
2013
Earlier work this paper cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank et al. , “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature , vol. 508, no. 7497, p. 500, 2014
2014
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou et al. , “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications , vol. 5, p. 4213, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2018
Later among the works it cites.
——, “Asynchronously parallel optimization solver for finding multiple minima,” Mathematical Programming Computation , vol. 10, no. 3, pp. 303–332, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for maxcut: A fermionic view,” Physical Review A , vol. 97, p. 022304, 2018
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
C. Ballance, T. Harty, N. Linke, M. Sepiol, and D. Lucas, “High-fidelity quantum logic gates using trapped-ion hyperfine qubits,” Physical Review Letters , vol. 117, no. 6, p. 060504, 2016
2016
Cited alongside, same era.
J. Larson and S. M. Wild, “A batch, derivative-free algorithm for finding multiple local minima,” Optimization and Engineering , vol. 17, no. 1, pp. 205–228, 2016
2016
Cited alongside, same era.
G. Bardella, A. Bifone, A. Gabrielli, A. Gozzi, and T. Squartini, “Hierarchical organization of functional connectivity in the mouse brain: A complex network approach,” Scientific Reports , vol. 6, p. 32060, 2016
2016
Cited alongside, same era.
D. Wecker, M. B. Hastings, and M. Troyer, “Training a quantum optimizer,” Physical Review A , vol. 94, no. 2, p. 022309, 2016
2016
Cited alongside, same era.
J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics , vol. 18, no. 2, p. 023023, 2016
2016
Cited alongside, same era.
M. Roetteler, M. Naehrig, K. M. Svore, and K. Lauter, “Quantum resource estimates for computing elliptic curve discrete logarithms,” in International Conference on the Theory and Application of Cryptology and Information Security . Springer, 2017, pp. 241–270
2017
Cited alongside, same era.
H. Ushijima-Mwesigwa, C. F. Negre, and S. M. Mniszewski, “Graph partitioning using quantum annealing on the D-Wave system,” in Proceedings of the Second International Workshop on Post Moore’s Era Supercomputing . ACM, 2017, pp. 22–29
2017
Cited alongside, same era.
2018
Later among the works it cites.
J. Romero, R. Babbush, J. McClean, C. Hempel, P. Love, and A. Aspuru-Guzik, “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,” Quantum Science and Technology , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Closest in time.
S. G. Johnson, “The NLopt nonlinear-optimization package,” 2019. [Online]. Available: http://github.com/stevengj/nlopt
2019
Closest in time.
O. D. Parekh, C. Ryan-Anderson, and S. Gharibian, “Quantum optimization and approximation algorithms.” Tech. Rep., 2019. [Online]. Available: https://doi.org/10.2172%2F1492737
2019
Closest in time.
G. G. Guerreschi and A. Y. Matsuura, “QAOA for max-cut requires hundreds of qubits for quantum speed-up,” Scientific Reports , vol. 9, no. 1, May 2019. [Online]. Available: https://doi.org/10.1038/s41598-019-43176-9
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
Rigetti, “Grove,” 2019. [Online]. Available: https://github.com/rigetti/grove
2019
Closest in time.
G. Aleksandrowicz, T. Alexander, P. Barkoutsos, L. Bello, Y. Ben-Haim et al. , “Qiskit: An open-source framework for quantum computing,” 2019
2019
Closest in time.
S. Hudson, J. Larson, S. M. Wild, and D. Bindel, “libEnsemble users manual,” 2019. [Online]. Available: https://buildmedia.readthedocs.org/media/pdf/libensemble/latest/libensemble.pdf
2019
Closest in time.
E. Anschuetz, J. Olson, A. Aspuru-Guzik, and Y. Cao, “Variational quantum factoring,” in International Workshop on Quantum Technology and Optimization Problems . Springer, 2019, pp. 74–85
2019
Closest in time.