Fetching the paper…
Reading the bibliography…
The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated Quantum Computation of Molecular Energies, Science 309
2005
Earlier work this paper cites.
2014
Earlier work this paper cites.
P. J. J. O’Malley et al
2016
Earlier work this paper cites.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
A. P. Lund, M. J. Bremner, and T. C. Ralph, Quantum sampling problems, BosonSampling and quantum supremacy, npj Quantum Information 3
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
Sergio Boixo et al
2018
Earlier work this paper cites.
S. Lloyd, Quantum approximate optimization is computationally universal, arXiv:1812.11075 (2018)
2018
Earlier work this paper cites.
X. Qiang et al
2018
Earlier work this paper cites.
J. Gray, quimb: A python package for quantum information and many-body calculations, Journal Of Open Source Software, 3
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
F. Arute et al
2019
Cited alongside, same era.
M. Benedetti, E, Lloyd, S. Sack, and M. Fiorentini, Parameterized quantum circuits as machine learning models, Quantum Sci. Technol. 4
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
M. Willsch, D. Willsch, F. Jin, H. D. Raedt, and K. Michielsen, Benchmarking the Quantum Approximate Optimization Algorithm, Quantum Inf. Process. 19
2020
Later among the works it cites.
Feng Pan and Pan Zhang. Simulating the sycamore quantum supremacy circuits, arXiv:2103.03074 (2021)
2021
Closest in time.
2021
Closest in time.
Yulin Wu et al
2021
Closest in time.
Qingling Zhu et al
2021
Closest in time.
He-Liang Huang et al
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
2020
Cited alongside, same era.
F. Arute et al
2020
Cited alongside, same era.
V. Akshay, H. Philathong, M. E. S. Morales, and J. D. Biamonte, Reachability Deficits in Quantum Approximate Optimization, Phys. Rev. Lett. 124
2020
Cited alongside, same era.
P. Vikstål, M. Grönkvist, M. Svensson, M. Andersson, G. Johansson, and G. Ferrini, Phys. Rev. Applied 14
2020
Cited alongside, same era.
2020
Cited alongside, same era.
L. Zhou, S. T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices, Phys. Rev. X 10
2020
Cited alongside, same era.
G. Pagano et al
2020
Cited alongside, same era.
M. P. Harrigan et al
2021
Closest in time.
M. Cerezo et al
2021
Closest in time.
S. Bravyi, D. Gosset, and R. Movassagh, Classical algorithms for quantum mean values, Nat. Phys. 17
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
M. Medvidović and G. Carleo, Classical variational simulation of the Quantum Approximate Optimization Algorithm, npj Quantum Inf 7
2021
Closest in time.
M. S. Anis et al
2021
Closest in time.