Fetching the paper…
Reading the bibliography…
Quantum Approximate Optimization Algorithm (QAOA) is a hybrid classical-quantum algorithm to approximately solve NP optimization problems such as MAX-CUT.
Random graph isomorphism
László Babai, Paul Erdős, and Stanley M. Selkow · 1980
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identifications
Jin-yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
The complexity of mckay’s canonical labeling algorithm
T. Miyazaki · 1995
Earlier work this paper cites.
Quadratic canonical transformation theory and higher order density matrices
Eric Neuscamman, Takeshi Yanai, and Garnet Chan · 2009
Earlier work this paper cites.
Two-particle quantum walks applied to the graph isomorphism problem
John King Gamble, Mark Friesen, Dong Zhou, Robert Joynt, and S. N. Coppersmith · 2010
Earlier work this paper cites.
k-boson quantum walks do not distinguish arbitrary graphs
Jamie Smith · 2010
Earlier work this paper cites.
Two-particle quantum walks: Entanglement and graph isomorphism testing
Scott D Berry and Jingbo B Wang · 2011
Earlier work this paper cites.
Quantum walks on regular graphs and eigenvalues
Chris Godsil and Krystal Guo · 2011
Earlier work this paper cites.
Efficient isomorphism of miyazaki graphs
Greg Tener and N. Deo · 2011
Earlier work this paper cites.
Solving the graph-isomorphism problem with a quantum annealer
Itay Hen and AP Young · 2012
Earlier work this paper cites.
A quantum approximate optimization algorithm, 2014
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem, 2014
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod R. McClean, Peter Shadbolt, Man-Hong Yung, Xiaoqi Zhou, Peter J. Love, Alán Aspuru-Guzik, and Jeremy L O’Brien · 2014
Cited alongside, same era.
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
Dario Tamascelli and Luca Zanetti · 2014
Cited alongside, same era.
Graph isomorphism in quasipolynomial time [extended abstract]
László Babai · 2016
Cited alongside, same era.
Quantum supremacy through the quantum approximate optimization algorithm, 2016
Edward Farhi and Aram W Harrow · 2016
Cited alongside, same era.
The theory of variational hybrid quantum-classical algorithms
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alan Aspuru-Guzik · 2016
Cited alongside, same era.
Fast graph operations in quantum computation
Liming Zhao, Carlos A. Pérez-Delgado, and Joseph F. Fitzsimons · 2016
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.
Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, 2018
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin · 2018
Later among the works it cites.
Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh · 2019
Closest in time.
Canonical form for graphs in quasipolynomial time: preliminary report
László Babai · 2019
Closest in time.
Personal communication, 2019
László Babai · 2019
Closest in time.
Qaoa for max-cut requires hundreds of qubits for quantum speed-up
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Benchmark graphs for practical graph isomorphism
Daniel Neuen and Pascal Schweitzer · 2017
Cited alongside, same era.
For fixed control parameters the quantum approximate optimization algorithm’s objective function value concentrates for typical instances, 2018
Fernando G. S. L. Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven · 2018
Cited alongside, same era.
Graph isomorphism and gaussian boson sampling, 2018
Kamil Bradler, Shmuel Friedland, Josh Izaac, Nathan Killoran, and Daiqin Su · 2018
Cited alongside, same era.
Performance of the quantum approximate optimization algorithm on the maximum cut problem, 2018
Gavin E. Crooks · 2018
Cited alongside, same era.
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Daniel Neuen and Pascal Schweitzer · 2018
Cited alongside, same era.
Quantum states and knowledge: Between pure states and density matrices, 2018
Sandu Popescu · 2018
Cited alongside, same era.
G. G. Guerreschi and A. Y. Matsuura · 2019
Closest in time.
Classical and quantum bounded depth approximation algorithms, 2019
M. B. Hastings · 2019
Closest in time.
Quantum invariants and the graph isomorphism problem
P. W. Mills, R. P. Rundle, J. H. Samson, Simon J. Devitt, Todd Tilma, V. M. Dwyer, and Mark J. Everitt · 2019
Closest in time.
Evaluating quantum approximate optimization algorithm: A case study, 2019
Ruslan Shaydulin and Yuri Alexeev · 2019
Closest in time.
A quantum hardware-induced graph kernel based on gaussian boson sampling, 2019
Maria Schuld, Kamil Bradler, Robert Israel, Daiqin Su, and Brajesh Gupt · 2019
Closest in time.
Multistart methods for quantum approximate optimization, 2019
Ruslan Shaydulin, Ilya Safro, and Jeffrey Larson · 2019
Closest in time.
Alibaba cloud quantum development platform: Large-scale classical simulation of quantum circuits, 2019
Fang Zhang, Cupjin Huang, Michael Newman, Junjie Cai, Huanjun Yu, Zhengxiong Tian, Bo Yuan, Haihong Xu, Junyin Wu, Xun Gao, Jianxin Chen, Mario Szegedy, and Yaoyun Shi · 2019
Closest in time.