Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing.
Streif M and Leib M 2019 Comparison of QAOA with Quantum and Simulated Annealing arXiv:1901.01903
1901
Earlier work this paper cites.
Melnikov A A, Fedichkin L E and Alodjants A 2019 arXiv:1901.10632
1901
Earlier work this paper cites.
1905
Earlier work this paper cites.
Hastings M B 2019 Classical and Quantum Bounded Depth Approximation Algorithms arXiv:1905.07047
1905
Earlier work this paper cites.
Benedetti M, Lloyd E, Sack S and Fiorentini M 2019 arXiv:1906.07682
1906
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1909
Earlier work this paper cites.
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
1911
Earlier work this paper cites.
Papadimitriou C H and Yannakakis M 1991 Journal of Computer and System Sciences
1991
Earlier work this paper cites.
Goemans M X and Williamson D P 1995 J. ACM
1995
Earlier work this paper cites.
Håstad J 2001 J. ACM
2001
Cited alongside, same era.
Breiman L 2001 Mach. Learn
2001
Cited alongside, same era.
Khot S 2002 On the Power of Unique 2-prover 1-round Games Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing
2002
Cited alongside, same era.
2004
Cited alongside, same era.
Razip H and Zakaria M N 2017 Combining approximation algorithm with genetic algorithm at the initial population for np-complete problem 2017 IEEE 15th Student Conference on Research and Development (SCOReD)
2017
Later among the works it cites.
Dunning I, Gupta S and Silberholz J 2018 INFORMS Journal on Computing
2017
Later among the works it cites.
Ke G, Meng Q, Finley T, Wang T, Chen W, Ma W, Ye Q and Liu T Y 2017 Lightgbm: A highly efficient gradient boosting decision tree Advances in Neural Information Processing Systems 30
2017
Later among the works it cites.
Preskill J 2018 Quantum
2018
Later among the works it cites.
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…
Khot S, Kindler G, Mossel E and O’Donnell R 2007 SIAM J. Comput
2007
Cited alongside, same era.
2009
Cited alongside, same era.
Brodersen K H, Ong C S, Stephan K E and Buhmann J M 2010 The balanced accuracy and its posterior distribution 2010 20th International Conference on Pattern Recognition
2010
Cited alongside, same era.
Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M and Duchesnay E 2011 Journal of Machine Learning Research
2011
Cited alongside, same era.
Farhi E, Goldstone J and Gutmann S 2014 A quantum approximate optimization algorithm arXiv:1411.4028
2014
Cited alongside, same era.
Kotthoff L 2016 Algorithm Selection for Combinatorial Search Problems: A Survey
2016
Cited alongside, same era.
Chen T and Guestrin C 2016 ( Preprint
2016
Cited alongside, same era.
Olson R S, Bartley N, Urbanowicz R J and Moore J H 2016 Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science Proceedings of the Genetic and Evolutionary Computation Conference 2016
2016
Cited alongside, same era.
2018
Later among the works it cites.
Crooks G E 2018 https://arxiv.org/abs/1811.08419
2018
Later among the works it cites.
2018
Later among the works it cites.
Lamata L 2020 Machine Learning: Science and Technology
2020
Closest in time.
Akshay V, Philathong H, Morales M E S and Biamonte J D 2020 Phys. Rev. Lett
2020
Closest in time.
Ge Y and Dunjko V 2020 Journal of Mathematical Physics
2020
Closest in time.
Zhang S, Lu Y, Zhang K, Chen W, Li Y, Zhang J N and Kim K 2020 Nature Communications
2020
Closest in time.
Guerreschi G G and Matsuura A Y 2019 Scientific Reports
2045
Closest in time.