Fetching the paper…
Reading the bibliography…
The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development.
The decision problem for a class of first-order formulas in which all disjunctions are binary
Melven R Krom · 1967
Earlier work this paper cites.
The complexity of theorem-proving procedures
Stephen A Cook · 1971
Earlier work this paper cites.
A threshold for unsatisfiability
Andreas Goerdt · 1996
Earlier work this paper cites.
Experimental results on the crossover point in satisfiability problems
James M Crawford and Larry D Auton · 1996
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
Quantum annealing in the transverse Ising model
Tadashi Kadowaki and Hidetoshi Nishimori · 1998
Earlier work this paper cites.
Some optimal inapproximability results
Johan Håstad · 2001
Earlier work this paper cites.
Phase transitions and backbones of 3-sat and maximum 3-sat
Weixiong Zhang · 2001
Earlier work this paper cites.
Random max sat, random max cut, and their phase transitions
Don Coppersmith, David Gamarnik, MohammadTaghi Hajiaghayi, and Gregory B Sorkin · 2004
Cited alongside, same era.
Nonperturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
JD Biamonte · 2008
Cited alongside, same era.
Demonstration of two-qubit algorithms with a superconducting quantum processor
Leonardo DiCarlo, Jerry M Chow, Jay M Gambetta, Lev S Bishop, Blake R Johnson, DI Schuster, J Majer, Alexandre Blais, L Frunzio, SM Girvin, et al · 2009
Cited alongside, same era.
Ground-state spin logic
James Daniel Whitfield, Mauro Faccin, and JD Biamonte · 2012
Cited alongside, same era.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L. O’Brien · 2014
Cited alongside, same era.
Demonstration of a small programmable quantum computer with atomic qubits
Shantanu Debnath, Norbert M Linke, Caroline Figgatt, Kevin A Landsman, Kevin Wright, and Christopher Monroe · 2016
Later among the works it cites.
Digitized adiabatic quantum computing with a superconducting circuit
Rami Barends, Alireza Shabani, Lucas Lamata, Julian Kelly, Antonio Mezzacapo, Urtzi Las Heras, Ryan Babbush, Austin G Fowler, Brooks Campbell, Yu Chen, et al · 2016
Later among the works it cites.
Near-optimal quantum circuit for grover’s unstructured search using a transverse field
Zhang Jiang, Eleanor G. Rieffel, and Zhihui Wang · 2017
Later among the works it cites.
Barren plateaus in quantum neural network training landscapes
Jarrod R McClean, Sergio Boixo, Vadim N Smelyanskiy, Ryan Babbush, and Hartmut Neven · 2018
Later among the works it cites.
Quantum approximate optimization algorithm for maxcut: A fermionic view
Zhihui Wang, Stuart Hadfield, Zhang Jiang, and Eleanor G Rieffel · 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…
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
Ising formulations of many NP problems
Andrew Lucas · 2014
Cited alongside, same era.
Variational learning of grover’s quantum search algorithm
Mauro ES Morales, Timur Tlyachev, and Jacob Biamonte · 2018
Later among the works it cites.
Classical and quantum bounded depth approximation algorithms
Matthew B Hastings · 2019
Closest in time.