Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems.
1905
Earlier work this paper cites.
1910
Earlier work this paper cites.
Landau and L. D., “Zur Theorie der Energieubertragung II,” Z. Sowjetunion 2
1932
Earlier work this paper cites.
C. Zener, “Non-Adiabatic Crossing of Energy Levels,” Proc. R. Soc. London, Ser. A 137
1932
Earlier work this paper cites.
J A Nelder and R Mead, “A Simplex Method for Function Minimization,” The Computer Journal 7
1965
Earlier work this paper cites.
E. Cuthill and J. McKee, “Reducing the bandwidth of sparse symmetric matrices,” in Proceedings of the 1969 24th National Conference , ACM ’69 (ACM, New York, NY, USA, 1969) pp. 157–172
1969
Earlier work this paper cites.
C. G. Broyden, “The convergence of a class of double-rank minimization algorithms 1. general considerations,” IMA Journal of Applied Mathematics 6
1970
Earlier work this paper cites.
R. Fletcher, “A new approach to variable metric algorithms,” The Computer Journal 13
1970
Earlier work this paper cites.
Donald Goldfarb, “A family of variable-metric methods derived by variational means,” Mathematics of Computation 24
1970
Earlier work this paper cites.
D. F. Shanno, “Conditioning of quasi-Newton methods for function minimization,” Mathematics of Computation 24
1970
Earlier work this paper cites.
Michel X. Goemans and David P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM 42
1995
Earlier work this paper cites.
Christos H Papadimitriou and Kenneth Steiglitz, Combinatorial optimization: algorithms and complexity (Courier Corporation, 1998)
1998
Earlier work this paper cites.
Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse ising model,” Phys. Rev. E 58
1998
Earlier work this paper cites.
Pankaj K Agarwal, Marc van Kreveld, and Subhash Suri, “Label placement by maximum independent set in rectangles,” Computational Geometry 11
1998
Earlier work this paper cites.
Roger B. Sidje, “Expokit: A software package for computing matrix exponentials,” ACM Trans. Math. Softw. 24
1998
Earlier work this paper cites.
Piotr Berman and Marek Karpinski, “On Some Tighter Inapproximability Results (Extended Abstract),” (Springer, Berlin, Heidelberg, 1999) pp. 200–209
1999
Earlier work this paper cites.
Johan Håstad, “Some optimal inapproximability results,” J. ACM 48
2001
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda, “A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem,” Science 292
2001
Earlier work this paper cites.
C. Moler and C. Van Loan, “Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later,” SIAM Review 45
2003
Earlier work this paper cites.
Eran Halperin, Dror Livnat, and Uri Zwick, “MAX CUT in cubic graphs,” Journal of Algorithms 53
2004
Earlier work this paper cites.
Navin Khaneja, Timo Reiss, Cindie Kehlet, Thomas Schulte-Herbrüggen, and Steffen J. Glaser, “Optimal control of coupled spin dynamics: design of nmr pulse sequences by gradient ascent algorithms,” Journal of Magnetic Resonance 172
2005
Earlier work this paper cites.
Josep Díaz and Marcin Kamiński, “Max-cut and max-bisection are np-hard on unit disk graphs,” Theoretical Computer Science 377
2007
Earlier work this paper cites.
Franz Rendl, Giovanni Rinaldi, and Angelika Wiegele, “Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations,” Mathematical Programming 121
2008
Earlier work this paper cites.
H. Häffner, C.F. Roos, and R. Blatt, “Quantum computing with trapped ions,” Physics Reports 469
2008
Cited alongside, same era.
Alireza Vahdatpour, Foad Dabiri, Maryam Moazeni, and Majid Sarrafzadeh, “Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks,” in Distributed Computing (Springer, Berlin, Heidelberg, Berlin, Heidelberg, 2008) pp. 481–495
2008
Cited alongside, same era.
M. Saffman, T. G. Walker, and K. Mølmer, “Quantum information with rydberg atoms,” Rev. Mod. Phys. 82
2010
Cited alongside, same era.
Lan Lin and Yixun Lin, “Square-root rule of two-dimensional bandwidth problem,” RAIRO - Theoretical Informatics and Applications 45
2011
Cited alongside, same era.
L. Isenhower, M. Saffman, and K. Mølmer, “Multibit C k NOT quantum gates via Rydberg blockade,” Quantum Information Processing 10
2011
Layla Hormozi, Ethan W. Brown, Giuseppe Carleo, and Matthias Troyer, “Nonstoquastic hamiltonians and quantum annealing of an ising spin glass,” Phys. Rev. B 95
2017
Later among the works it cites.
Hannes Bernien, Sylvain Schwartz, Alexander Keesling, Harry Levine, Ahmed Omran, Hannes Pichler, Soonwon Choi, Alexander S. Zibrov, Manuel Endres, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin, “Probing many-body dynamics on a 51-atom quantum simulator,” Nature 551
2017
Later among the works it cites.
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon, “Optimizing variational quantum algorithms using pontryagin’s minimum principle,” Phys. Rev. X 7
2017
Later among the works it cites.
Zhang Jiang, Eleanor G. Rieffel, and Zhihui Wang, “Near-optimal quantum circuit for grover’s unstructured search using a transverse field,” Phys. Rev. A 95
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Awad H Al-Mohy and Nicholas J Higham, “Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators,” SIAM Journal on Scientific Computing 33
2011
Cited alongside, same era.
Bernhard Korte, Jens Vygen, B Korte, and J Vygen, Combinatorial optimization , Vol. 2 (Springer, 2012)
2012
Cited alongside, same era.
Una Benlic and Jin-Kao Hao, “Breakout local search for the max-cutproblem,” Engineering Applications of Artificial Intelligence 26
2013
Cited alongside, same era.
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications 5
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer, “Evidence for quantum annealing with more than one hundred qubits,” Nature Physics 10
2014
Cited alongside, same era.
Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, “Defining and detecting quantum speedup,” Science 345
2014
Cited alongside, same era.
2017
Later among the works it cites.
J. Zhang, G. Pagano, P. W. Hess, A. Kyprianidis, P. Becker, H. Kaplan, A. V. Gorshkov, Z. X. Gong, and C. Monroe, “Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator,” Nature 551
2017
Later among the works it cites.
John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2
2018
Closest in time.
Nikolaj Moll, Panagiotis Barkoutsos, Lev S Bishop, Jerry M Chow, Andrew Cross, Daniel J Egger, Stefan Filipp, Andreas Fuhrer, Jay M Gambetta, Marc Ganzhorn, Abhinav Kandala, Antonio Mezzacapo, Peter Müller, Walter Riess, Gian Salis, John Smolin, Ivano Tavernelli, and Kristan Temme, “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology 3
2018
Closest in time.
2018
Closest in time.
Xiaogang Qiang, Xiaoqi Zhou, Jianwei Wang, Callum M. Wilkes, Thomas Loke, Sean O’Gara, Laurent Kling, Graham D. Marshall, Raffaele Santagati, Timothy C. Ralph, Jingbo B. Wang, Jeremy L. O’Brien, Mark G. Thompson, and Jonathan C. F. Matthews, “Large-scale silicon quantum photonics implementing arbitrary two-qubit processing,” Nature Photonics 12
2018
Closest in time.
Jarrod R. McClean, Sergio Boixo, Vadim N. Smelyanskiy, Ryan Babbush, and Hartmut Neven, “Barren plateaus in quantum neural network training landscapes,” Nature Communications 9
2018
Closest in time.
Tameem Albash and Daniel A. Lidar, “Adiabatic quantum computation,” Rev. Mod. Phys. 90
2018
Closest in time.
Zhihui Wang, Stuart Hadfield, Zhang Jiang, and Eleanor G. Rieffel, “Quantum approximate optimization algorithm for maxcut: A fermionic view,” Phys. Rev. A 97
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Peter I. Frazier, “A Tutorial on Bayesian Optimization,” (2018), arXiv:1807.02811
2018
Closest in time.
2018
Closest in time.
Aishwarya Kumar, Tsung-Yao Wu, Felipe Giraldo, and David S. Weiss, “Sorting ultracold atoms in a three-dimensional optical lattice in a realization of maxwell’s demon,” Nature 561
2018
Closest in time.
C. Neill, P. Roushan, K. Kechedzhi, S. Boixo, S. V. Isakov, V. Smelyanskiy, A. Megrant, B. Chiaro, A. Dunsworth, K. Arya, R. Barends, B. Burkett, Y. Chen, Z. Chen, A. Fowler, B. Foxen, M. Giustina, R. Graff, E. Jeffrey, T. Huang, J. Kelly, P. Klimov, E. Lucero, J. Mutus, M. Neeley, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, H. Neven, and J. M. Martinis, “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science 360
2018
Closest in time.
Harry Levine, Alexander Keesling, Ahmed Omran, Hannes Bernien, Sylvain Schwartz, Alexander S. Zibrov, Manuel Endres, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin, “High-fidelity control and entanglement of rydberg-atom qubits,” Phys. Rev. Lett. 121
2018
Closest in time.
2018
Closest in time.
Marin Bukov, Alexandre G. R. Day, Dries Sels, Phillip Weinberg, Anatoli Polkovnikov, and Pankaj Mehta, “Reinforcement learning in different phases of quantum control,” Phys. Rev. X 8
2018
Closest in time.