{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:16:07Z","timestamp":1767989767971,"version":"3.49.0"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-024-04560-1","type":"journal-article","created":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T09:01:47Z","timestamp":1728464507000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications"],"prefix":"10.1007","volume":"23","author":[{"given":"Matteo","family":"Vandelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Lignarolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Cavazzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Dragoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"issue":"1","key":"4560_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"4560_CR2","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005","journal-title":"Front. Phys."},{"key":"4560_CR3","unstructured":"Lodewijks, B.: Mapping np-hard and np-complete optimisation problems to quadratic unconstrained binary optimisation problems (2020) arXiv:1911.08043 [cs.DS]"},{"issue":"10","key":"4560_CR4","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A Math. Gen. 15(10), 3241 (1982). https:\/\/doi.org\/10.1088\/0305-4470\/15\/10\/028","journal-title":"J. Phys. A Math. Gen."},{"key":"4560_CR5","unstructured":"Farhi, E., Harrow, A.W.: Quantum supremacy through the quantum approximate optimization algorithm (2019) arXiv:1602.07674 [quant-ph]"},{"issue":"1","key":"4560_CR6","doi-asserted-by":"publisher","first-page":"6903","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: Qaoa for max-cut requires hundreds of qubits for quantum speed-up. Sci. Rep. 9(1), 6903 (2019). https:\/\/doi.org\/10.1038\/s41598-019-43176-9","journal-title":"Sci. Rep."},{"issue":"11","key":"4560_CR7","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1038\/s42254-020-00247-5","volume":"2","author":"ER MacQuarrie","year":"2020","unstructured":"MacQuarrie, E.R., Simon, C., Simmons, S., Maine, E.: The emerging commercial landscape of quantum computing. Nat. Rev. Phys. 2(11), 596\u2013598 (2020). https:\/\/doi.org\/10.1038\/s42254-020-00247-5","journal-title":"Nat. Rev. Phys."},{"key":"4560_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.042612","volume":"103","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J., Love, P.: Maxcut quantum approximate optimization algorithm performance guarantees for $$p > 1$$. Phys. Rev. A 103, 042612 (2021). https:\/\/doi.org\/10.1103\/PhysRevA.103.042612","journal-title":"Phys. Rev. A"},{"key":"4560_CR9","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Zhou, L.: The Quantum approximate optimization algorithm and the Sherrington\u2013Kirkpatrick model at infinite size. Quantum 6, 759 (2022) https:\/\/doi.org\/10.22331\/q-2022-07-07-759","DOI":"10.22331\/q-2022-07-07-759"},{"key":"4560_CR10","doi-asserted-by":"publisher","first-page":"021067","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.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys. Rev. X"},{"key":"4560_CR11","unstructured":"Ko\u00dfmann, G., Binkowski, L., Luijk, L., Ziegler, T., Schwonnek, R.: Deep-circuit QAOA (2023) arXiv:2210.12406 [quant-ph]"},{"key":"4560_CR12","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355\u20135363 (1998). https:\/\/doi.org\/10.1103\/PhysRevE.58.5355","journal-title":"Phys. Rev. E"},{"issue":"7346","key":"4560_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., Amin, M.H.S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A.J., Johansson, J., Bunyk, P., Chapple, E.M., Enderud, C., Hilton, J.P., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M.C., Tolkacheva, E., Truncik, C.J.S., Uchaikin, S., Wang, J., Wilson, B., Rose, G.: Quantum annealing with manufactured spins. Nature 473(7346), 194\u2013198 (2011). https:\/\/doi.org\/10.1038\/nature10012","journal-title":"Nature"},{"issue":"3","key":"4560_CR14","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1038\/nphys2900","volume":"10","author":"S Boixo","year":"2014","unstructured":"Boixo, S., R\u00f8nnow, T.F., Isakov, S.V., Wang, Z., Wecker, D., Lidar, D.A., Martinis, J.M., Troyer, M.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10(3), 218\u2013224 (2014). https:\/\/doi.org\/10.1038\/nphys2900","journal-title":"Nat. Phys."},{"key":"4560_CR15","unstructured":"Smelyanskiy, V.N., Rieffel, E.G., Knysh, S.I., Williams, C.P., Johnson, M.W., Thom, M.C., Macready, W.G., Pudenz, K.L.: A Near-term quantum computing approach for hard computational problems in space exploration (2012) arXiv:1204.2821 [quant-ph]"},{"issue":"1","key":"4560_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-014-0892-x","volume":"14","author":"EG Rieffel","year":"2015","unstructured":"Rieffel, E.G., Venturelli, D., O\u2019Gorman, B., Do, M.B., Prystay, E.M., Smelyanskiy, V.N.: A case study in programming a quantum Annealer for hard operational planning problems. Quantum Inf. Process. 14(1), 1\u201336 (2015). https:\/\/doi.org\/10.1007\/s11128-014-0892-x","journal-title":"Quantum Inf. Process."},{"key":"4560_CR17","unstructured":"Venturelli, D., Marchand, D.J.J., Rojo, G.: Quantum annealing implementation of job-shop scheduling (2016) arXiv:1506.08479 [quant-ph]"},{"key":"4560_CR18","doi-asserted-by":"publisher","unstructured":"Clark, J., West, T., Zammit, J., Guo, X., Mason, L., Russell, D.: Towards real time multi-robot routing using quantum computing technologies. In: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region. HPC Asia 2019, pp. 111\u2013119. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3293320.3293333","DOI":"10.1145\/3293320.3293333"},{"issue":"1","key":"4560_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/tits.2019.2891235","volume":"21","author":"T Stollenwerk","year":"2020","unstructured":"Stollenwerk, T., O\u2019Gorman, B., Venturelli, D., Mandra, S., Rodionova, O., Ng, H., Sridhar, B., Rieffel, E.G., Biswas, R.: Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Trans. Intell. Transp. Syst. 21(1), 285\u2013297 (2020). https:\/\/doi.org\/10.1109\/tits.2019.2891235","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"4560_CR20","doi-asserted-by":"publisher","unstructured":"Yarkoni, S., Raponi, E., B\u00c3ck, T., Schmitt, S.: Quantum annealing for industry applications: introduction and review. Reports on Progress in Physics 85(10), 104001 (2022) https:\/\/doi.org\/10.1088\/1361-6633\/ac8c54","DOI":"10.1088\/1361-6633\/ac8c54"},{"key":"4560_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03670-y","author":"K Domino","year":"2022","unstructured":"Domino, K., Kundu, A., Salehi, K.K.: Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing. Quantum Inform. Process. (2022). https:\/\/doi.org\/10.1007\/s11128-022-03670-y","journal-title":"Quantum Inform. Process."},{"key":"4560_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3199267","volume":"3","author":"A Guillaume","year":"2022","unstructured":"Guillaume, A., Goh, E.Y., Johnston, M.D., Wilson, B.D., Ramanan, A., Tibble, F., Lackey, B.: Deep space network scheduling using quantum annealing. IEEE Trans. Quantum Eng. 3, 1\u201313 (2022). https:\/\/doi.org\/10.1109\/TQE.2022.3199267","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4560_CR23","doi-asserted-by":"publisher","unstructured":"Wilson, B., Goh, E., Guillaume, A., Alimo, R., Claudet, T., Venkataram, H.: Automating antenna scheduling problems using quantum computing and deep reinforcement learning. In: IGARSS 2022\u20132022 IEEE International Geoscience and Remote Sensing Symposium, pp. 4915\u20134918 (2022). https:\/\/doi.org\/10.1109\/IGARSS46834.2022.9884342","DOI":"10.1109\/IGARSS46834.2022.9884342"},{"key":"4560_CR24","doi-asserted-by":"publisher","unstructured":"Colucci, G., Linde, S., Phillipson, F.: Power network optimization: A quantum approach. IEEE Access, pp. 1\u20131 (2023) https:\/\/doi.org\/10.1109\/ACCESS.2023.3312997","DOI":"10.1109\/ACCESS.2023.3312997"},{"issue":"1","key":"4560_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1038\/s44172-023-00061-8","volume":"2","author":"H Jing","year":"2023","unstructured":"Jing, H., Wang, Y., Li, Y.: Data-driven quantum approximate optimization algorithm for power systems. Commun. Eng. 2(1), 12 (2023). https:\/\/doi.org\/10.1038\/s44172-023-00061-8","journal-title":"Commun. Eng."},{"key":"4560_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3030609","volume":"1","author":"T Stollenwerk","year":"2020","unstructured":"Stollenwerk, T., Hadfield, S., Wang, Z.: Toward quantum gate-model heuristics for real-world planning problems. IEEE Trans. Quantum Eng. 1, 1\u201316 (2020)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4560_CR27","doi-asserted-by":"crossref","unstructured":"Leonidas, I.D., Dukakis, A., Tan, B., Angelakis, D.G.: Qubit efficient quantum algorithms for the vehicle routing problem on quantum computers of the NISQ era (2023) arXiv:2306.08507 [quant-ph]","DOI":"10.1002\/qute.202300309"},{"key":"4560_CR28","doi-asserted-by":"crossref","unstructured":"Quetschlich, N., Koch, V., Burgholzer, L., Wille, R.: A hybrid classical quantum computing approach to the satellite mission planning problem (2023) arXiv:2308.00029 [quant-ph]","DOI":"10.1109\/QCE57702.2023.00079"},{"key":"4560_CR29","doi-asserted-by":"publisher","first-page":"7062","DOI":"10.1109\/jstars.2023.3287154","volume":"16","author":"S Rainjonneau","year":"2023","unstructured":"Rainjonneau, S., Tokarev, I., Iudin, S., Rayaprolu, S., Pinto, K., Lemtiuzhnikova, D., Koblan, M., Barashov, E., Kordzanganeh, M., Pflitsch, M., Melnikov, A.: Quantum algorithms applied to satellite mission planning for earth observation. IEEE J. Selected Topics Appl. Earth Observ. Remote Sensing 16, 7062\u20137075 (2023). https:\/\/doi.org\/10.1109\/jstars.2023.3287154","journal-title":"IEEE J. Selected Topics Appl. Earth Observ. Remote Sensing"},{"key":"4560_CR30","doi-asserted-by":"publisher","DOI":"10.3390\/electronics11071155","author":"A Carreras-Coch","year":"2022","unstructured":"Carreras-Coch, A., Navarro, J., Sans, C., Zaballos, A.: Communication technologies in emergency situations. Electronics (2022). https:\/\/doi.org\/10.3390\/electronics11071155","journal-title":"Electronics"},{"issue":"8","key":"4560_CR31","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/LCOMM.2016.2578312","volume":"20","author":"M Mozaffari","year":"2016","unstructured":"Mozaffari, M., Saad, W., Bennis, M., Debbah, M.: Efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage. IEEE Commun. Lett. 20(8), 1647\u20131650 (2016). https:\/\/doi.org\/10.1109\/LCOMM.2016.2578312","journal-title":"IEEE Commun. Lett."},{"key":"4560_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dcan.2023.01.007","author":"J Sun","year":"2023","unstructured":"Sun, J., Wang, W., Li, S., Da, Q., Chen, L.: Scheduling optimization for UAV communication coverage using virtual force-based PSO model. Digit. Commun. Netw. (2023). https:\/\/doi.org\/10.1016\/j.dcan.2023.01.007","journal-title":"Digit. Commun. Netw."},{"issue":"3","key":"4560_CR33","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988). https:\/\/doi.org\/10.1287\/opre.36.3.493","journal-title":"Oper. Res."},{"key":"4560_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.023071","volume":"5","author":"T Yoshioka","year":"2023","unstructured":"Yoshioka, T., Sasada, K., Nakano, Y., Fujii, K.: Fermionic quantum approximate optimization algorithm. Phys. Rev. Res. 5, 023071 (2023). https:\/\/doi.org\/10.1103\/PhysRevResearch.5.023071","journal-title":"Phys. Rev. Res."},{"key":"4560_CR35","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014) arXiv:1411.4028 [quant-ph]"},{"key":"4560_CR36","doi-asserted-by":"publisher","first-page":"191","DOI":"10.22331\/q-2019-10-07-191","volume":"3","author":"X Yuan","year":"2019","unstructured":"Yuan, X., Endo, S., Zhao, Q., Li, Y., Benjamin, S.C.: Theory of variational quantum simulation. Quantum 3, 191 (2019). https:\/\/doi.org\/10.22331\/q-2019-10-07-191","journal-title":"Quantum"},{"issue":"9","key":"4560_CR37","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","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., Coles, P.J.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625\u2013644 (2021). https:\/\/doi.org\/10.1038\/s42254-021-00348-9","journal-title":"Nat. Rev. Phys."},{"issue":"4","key":"4560_CR38","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac6973","volume":"7","author":"J Larkin","year":"2022","unstructured":"Larkin, J., Jonsson, M., Justice, D., Guerreschi, G.G.: Evaluation of QAOA based on the approximation ratio of individual samples. Quantum Sci. Technol. 7(4), 045014 (2022). https:\/\/doi.org\/10.1088\/2058-9565\/ac6973","journal-title":"Quantum Sci. Technol."},{"key":"4560_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.042415","volume":"105","author":"Y Chai","year":"2022","unstructured":"Chai, Y., Han, Y.-J., Wu, Y.-C., Li, Y., Dou, M., Guo, G.-P.: Shortcuts to the quantum approximate optimization algorithm. Phys. Rev. A 105, 042415 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.105.042415","journal-title":"Phys. Rev. A"},{"key":"4560_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02748-9","author":"MES Morales","year":"2020","unstructured":"Morales, M.E.S., Biamonte, J.D., Zimbor\u00e1s, Z.: On the universality of the quantum approximate optimization algorithm. Quantum Inform. Process. (2020). https:\/\/doi.org\/10.1007\/s11128-020-02748-9","journal-title":"Quantum Inform. Process."},{"key":"4560_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.124.090504","volume":"124","author":"V Akshay","year":"2020","unstructured":"Akshay, V., Philathong, H., Morales, M.E.S., Biamonte, J.D.: Reachability deficits in quantum approximate optimization. Phys. Rev. Lett. 124, 090504 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.124.090504","journal-title":"Phys. Rev. Lett."},{"key":"4560_CR42","unstructured":"Farhi, E., Gamarnik, D., Gutmann, S.: The quantum approximate optimization algorithm needs to see the whole graph: a typical case (2020) arXiv:2004.09002 [quant-ph]"},{"key":"4560_CR43","doi-asserted-by":"crossref","unstructured":"Binkowski, L., Ko\u00dfmann, G., Ziegler, T., Schwonnek, R.: Elementary proof of QAOA convergence (2023) arXiv:2302.04968 [quant-ph]","DOI":"10.1088\/1367-2630\/ad59bb"},{"key":"4560_CR44","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.013141","volume":"4","author":"P Chandarana","year":"2022","unstructured":"Chandarana, P., Hegade, N.N., Paul, K., Albarr\u00e1n-Arriagada, F., Solano, E., Campo, A., Chen, X.: Digitized-counterdiabatic quantum approximate optimization algorithm. Phys. Rev. Res. 4, 013141 (2022). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.013141","journal-title":"Phys. Rev. Res."},{"key":"4560_CR45","doi-asserted-by":"crossref","unstructured":"Leontica, S., Amaro, D.: Exploring the neighborhood of 1-layer QAOA with instantaneous quantum polynomial circuits (2023) arXiv:2210.05526 [quant-ph]","DOI":"10.1103\/PhysRevResearch.6.013071"},{"key":"4560_CR46","doi-asserted-by":"crossref","unstructured":"Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., Summer, A.: A review on quantum approximate optimization algorithm and its variants (2023) arXiv:2306.09198 [quant-ph]","DOI":"10.1016\/j.physrep.2024.03.002"},{"key":"4560_CR47","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., Mare\u010dek, J., Woerner, S.: Warm-starting quantum optimization. Quantum 5, 479 (2021). https:\/\/doi.org\/10.22331\/q-2021-06-17-479","journal-title":"Quantum"},{"key":"4560_CR48","doi-asserted-by":"crossref","unstructured":"Tate, R., Moondra, J., Gard, B., Mohler, G., Gupta, S.: Warm-started QAOA with custom mixers provably converges and computationally beats Goemans-Williamson\u2019s max-cut at low circuit depths (2023) arXiv:2112.11354 [quant-ph]","DOI":"10.22331\/q-2023-09-26-1121"},{"key":"4560_CR49","unstructured":"Crosson, E., Farhi, E., Lin, C.Y.-Y., Lin, H.-H., Shor, P.: Different strategies for optimization using the quantum adiabatic algorithm (2014) arXiv:1401.7320 [quant-ph]"},{"key":"4560_CR50","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution (2000) arXiv:quant-ph\/0001106 [quant-ph]"},{"key":"4560_CR51","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.022314","volume":"67","author":"T Hogg","year":"2003","unstructured":"Hogg, T.: Adiabatic quantum computing for random satisfiability problems. Phys. Rev. A 67, 022314 (2003). https:\/\/doi.org\/10.1103\/PhysRevA.67.022314","journal-title":"Phys. Rev. A"},{"issue":"5516","key":"4560_CR52","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science 292(5516), 472\u2013475 (2001). https:\/\/doi.org\/10.1126\/science.1057726","journal-title":"Science"},{"key":"4560_CR53","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash, T., Lidar, D.A.: Adiabatic quantum computation. Rev. Mod. Phys. 90, 015002 (2018). https:\/\/doi.org\/10.1103\/RevModPhys.90.015002","journal-title":"Rev. Mod. Phys."},{"key":"4560_CR54","unstructured":"Kremenetski, V., Hogg, T., Hadfield, S., Cotton, S.J., Tubman, N.M.: Quantum alternating operator ansatz (QAOA) phase diagrams and applications for quantum chemistry (2021) arXiv:2108.13056 [quant-ph]"},{"key":"4560_CR55","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L., Kliesch, M.: Training variational quantum algorithms is NP-hard. Phys. Rev. Lett. 127, 120502 (2021). https:\/\/doi.org\/10.1103\/PhysRevLett.127.120502","journal-title":"Phys. Rev. Lett."},{"key":"4560_CR56","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.062404","volume":"107","author":"SH Sack","year":"2023","unstructured":"Sack, S.H., Medina, R.A., Kueng, R., Serbyn, M.: Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement. Phys. Rev. A 107, 062404 (2023). https:\/\/doi.org\/10.1103\/PhysRevA.107.062404","journal-title":"Phys. Rev. A"},{"key":"4560_CR57","doi-asserted-by":"crossref","unstructured":"Tibaldi, S., Vodola, D., Tignone, E., Ercolessi, E.: Bayesian optimization for QAOA (2023) arXiv:2209.03824 [quant-ph]","DOI":"10.1109\/TQE.2023.3325167"},{"key":"4560_CR58","doi-asserted-by":"crossref","unstructured":"Carrascal, G., Roman, B., Botella, G., Barrio, A.: Differential evolution VQE for crypto-currency arbitrage. quantum optimization with many local minima (2023) arXiv:2308.01427 [quant-ph]","DOI":"10.1016\/j.dsp.2024.104464"},{"key":"4560_CR59","doi-asserted-by":"publisher","unstructured":"Brandao, F.G.S.L., Broughton, M., Farhi, E., Gutmann, S., Neven, H.: For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances (2018) https:\/\/doi.org\/10.48550\/ARXIV.1812.04170","DOI":"10.48550\/ARXIV.1812.04170"},{"key":"4560_CR60","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.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"4560_CR61","doi-asserted-by":"publisher","unstructured":"Qiskit contributors: Qiskit: An open-source framework for quantum computing (2023) https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"4560_CR62","doi-asserted-by":"publisher","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, \u0130., Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P., SciPy 1.0 Contributors: SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17, 261\u2013272 (2020) https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"4560_CR63","doi-asserted-by":"crossref","unstructured":"Scriva, G., Astrakhantsev, N., Pilati, S., Mazzola, G.: Challenges of variational quantum optimization with measurement shot noise (2023) arXiv:2308.00044 [quant-ph]","DOI":"10.1103\/PhysRevA.109.032408"},{"key":"4560_CR64","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.033154","volume":"4","author":"JF Gonthier","year":"2022","unstructured":"Gonthier, J.F., Radin, M.D., Buda, C., Doskocil, E.J., Abuan, C.M., Romero, J.: Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis. Phys. Rev. Res. 4, 033154 (2022). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.033154","journal-title":"Phys. Rev. Res."},{"issue":"7965","key":"4560_CR65","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1038\/s41586-023-06096-3","volume":"618","author":"Y Kim","year":"2023","unstructured":"Kim, Y., Eddins, A., Anand, S., Wei, K.X., Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., Kandala, A.: Evidence for the utility of quantum computing before fault tolerance. Nature 618(7965), 500\u2013505 (2023). https:\/\/doi.org\/10.1038\/s41586-023-06096-3","journal-title":"Nature"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04560-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04560-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04560-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T10:15:09Z","timestamp":1730542509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04560-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"references-count":65,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["4560"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04560-1","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"15 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing commercial or financial interest that could be construed as a potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"344"}}