Fetching the paper…
Reading the bibliography…
Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum algorithms for the Noisy Intermediate-Scale Quantum (NISQ) era.
P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci , vol. 5, no. 1, pp. 17–60, 1960
1960
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations . Springer, 1972, pp. 85–103
1972
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.
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. 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.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
——, “Community detection across emerging quantum architectures,” Proceedings of the 3rd International Workshop on Post Moore’s Era Supercomputing , 2018
2018
Earlier work this paper cites.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
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
Cited alongside, same era.
G. Rinaldi, “The Max-Cut problem: Challenges from quantum computing,” Presented at the Séminaire du Group POC LIP6 de Sorbonne Université́, Oct 2018
2018
Cited alongside, same era.
O. Tange, GNU Parallel 2018 . Ole Tange, Mar. 2018. [Online]. Available: https://doi.org/10.5281/zenodo.1146014
2019
Closest in time.
G. Nannicini, “Performance of hybrid quantum-classical variational heuristics for combinatorial optimization,” Physical Review E , vol. 99, no. 1, Jan. 2019. [Online]. Available: https://doi.org/10.1103/physreve.99.013304
2019
Closest in time.
S. G. Johnson, “The NLopt nonlinear-optimization package,” 2019. [Online]. Available: http://github.com/stevengj/nlopt
2019
Closest in time.
R. Shaydulin, I. Safro, and J. Larson, “Multistart methods for quantum approximate optimization,” 2019 IEEE High Performance Extreme Computing Conference (HPEC) , 2019
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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
2018
Cited alongside, same era.
R. Shaydulin, H. Ushijima-Mwesigwa, I. Safro, S. Mniszewski, and Y. Alexeev, “Network community detection on small quantum computers,” Advanced Quantum Technologies , p. 1900029, Jun. 2019. [Online]. Available: https://doi.org/10.1002/qute.201900029
2019
Cited alongside, same era.
2019
Cited alongside, same era.
“Erdős-rényi random graph generator – NetworkX.” [Online]. Available: https://networkx.github.io/documentation/stable/reference/generated/networkx.generators.random_graphs.erdos_renyi_graph.html#networkx.generators.random_graphs.erdos_renyi_graph
Cited in the paper.
2019
Closest in time.
S. Khairy, R. Shaydulin, L. Cincio, Y. Alexeev, and P. Balaprakash, “Reinforcement-learning-based variational quantum circuits optimization for combinatorial problems,” Accepted for Poster Presentation at the Machine Learning and the Physical Sciences workshop at Conference on Neural Information Processing Systems (NeurIPS 2019), 2019
2019
Closest in time.
——, “Reinforcement learning for quantum approximate optimization,” Research Poster, accepted at Supercomputing ’19, 2019
2019
Closest in time.