An angle rounding parameter initialization technique for ma-QAOA

W. H. Press, B. P. Flannery, and S. A. Teukolsky, Numerical Recipes in Fortran 77: The Art of Scientific Computing , 2nd ed. Cambridge University Press, 1993, https://people.sc.fsu.edu/ inavon/5420a/DFP.pdf

1993

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.

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

Original

2018

Earlier work this paper cites.

Z. Wang, S. Hadfield, Z. Jiang, and E. G. Rieffel, “Quantum approximate optimization algorithm for maxcut: A fermionic view,” Physical Review A , vol. 97, no. 2, p. 022304, 2018

2018

Earlier work this paper cites.

G. G. Guerreschi and A. Y. Matsuura, “Qaoa for max-cut requires hundreds of qubits for quantum speed-up,” Scientific reports , vol. 9, 2019

2019

Earlier work this paper cites.

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,” Physical Review X , vol. 10, no. 2, June 2020. [Online]. Available: https://doi.org/10.1103%2Fphysrevx.10.021067

2020

Earlier work this paper cites.

R. Herrman, L. Treffert, J. Ostrowski, P. C. Lotshaw, T. S. Humble, and G. Siopsis, “Impact of graph structures for qaoa on maxcut,” arXiv preprint arXiv:2102.05997 , 2021

Original

2021

Earlier work this paper cites.

N. Earnest, C. Tornow, and D. J. Egger, “Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware,” Physical Review Research , vol. 3, no. 4, p. 043088, 2021

2021

Earlier work this paper cites.

J. Wurtz and D. Lykov, “Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs,” Physical Review A , vol. 104, no. 5, p. 052419, 2021

2021

Cited alongside, same era.

R. Herrman, P. C. Lotshaw, J. Ostrowski, T. S. Humble, and G. Siopsis, “Multi-angle quantum approximate optimization algorithm,” arXiv preprint arXiv:2109.11455 , 2021

Original

2021

Cited alongside, same era.

J. Wurtz and P. J. Love, “Classically optimal variational quantum algorithms,” IEEE Transactions on Quantum Engineering , vol. 2, pp. 1–7, 2021

2021

Cited alongside, same era.

S. H. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate optimization algorithm,” Quantum , vol. 5, p. 491, 2021. [Online]. Available: https://quantum-journal.org/papers/q-2021-07-01-491/

2021

Cited alongside, same era.

J. Sud, S. Hadfield, E. Rieffel, N. Tubman, and T. Hogg, “A parameter setting heuristic for the quantum alternating operator ansatz,” 2022

2022

Later among the works it cites.

V. Vijendran, A. Das, D. E. Koh, S. M. Assad, and P. K. Lam, “An expressive ansatz for low-depth quantum optimisation,” arXiv preprint arXiv:2302.04479 , 2023

Original

2023

Later among the works it cites.

I. Gaidai and R. Herrman, “Performance analysis of multi-angle qaoa for p > 1 p>1 ,” arXiv e-prints , pp. arXiv–2312, 2023

2023

Later among the works it cites.

S. H. Sack, R. A. Medina, R. Kueng, and M. Serbyn, “Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement,” Physical Review A , vol. 107, p. 062404, 2023. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.107.062404

2023

Later among the works it cites.