{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T01:33:59Z","timestamp":1779932039956,"version":"3.53.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:00:00Z","timestamp":1726185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:00:00Z","timestamp":1726185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"publisher","award":["2021\/0281"],"award-info":[{"award-number":["2021\/0281"]}],"id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10479-024-06253-5","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T08:12:40Z","timestamp":1726215160000},"page":"847-884","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An introduction to variational quantum algorithms for combinatorial optimization problems"],"prefix":"10.1007","volume":"343","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9063-8048","authenticated-orcid":false,"given":"Camille","family":"Grange","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Bourreau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,13]]},"reference":[{"key":"6253_CR1","doi-asserted-by":"crossref","unstructured":"Abbas, A., Ambainis, A., Augustino, B., B\u00e4rtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D.\u00a0J., Elmegreen, B.\u00a0G., et\u00a0al. (2023). Quantum optimization: Potential, challenges, and the path forward. arXiv preprint arXiv:2312.02279.","DOI":"10.2172\/2229681"},{"key":"6253_CR2","doi-asserted-by":"crossref","unstructured":"Alam, M., Ash-Saki, A., & Ghosh, S. (2020). Accelerating quantum approximate optimization algorithm using machine learning. In 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), pages 686\u2013689. IEEE .","DOI":"10.23919\/DATE48585.2020.9116348"},{"issue":"1","key":"6253_CR3","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac3e54","volume":"7","author":"D Amaro","year":"2022","unstructured":"Amaro, D., Modica, C., Rosenkranz, M., Fiorentini, M., Benedetti, M., & Lubasch, M. (2022). Filtering variational quantum algorithms for combinatorial optimization. Quantum Science and Technology, 7(1), 015021.","journal-title":"Quantum Science and Technology"},{"key":"6253_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Balodis, K., Iraids, J., Kokainis, M., Pr\u016bsis, K., & Vihrovs, J. (2019). Quantum speedups for exponential-time dynamic programming algorithms. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1783\u20131793, SIAM .","DOI":"10.1137\/1.9781611975482.107"},{"key":"6253_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"PK Barkoutsos","year":"2020","unstructured":"Barkoutsos, P. K., Nannicini, G., Robert, A., Tavernelli, I., & Woerner, S. (2020). Improving variational quantum optimization using CVaR. Quantum, 4, 256.","journal-title":"Quantum"},{"key":"6253_CR6","unstructured":"Basso, J., Farhi, E., Marwaha, K., Villalonga, B., & Zhou, L. (2021). The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the sherrington-kirkpatrick model. arXiv preprint arXiv:2110.14206."},{"key":"6253_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2024.03.002","volume":"1068","author":"K Blekos","year":"2024","unstructured":"Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024). A review on quantum approximate optimization algorithm and its variants. Physics Reports, 1068, 1\u201366.","journal-title":"Physics Reports"},{"key":"6253_CR8","unstructured":"Brandao, F.\u00a0G., Broughton, M., Farhi, E., Gutmann, S., Neven, H. (2018). For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170."},{"issue":"26","key":"6253_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505","volume":"125","author":"S Bravyi","year":"2020","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2020). Obstacles to variational quantum optimization from symmetry protection. Physical Review Letters, 125(26), 260505.","journal-title":"Physical Review Letters"},{"key":"6253_CR10","doi-asserted-by":"publisher","first-page":"678","DOI":"10.22331\/q-2022-03-30-678","volume":"6","author":"S Bravyi","year":"2022","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2022). Hybrid quantum-classical algorithms for approximate graph coloring. Quantum, 6, 678.","journal-title":"Quantum"},{"issue":"9","key":"6253_CR11","first-page":"625","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021). Variational quantum algorithms. Nature Reviews. Physics, 3(9), 625\u2013644.","journal-title":"Physics"},{"key":"6253_CR12","unstructured":"Crooks, G.\u00a0E. (2018). Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419."},{"issue":"1","key":"6253_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.4.010309","volume":"4","author":"G De Palma","year":"2023","unstructured":"De Palma, G., Marvian, M., Rouz\u00e9, C., & Fran\u00e7a, D. S. (2023). Limitations of variational quantum algorithms: a quantum optimal transport approach. PRX Quantum, 4(1), 010309.","journal-title":"PRX Quantum"},{"key":"6253_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","volume":"5","author":"DJ Egger","year":"2021","unstructured":"Egger, D. J., Marecek, J., & Woerner, S. (2021). Warm-starting quantum optimization. Quantum, 5, 479.","journal-title":"Quantum"},{"key":"6253_CR15","unstructured":"Farhi, E., Gamarnik, D., & Gutmann, S. (2020). The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002."},{"key":"6253_CR16","unstructured":"Farhi, E., Goldstone, J., Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028."},{"key":"6253_CR17","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106."},{"key":"6253_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.22331\/q-2022-07-07-759","volume":"6","author":"E Farhi","year":"2022","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., & Zhou, L. (2022). The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size. Quantum, 6, 759.","journal-title":"Quantum"},{"key":"6253_CR19","unstructured":"Farhi, E., & Harrow, A.\u00a0W. (2016). Quantum supremacy through the quantum approximate optimization algorithm. arXiv preprint arXiv:1602.07674."},{"key":"6253_CR20","unstructured":"Fortran, I., Press, W., Teukolsky, S., Vetterling, W., & Flannery, B. (1992). Numerical recipes. Cambridge, UK, Cambridge University Press, 01."},{"key":"6253_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2019","unstructured":"Glover, F., Kochenberger, G., & Du, Y. (2019). Quantum Bridge Analytics I a tutorial on formulating and using QUBO models. 4or, 17, 335\u2013371.","journal-title":"4or"},{"issue":"6","key":"6253_CR22","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M. X., & Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM), 42(6), 1115\u20131145.","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"6253_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10288-023-00549-1","volume":"21","author":"C Grange","year":"2023","unstructured":"Grange, C., Poss, M., & Bourreau, E. (2023). An introduction to variational quantum algorithms for combinatorial optimization problems. 4or, 21(3), 363\u2013403.","journal-title":"4or"},{"key":"6253_CR24","doi-asserted-by":"crossref","unstructured":"Grover, L.\u00a0K. (1996) A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212\u2013219.","DOI":"10.1145\/237814.237866"},{"issue":"1","key":"6253_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi, G. G., & Matsuura, A. Y. (2019). QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific Reports, 9(1), 1\u20137.","journal-title":"Scientific Reports"},{"issue":"2","key":"6253_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., Ogorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019). From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12(2), 34.","journal-title":"Algorithms"},{"key":"6253_CR27","doi-asserted-by":"crossref","unstructured":"Hastings, M.\u00a0B. (2019). Classical and quantum bounded depth approximation algorithms. arXiv preprint arXiv:1905.07047, .","DOI":"10.26421\/QIC19.13-14-3"},{"issue":"3","key":"6253_CR28","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10287-018-0330-0","volume":"15","author":"L Hellemo","year":"2018","unstructured":"Hellemo, L., Barton, P. I., & Tomasgard, A. (2018). Decision-dependent probabilities in stochastic programs with recourse. Computational Management Science, 15(3), 369\u2013395.","journal-title":"Computational Management Science"},{"issue":"1","key":"6253_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1038\/s42005-023-01331-9","volume":"6","author":"D Herman","year":"2023","unstructured":"Herman, D., Shaydulin, R., Sun, Y., Chakrabarti, S., Hu, S., Minssen, P., Rattew, A., Yalovetzky, R., & Pistoia, M. (2023). Constrained optimization via quantum zeno dynamics. Communications Physics, 6(1), 219.","journal-title":"Communications Physics"},{"issue":"10","key":"6253_CR30","doi-asserted-by":"publisher","first-page":"294","DOI":"10.3390\/a14100294","volume":"14","author":"R Herrman","year":"2021","unstructured":"Herrman, R., Treffert, L., Ostrowski, J., Lotshaw, P. C., Humble, T. S., & Siopsis, G. (2021). Globally optimizing QAOA circuit depth for constrained optimization problems. Algorithms, 14(10), 294.","journal-title":"Algorithms"},{"issue":"1","key":"6253_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010313","volume":"3","author":"Z Holmes","year":"2022","unstructured":"Holmes, Z., Sharma, K., Cerezo, M., & Coles, P. J. (2022). Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum, 3(1), 010313.","journal-title":"PRX Quantum"},{"issue":"1","key":"6253_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3406306","volume":"1","author":"I Kerenidis","year":"2020","unstructured":"Kerenidis, I., & Prakash, A. (2020). A quantum interior point method for LPs and SDPs. ACM Transactions on Quantum Computing, 1(1), 1\u201332.","journal-title":"ACM Transactions on Quantum Computing"},{"key":"6253_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.22331\/q-2021-04-08-427","volume":"5","author":"I Kerenidis","year":"2021","unstructured":"Kerenidis, I., Prakash, A., & Szil\u00e1gyi, D. (2021). Quantum algorithms for second-order cone programming and support vector machines. Quantum, 5, 427.","journal-title":"Quantum"},{"key":"6253_CR34","doi-asserted-by":"crossref","unstructured":"Khumalo, M. T., Chieza, H. A., Prag, K., & Woolway, M. (2022). An investigation of IBM quantum computing device performance on combinatorial optimisation problems. Neural Computing and Applications, 1\u201316.","DOI":"10.1007\/s00521-022-07438-4"},{"key":"6253_CR35","unstructured":"Kingma, D.\u00a0P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"6253_CR36","unstructured":"Kitaev, A.\u00a0Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph\/9511026, ."},{"issue":"2","key":"6253_CR37","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2023.03.013","volume":"310","author":"K Kurowski","year":"2023","unstructured":"Kurowski, K., Pecyna, T., Slysz, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., & W\u0229glarz, J. (2023). Application of quantum approximate optimization algorithm to job shop scheduling problem. European Journal of Operational Research, 310(2), 518\u201328.","journal-title":"European Journal of Operational Research"},{"key":"6253_CR38","unstructured":"Lao, L., Manzano, D., van Someren, H., & Ashraf, I. (2019). and C. G. Almudever. Mapping of quantum circuits onto NISQ superconducting processors. arXiv: Quantum Physics."},{"issue":"2","key":"6253_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023074","volume":"2","author":"L Li","year":"2020","unstructured":"Li, L., Fan, M., Coram, M., Riley, P., Leichenauer, S., et al. (2020). Quantum optimization with a novel Gibbs objective function and ansatz architecture search. Physical Review Research, 2(2), 023074.","journal-title":"Physical Review Research"},{"issue":"12","key":"6253_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03342-3","volume":"20","author":"PC Lotshaw","year":"2021","unstructured":"Lotshaw, P. C., Humble, T. S., Herrman, R., Ostrowski, J., & Siopsis, G. (2021). Empirical performance bounds for quantum approximate optimization. Quantum Information Processing, 20(12), 1\u201332.","journal-title":"Quantum Information Processing"},{"key":"6253_CR41","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A. (2014). Ising formulations of many NP problems. Frontiers in physics, 2, 5.","journal-title":"Frontiers in physics"},{"key":"6253_CR42","doi-asserted-by":"publisher","first-page":"757","DOI":"10.22331\/q-2022-07-07-757","volume":"6","author":"K Marwaha","year":"2022","unstructured":"Marwaha, K., & Hadfield, S. (2022). Bounds on approximating Max $$k$$XOR with quantum and classical local algorithms. Quantum, 6, 757.","journal-title":"Quantum"},{"key":"6253_CR43","unstructured":"Mastropietro, D., Korpas, G., Kungurtsev, V., & Marecek, J. (2023). Fleming-viot helps speed up variational quantum algorithms in the presence of barren plateaus. arXiv preprint arXiv:2311.18090."},{"issue":"1","key":"6253_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018). Barren plateaus in quantum neural network training landscapes. Nature Communications, 9(1), 1\u20136.","journal-title":"Nature Communications"},{"key":"6253_CR45","unstructured":"Montanaro, A. (2015). Quantum walk speedup of backtracking algorithms. arXiv preprint arXiv:1509.02374."},{"issue":"1","key":"6253_CR46","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.013056","volume":"2","author":"A Montanaro","year":"2020","unstructured":"Montanaro, A. (2020). Quantum speedup of branch-and-bound algorithms. Physical Review Research, 2(1), 013056.","journal-title":"Physical Review Research"},{"issue":"47","key":"6253_CR47","doi-asserted-by":"publisher","first-page":"10243","DOI":"10.1088\/0305-4470\/34\/47\/324","volume":"34","author":"R Mosseri","year":"2001","unstructured":"Mosseri, R., & Dandoloff, R. (2001). Geometry of entangled states, Bloch spheres and Hopf fibrations. Journal of Physics A: Mathematical and General, 34(47), 10243.","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"6253_CR48","doi-asserted-by":"crossref","unstructured":"Nagarajan, H., Lockwood, O., & Coffrin, C. (2021). QuantumCircuitOpt: An open-source framework for provably optimal quantum circuit design. In 2021 IEEE\/ACM Second International Workshop on Quantum Computing Software (QCS), pages 55\u201363. IEEE.","DOI":"10.1109\/QCS54837.2021.00010"},{"issue":"1","key":"6253_CR49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304","volume":"99","author":"G Nannicini","year":"2019","unstructured":"Nannicini, G. (2019). Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Physical Review E, 99(1), 013304.","journal-title":"Physical Review E"},{"key":"6253_CR50","doi-asserted-by":"crossref","unstructured":"Nannicini, G. (2021). Fast Quantum Subroutines for the Simplex Method. In M.\u00a0Singh and D.\u00a0P. Williamson, editors, Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings, volume 12707 of Lecture Notes in Computer Science, pages 311\u2013325. Springer.","DOI":"10.1007\/978-3-030-73879-2_22"},{"issue":"4","key":"6253_CR51","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J. A., & Mead, R. (1965). A simplex method for function minimization. The Computer Journal, 7(4), 308\u2013313.","journal-title":"The Computer Journal"},{"key":"6253_CR52","doi-asserted-by":"crossref","unstructured":"Nielsen, M.\u00a0A., & Chuang, I. (2002). Quantum computation and quantum information.","DOI":"10.1119\/1.1463744"},{"key":"6253_CR53","doi-asserted-by":"crossref","unstructured":"N\u00fc\u00dflein, J., Gabor, T., Linnhoff-Popien, C., & Feld, S. (2022). Algorithmic QUBO formulations for k-SAT and hamiltonian cycles. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pages 2240\u20132246.","DOI":"10.1145\/3520304.3533952"},{"key":"6253_CR54","unstructured":"Oh, Y.-H., Mohammadbagherpoor, H., Dreher, P., Singh, A., Yu, X., & Rindos, A.\u00a0J. (2019). Solving multi-coloring combinatorial optimization problems using hybrid quantum algorithms. arXiv preprint arXiv:1911.00595."},{"issue":"1","key":"6253_CR55","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo, A., McClean, J., Shadbolt, P., Yung, M. H., Zhou, X. Q., Love, P. J., Aspuru-Guzik, A., & Obrien, J. L. (2014). A variational eigenvalue solver on a photonic quantum processor. Nature communications, 5(1), 4213.","journal-title":"Nature communications"},{"key":"6253_CR56","doi-asserted-by":"crossref","unstructured":"Powell, M.\u00a0J. (1994). A direct search optimization method that models the objective and constraint functions by linear interpolation. Springer.","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"6253_CR57","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79.","journal-title":"Quantum"},{"key":"6253_CR58","unstructured":"Radzihovsky, M., Murphy, J., & Mason, S. (2019). A QAOA solution to the traveling salesman problem using pyQuil."},{"issue":"3","key":"6253_CR59","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.32604\/cmc.2020.010001","volume":"63","author":"Y Ruan","year":"2020","unstructured":"Ruan, Y., Marsh, S., Xue, X., Liu, Z., Wang, J., et al. (2020). The quantum approximate algorithm for solving traveling salesman problem. Computers, Materials & Continua, 63(3), 1237\u20131247.","journal-title":"Computers, Materials & Continua"},{"key":"6253_CR60","unstructured":"Ruder, S. (2016). An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747."},{"key":"6253_CR61","doi-asserted-by":"publisher","first-page":"491","DOI":"10.22331\/q-2021-07-01-491","volume":"5","author":"SH Sack","year":"2021","unstructured":"Sack, S. H., & Serbyn, M. (2021). Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum, 5, 491.","journal-title":"Quantum"},{"key":"6253_CR62","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume":"10","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A. (2003). Monte Carlo sampling methods. Handbooks in Operations Research and Management Science, 10, 353\u2013425.","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"6253_CR63","doi-asserted-by":"crossref","unstructured":"Shor, P.\u00a0W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science, pages 124\u2013134. Ieee, .","DOI":"10.1109\/SFCS.1994.365700"},{"key":"6253_CR64","doi-asserted-by":"crossref","unstructured":"Soloviev, V.\u00a0P., Larra\u00f1aga, P., & Bielza, C. (2022). Quantum parametric circuit optimization with estimation of distribution algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pages 2247\u20132250.","DOI":"10.1145\/3520304.3533963"},{"issue":"3","key":"6253_CR65","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"JC Spall","year":"1992","unstructured":"Spall, J. C. (1992). Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Transactions on Automatic Control, 37(3), 332\u2013341.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6253_CR66","doi-asserted-by":"crossref","unstructured":"Tabi, Z., El-Safty, K.\u00a0H., Kallus, Z., H\u00e1ga, P., Kozsik, T., Glos, A., & Zimbor\u00e1s, Z. (2020). Quantum optimization for the graph coloring problem with space-efficient embedding. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 56\u201362. IEEE.","DOI":"10.1109\/QCE49297.2020.00018"},{"issue":"2","key":"6253_CR67","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304","volume":"97","author":"Z Wang","year":"2018","unstructured":"Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018). Quantum approximate optimization algorithm for MaxCut: A fermionic view. Physical Review A, 97(2), 022304.","journal-title":"Physical Review A"},{"issue":"4","key":"6253_CR68","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.042612","volume":"103","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J., & Love, P. (2021). Maxcut quantum approximate optimization algorithm performance guarantees for p> 1. Physical Review A, 103(4), 042612.","journal-title":"Physical Review A"},{"key":"6253_CR69","doi-asserted-by":"publisher","first-page":"635","DOI":"10.22331\/q-2022-01-27-635","volume":"6","author":"J Wurtz","year":"2022","unstructured":"Wurtz, J., & Love, P. J. (2022). Counterdiabaticity and the quantum approximate optimization algorithm. Quantum, 6, 635.","journal-title":"Quantum"},{"issue":"2","key":"6253_CR70","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.7.021027","volume":"7","author":"Z-C Yang","year":"2017","unstructured":"Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017). Optimizing variational quantum algorithms using Pontryagin\u2019s minimum principle. Physical Review X, 7(2), 021027.","journal-title":"Physical Review X"},{"issue":"2","key":"6253_CR71","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020). Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Physical Review X, 10(2), 021067.","journal-title":"Physical Review X"},{"issue":"3","key":"6253_CR72","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.033029","volume":"4","author":"L Zhu","year":"2022","unstructured":"Zhu, L., Tang, H. L., Barron, G. S., Calderon-Vargas, F., Mayhall, N. J., Barnes, E., & Economou, S. E. (2022). Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Physical Review Research, 4(3), 033029.","journal-title":"Physical Review Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06253-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06253-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06253-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T12:17:36Z","timestamp":1734351456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06253-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,13]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6253"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06253-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,13]]},"assertion":[{"value":"17 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}