Fetching the paper…
Reading the bibliography…
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems.
1905
Earlier work this paper cites.
Mustafa Demirplak and Stuart A Rice, “Adiabatic population transfer with control fields,”
2003
Earlier work this paper cites.
M. V. Berry, “Transitionless quantum driving,”
2009
Earlier work this paper cites.
Christopher Jarzynski, “Generating shortcuts to adiabaticity in quantum and classical dynamics,”
2013
Earlier work this paper cites.
Jiawen Deng, Qing-hai Wang, Zhihao Liu, Peter Hänggi, and Jiangbin Gong, “Boosting work characteristics and overall heat-engine performance via shortcuts to adiabaticity: Quantum and classical systems,”
2013
Earlier work this paper cites.
Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, and Yang Wang, “The unconstrained binary quadratic programming problem: a survey,”
2014
Earlier work this paper cites.
Andrew Lucas, “Ising formulations of many NP problems,”
2014
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, and Peter Shor, Design of Quantum Algorithms Using Physics Tools , Tech. Rep. (MASSACHUSETTS INST OF TECH CAMBRIDGE, 2014)
2014
Earlier work this paper cites.
Alan C. Santos and Marcelo S. Sarandy, “Superadiabatic Controlled Evolutions and Universal Quantum Computation,”
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Yuanjian Zheng, Steve Campbell, Gabriele De Chiara, and Dario Poletti, “Cost of counterdiabatic driving and work output,”
2016
Earlier work this paper cites.
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon, “Optimizing variational quantum algorithms using Pontryagin’s minimum principle,”
2017
Earlier work this paper cites.
Zhang Jiang, Eleanor G Rieffel, and Zhihui Wang, “Near-optimal quantum circuit for Grover’s unstructured search using a transverse field,”
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Michael Kolodrubetz, Dries Sels, Pankaj Mehta, and Anatoli Polkovnikov, “Geometry and non-adiabatic response in quantum and classical systems,”
2017
Cited alongside, same era.
Dries Sels and Anatoli Polkovnikov, “Minimizing irreversible losses in quantum systems by local counterdiabatic driving,”
2017
Cited alongside, same era.
Zhihui Wang, Stuart Hadfield, Zhang Jiang, and Eleanor G Rieffel, “Quantum approximate optimization algorithm for MaxCut: A fermionic view,”
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G Rieffel, Davide Venturelli, and Rupak Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,”
2019
Later among the works it cites.
Harper R. Grimsley, Sophia E. Economou, Edwin Barnes, and Nicholas J. Mayhall, “An adaptive variational algorithm for exact molecular simulations on a quantum computer,”
2019
Later among the works it cites.
2019
Later among the works it cites.
Ruslan Shaydulin, Ilya Safro, and Jeffrey Larson, “Multistart methods for quantum approximate optimization,”
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
Seth Lloyd, “Quantum approximate optimization is computationally universal,”
2018
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Gian Giacomo Guerreschi and AY Matsuura, “QAOA for Max-Cut requires hundreds of qubits for quantum speed-up,”
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Later among the works it cites.
2020
Closest in time.
Zhihui Wang, Nicholas C Rubin, Jason M Dominy, and Eleanor G Rieffel, “XY mixers: Analytical and numerical results for the quantum alternating operator ansatz,”
2020
Closest in time.
Li Li, Minjie Fan, Marc Coram, Patrick Riley, and Stefan Leichenauer, “Quantum optimization with a novel Gibbs objective function and ansatz architecture search,”
2020
Closest in time.
2020
Closest in time.
V Akshay, H Philathong, MES Morales, and JD Biamonte, “Reachability deficits in quantum approximate optimization,”
2020
Closest in time.
Shamreen Iram, Emily Dolson, Joshua Chiel, Julia Pelesko, Nikhil Krishnan, Özenç Güngör, Benjamin Kuznets-Speck, Sebastian Deffner, Efe Ilker, Jacob G Scott, and Michael Hinczewski, “Controlling the speed and trajectory of evolution with counterdiabatic driving,”
2020
Closest in time.
Narendra N Hegade, Koushik Paul, Yongcheng Ding, Mikel Sanz, Francisco Albarrán-Arriagada, Enrique Solano, and Xi Chen, “Shortcuts to adiabaticity in digitized adiabatic quantum computing,”
2021
Closest in time.
Ho Lun Tang, V. O Shkolnikov, George S Barron, Harper R Grimsley, Nicholas J Mayhall, Edwin Barnes, and Sophia E Economou, “qubit-adapt-vqe: An adaptive algorithm for constructing hardware-efficient ansätze on a quantum processor,”
2021
Closest in time.