Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits

R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of computer computations . Springer, 1972, pp. 85–103

1972

Earlier work this paper cites.

C. H. Papadimitriou and M. Yannakakis, “Optimization, approximation, and complexity classes,” Journal of computer and system sciences , vol. 43, no. 3, pp. 425–440, 1991

1991

Earlier work this paper cites.

R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” Journal of global optimization , vol. 11, no. 4, pp. 341–359, 1997

Original

1997

Earlier work this paper cites.

E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint arXiv:1411.4028 , 2014

Original

2014

Earlier work this paper cites.

D. Wecker, M. B. Hastings, and M. Troyer, “Training a quantum optimizer,” Physical Review A , vol. 94, no. 2, p. 022309, 2016

2016

Earlier work this paper cites.

A. Kandala et al. , “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature , vol. 549, no. 7671, p. 242, 2017

2017

Earlier work this paper cites.

J. Romero, J. P. Olson, and A. Aspuru-Guzik, “Quantum autoencoders for efficient compression of quantum data,” Quantum Science and Technology , vol. 2, no. 4, p. 045001, 2017

2017

Cited alongside, same era.

G. G. Guerreschi and M. Smelyanskiy, “Practical optimization for hybrid quantum-classical algorithms,” arXiv preprint arXiv:1701.01450 , 2017

Original

2017

Cited alongside, same era.

E. Farhi, J. Goldstone, S. Gutmann, and H. Neven, “Quantum algorithms for fixed qubit architectures,” arXiv preprint arXiv:1703.06199 , 2017

Original

2017

Cited alongside, same era.

S. Hadfield et al. , “Quantum approximate optimization with hard and soft constraints,” in Proceedings of the Second International Workshop on Post Moores Era Supercomputing . ACM, 2017, pp. 15–21

2017

Cited alongside, same era.

L. Zhou et al. , “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” arXiv preprint arXiv:1812.01041 , 2018

Original

2018

Later among the works it cites.

G. Guerreschi and A. Matsuura, “Qaoa for max-cut requires hundreds of qubits for quantum speed-up,” arXiv preprint arXiv:1812.07589 , 2018

Original

2018

Later among the works it cites.

G. E. Crooks, “Performance of the quantum approximate optimization algorithm on the maximum cut problem,” arXiv preprint arXiv:1811.08419 , 2018

Original

2018

Later among the works it cites.

F. G. Brandao et al. , “For fixed control parameters the quantum approximate optimization algorithm’s objective function value concentrates for typical instances,” arXiv preprint arXiv:1812.04170 , 2018

Original

2018

Later among the works it cites.