Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA) is an algorithmic framework for finding approximate solutions to combinatorial optimization problems, derived from an approximation to the Quantum Adiabatic Algorithm (QAA).
Reducibility among combinatorial problems
Richard M Karp · 1972
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda · 2001
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Quantum information processing in continuous time
Andrew Macgregor Childs · 2004
Earlier work this paper cites.
Quantum adiabatic brachistochrone
AT Rezakhani, W-J Kuo, A Hamma, DA Lidar, and P Zanardi · 2009
Earlier work this paper cites.
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Juraj Hromkovič · 2013
Earlier work this paper cites.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
Ising formulations of many np problems
Andrew Lucas · 2014
Cited alongside, same era.
Quantum principal component analysis
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost · 2014
Cited alongside, same era.
Lie groups, Lie algebras, and representations: an elementary introduction
Brian Hall · 2015
Cited alongside, same era.
Quantum annealing for constrained optimization
Itay Hen and Federico M Spedalieri · 2016
Cited alongside, same era.
Driver hamiltonians for constrained optimization in quantum annealing
Itay Hen and Marcelo S Sarandy · 2016
Cited alongside, same era.
Qantum approximate optimization with hard and soft constraints
Stuart Hadfield, Zhihui Wang, Eleanor G Rieffel, Bryan O’Gorman, Davide Venturelli, and Rupak Biswas · 2017
Cited alongside, same era.
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G Rieffel, Davide Venturelli, and Rupak Biswas · 2017
Later among the works it cites.
Hamiltonian simulation with optimal sample complexity
Shelby Kimmel, Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, and Theodore J Yoder · 2017
Later among the works it cites.
Adiabatic quantum computation
Tameem Albash and Daniel A Lidar · 2018
Later among the works it cites.
Quantum algorithms for scientific computing and approximate optimization
Stuart Hadfield · 2018
Later among the works it cites.
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D Lukin · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
AQC is to used for searching minimum. QAOA is used for searching maximum. The operator C ^ \hat{C} defined here differs slightly from the original definition proposed by I. Hen
Cited in the paper.
Later among the works it cites.
A quantum walk assisted approximate algorithm for bounded np optimisation problems
Samuel Marsh and Jingbo Wang · 2019
Later among the works it cites.