References#
Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115–1145, November 1995. URL: https://doi.org/10.1145/227683.227684, doi:10.1145/227683.227684.
Asier Ozaeta, Wim van Dam, and Peter L McMahon. Expectation values from the single-layer quantum approximate optimization algorithm on ising problems. Quantum Science and Technology, Dec 2020. arXiv:2012.03421.
J. A. Montanez-Barrera and Kristel Michielsen. Towards a universal QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems. https://arxiv.org/abs/2405.09169, May 2024.
Johannes Weidenfeller, Lucia C. Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Woerner, and Daniel J. Egger. Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware. Quantum, 6:870, Dec 2022. URL: http://dx.doi.org/10.22331/q-2022-12-07-870, doi:10.22331/q-2022-12-07-870.
J. Misra and David Gries. A constructive proof of vizing's theorem. Information Processing Letters, 41(3):131–133, 1992. URL: https://www.sciencedirect.com/science/article/pii/002001909290041S, doi:https://doi.org/10.1016/0020-0190(92)90041-S.
Ayse Kotil, Fedor Simkovic, and Martin Leib. Improved qubit routing for QAOA circuits. https://arxiv.org/abs/2312.15982, Dec 2023.
Elisabeth Wybo and Martin Leib. Missing puzzle pieces in the performance landscape of the quantum approximate optimization algorithm. 2024. URL: https://arxiv.org/abs/2406.14618, arXiv:2406.14618.