{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:43:25Z","timestamp":1778211805316,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371069"],"award-info":[{"award-number":["62371069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371069"],"award-info":[{"award-number":["62371069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371069"],"award-info":[{"award-number":["62371069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371069"],"award-info":[{"award-number":["62371069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371069"],"award-info":[{"award-number":["62371069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171056"],"award-info":[{"award-number":["62171056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272056"],"award-info":[{"award-number":["62272056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04783-w","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T07:38:35Z","timestamp":1749195515000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum alternating operator ansatz for solving the minimum dominating set problem on sparse graphs with a specific structure"],"prefix":"10.1007","volume":"24","author":[{"given":"Guanghui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shasha","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiumei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujuan","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fenzhuo","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengping","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"4783_CR1","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE, Santa Fe (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"4783_CR2","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM, Philadelphia (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"15","key":"4783_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"key":"4783_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-022-3511-5","volume":"65","author":"Z Wang","year":"2022","unstructured":"Wang, Z., Wei, S., Long, G.L., Hanzo, L.: Variational quantum attacks threaten advanced encryption standard based symmetric cryptography. Sci. China Inf. Sci. 65, 200503 (2022). https:\/\/doi.org\/10.1007\/s11432-022-3511-5","journal-title":"Sci. China Inf. Sci."},{"key":"4783_CR5","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.22331\/q-2023-11-22-1188","volume":"7","author":"C Bravo-Prieto","year":"2023","unstructured":"Bravo-Prieto, C., LaRose, R., Cerezo, M., Subasi, Y., Cincio, L., Coles, P.J.: Variational quantum linear solver. Quantum 7, 1188 (2023). https:\/\/doi.org\/10.22331\/q-2023-11-22-1188","journal-title":"Quantum"},{"issue":"7","key":"4783_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11128-023-04010-4","volume":"22","author":"Z Wang","year":"2023","unstructured":"Wang, Z., Liang, K., Bao, X., Wu, T.: Quantum speedup for solving the minimum vertex cover problem based on grover search algorithm. Quantum Inf. Process. 22(7), 271 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04010-4","journal-title":"Quantum Inf. Process."},{"issue":"9","key":"4783_CR7","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1038\/nphys3029","volume":"10","author":"S Lloyd","year":"2014","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum principal component analysis. Nat. Phys. 10(9), 631\u2013633 (2014). https:\/\/doi.org\/10.1038\/nphys3029","journal-title":"Nat. Phys."},{"issue":"10","key":"4783_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/s11128-023-04139-2","volume":"22","author":"F Wang","year":"2023","unstructured":"Wang, F., Xie, K., Han, L., Han, M., Wang, Z.: Research on support vector machine optimization based on improved quantum genetic algorithm. Quantum Inf. Process. 22(10), 380 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04139-2","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"4783_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-023-2337-2","volume":"67","author":"Y Song","year":"2024","unstructured":"Song, Y., Wu, Y., Wu, S., Li, D., Wen, Q., Qin, S., Gao, F.: A quantum federated learning framework for classical clients. Sci. China Phys. Mech. Astron. 67(5), 250311 (2024). https:\/\/doi.org\/10.1007\/s11433-023-2337-2","journal-title":"Sci. China Phys. Mech. Astron."},{"issue":"5","key":"4783_CR10","doi-asserted-by":"publisher","first-page":"2300419","DOI":"10.1002\/qute.202300419","volume":"7","author":"XH Ni","year":"2024","unstructured":"Ni, X.H., Cai, B.B., Liu, H.L., Qin, S.J., Gao, F., Wen, Q.Y.: Multilevel leapfrogging initialization strategy for quantum approximate optimization algorithm. Adv. Quantum Technol. 7(5), 2300419 (2024). https:\/\/doi.org\/10.1002\/qute.202300419","journal-title":"Adv. Quantum Technol."},{"key":"4783_CR11","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"},{"issue":"1","key":"4783_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.94.015004","volume":"94","author":"K Bharti","year":"2022","unstructured":"Bharti, K., Cervera-Lierta, A., Kyaw, T.H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J.S., Menke, T.: Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 94(1), 015004 (2022). https:\/\/doi.org\/10.1103\/RevModPhys.94.015004","journal-title":"Rev. Mod. Phys."},{"key":"4783_CR13","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A Quantum Approximate Optimization Algorithm (2014). arxiv:1411.4028"},{"issue":"3","key":"4783_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.14.034009","volume":"14","author":"P Vikst\u00e5l","year":"2020","unstructured":"Vikst\u00e5l, P., Gr\u00f6nkvist, M., Svensson, M., Andersson, M., Johansson, G., Ferrini, G.: Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys. Rev. Appl. 14(3), 034009 (2020). https:\/\/doi.org\/10.1103\/PhysRevApplied.14.034009","journal-title":"Phys. Rev. Appl."},{"key":"4783_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108554","volume":"118","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Mu, X., Liu, X.W., Wang, X., Zhang, X., Li, K., Wu, T., Zhao, D., Dong, C.: Applying the quantum approximate optimization algorithm to the minimum vertex cover problem. Appl. Soft Comput. 118, 108554 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.108554","journal-title":"Appl. Soft Comput."},{"key":"4783_CR16","doi-asserted-by":"publisher","unstructured":"Hadfield, S., Wang, Z., Rieffel, E.G., O\u2019Gorman, B., Venturelli, D., Biswas, R.: Quantum approximate optimization with hard and soft constraints. In: Proceedings of the Second International Workshop on Post Moores Era Supercomputing, pp. 15\u201321. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3149526.3149530","DOI":"10.1145\/3149526.3149530"},{"issue":"2","key":"4783_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019). https:\/\/doi.org\/10.3390\/a12020034","journal-title":"Algorithms"},{"issue":"04","key":"4783_CR18","doi-asserted-by":"publisher","first-page":"2050011","DOI":"10.1142\/S0219749920500112","volume":"18","author":"ZH Saleem","year":"2020","unstructured":"Saleem, Z.H.: Max-independent set and the quantum alternating operator ansatz. Int. J. Quantum Inf. 18(04), 2050011 (2020). https:\/\/doi.org\/10.1142\/S0219749920500112","journal-title":"Int. J. Quantum Inf."},{"key":"4783_CR19","doi-asserted-by":"publisher","unstructured":"Cook, J., Eidenbenz, S., B\u00e4rtschi, A.: The quantum alternating operator ansatz on maximum k-vertex cover. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 83\u201392. IEEE, Denver, CO, USA (2020). https:\/\/doi.org\/10.1109\/QCE49297.2020.00021","DOI":"10.1109\/QCE49297.2020.00021"},{"key":"4783_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.129089","volume":"626","author":"SS Wang","year":"2023","unstructured":"Wang, S.S., Liu, H.L., Song, Y.Q., Gao, F., Qin, S.J., Wen, Q.Y.: Quantum alternating operator ansatz for solving the minimum exact cover problem. Physica A 626, 129089 (2023). https:\/\/doi.org\/10.1016\/j.physa.2023.129089","journal-title":"Physica A"},{"key":"4783_CR21","doi-asserted-by":"publisher","unstructured":"Golden, J., B\u00e4rtschi, A., O\u2019Malley, D., Eidenbenz, S.: The quantum alternating operator ansatz for satisfiability problems. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 307\u2013312. IEEE, Bellevue, WA, USA (2023). https:\/\/doi.org\/10.1109\/QCE57702.2023.00042","DOI":"10.1109\/QCE57702.2023.00042"},{"key":"4783_CR22","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.11.020","volume":"619","author":"Y Ruan","year":"2023","unstructured":"Ruan, Y., Yuan, Z., Xue, X., Liu, Z.: Quantum approximate optimization for combinatorial problems with constraints. Inform. Sciences 619, 98\u2013125 (2023). https:\/\/doi.org\/10.1016\/j.ins.2022.11.020","journal-title":"Inform. Sciences"},{"key":"4783_CR23","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society Colloquium Publications, vol. 38. AMS, Providence (1962)","DOI":"10.1090\/coll\/038"},{"key":"4783_CR24","first-page":"185","volume":"7","author":"AH Karbasi","year":"2013","unstructured":"Karbasi, A.H., Atani, R.E.: Application of dominating sets in wireless sensor networks. Int. J. Secur. Its Appl 7, 185\u2013202 (2013)","journal-title":"Int. J. Secur. Its Appl"},{"key":"4783_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ymeth.2015.12.017","volume":"102","author":"JC Nacher","year":"2016","unstructured":"Nacher, J.C., Akutsu, T.: Minimum dominating set-based methods for analyzing biological networks. Methods 102, 57\u201363 (2016). https:\/\/doi.org\/10.1016\/j.ymeth.2015.12.017","journal-title":"Methods"},{"key":"4783_CR26","doi-asserted-by":"publisher","unstructured":"Kim, D., Li, D., Asgari, O., Li, Y., Tokuta, A.O.: A dominating set based approach to identify effective leader group of social network. In: Du, D.Z., Zhang, G. (eds.) International Computing and Combinatorics Conference, pp. 841\u2013848. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38768-5_77","DOI":"10.1007\/978-3-642-38768-5_77"},{"key":"4783_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ins.2017.10.033","volume":"426","author":"D Chalupa","year":"2018","unstructured":"Chalupa, D.: An order-based algorithm for minimum dominating set with application in graph mining. Inform. Sciences 426, 101\u2013116 (2018). https:\/\/doi.org\/10.1016\/j.ins.2017.10.033","journal-title":"Inform. Sciences"},{"key":"4783_CR28","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) Graph-Theoretic Concepts in Computer Science, pp. 245\u2013256. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_21","DOI":"10.1007\/978-3-540-30559-0_21"},{"key":"4783_CR29","doi-asserted-by":"publisher","unstructured":"Jiang, H., Zheng, Z.: An exact algorithm for the minimum dominating set problem. In: Elkind, E. (ed.) Proceedings of the 32th International Joint Conference on Artificial Intelligence. IJCAI \u201923, pp. 5604\u20135612. IJCAI, Macao (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/622","DOI":"10.24963\/ijcai.2023\/622"},{"key":"4783_CR30","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.dam.2016.01.038","volume":"216","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Heggernes, P., Kant\u00e9, M.M., Kratsch, D., Villanger, Y.: Minimal dominating sets in interval graphs and trees. Discrete Appl. Math. 216, 162\u2013170 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.01.038","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"4783_CR31","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ipl.2013.11.008","volume":"114","author":"W Wawrzyniak","year":"2014","unstructured":"Wawrzyniak, W.: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Inform. Process. Lett. 114(3), 94\u201398 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2013.11.008","journal-title":"Inform. Process. Lett."},{"key":"4783_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.dam.2021.06.004","volume":"303","author":"K Kurita","year":"2021","unstructured":"Kurita, K., Wasa, K., Arimura, H., Uno, T.: Efficient enumeration of dominating sets for sparse graphs. Discrete Appl. Math. 303, 283\u2013295 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.06.004","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"4783_CR33","doi-asserted-by":"publisher","first-page":"5650364","DOI":"10.1155\/2017\/5650364","volume":"2017","author":"S Alharbi","year":"2017","unstructured":"Alharbi, S., Venkat, I.: A genetic algorithm based approach for solving the minimum dominating set of queens problem. J. Optim. 2017(1), 5650364 (2017). https:\/\/doi.org\/10.1155\/2017\/5650364","journal-title":"J. Optim."},{"key":"4783_CR34","doi-asserted-by":"publisher","unstructured":"Fan, Y., Lai, Y., Li, C., Li, N., Ma, Z., Zhou, J., Latecki, L.J., Su, K.: Efficient local search for minimum dominating sets in large graphs. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) International Conference on Database Systems for Advanced Applications, pp. 211\u2013228. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18579-4_13","DOI":"10.1007\/978-3-030-18579-4_13"},{"key":"4783_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.matcom.2022.12.018","volume":"207","author":"A Casado","year":"2023","unstructured":"Casado, A., Bermudo, S., L\u00f3pez-S\u00e1nchez, A., S\u00e1nchez-Oro, J.: An iterated greedy algorithm for finding the minimum dominating set in graphs. Math. Comput. Simul. 207, 41\u201358 (2023). https:\/\/doi.org\/10.1016\/j.matcom.2022.12.018","journal-title":"Math. Comput. Simul."},{"issue":"1","key":"4783_CR36","doi-asserted-by":"publisher","first-page":"4205","DOI":"10.1038\/s41598-023-30600-4","volume":"13","author":"R Wong","year":"2023","unstructured":"Wong, R., Chang, W.L., Chung, W.Y., Vasilakos, A.V.: Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks. Sci. Rep. 13(1), 4205 (2023). https:\/\/doi.org\/10.1038\/s41598-023-30600-4","journal-title":"Sci. Rep."},{"issue":"2","key":"4783_CR37","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/ad02e5","volume":"33","author":"H Zhang","year":"2024","unstructured":"Zhang, H., Wang, S., Liu, X., Shen, Y., Wang, Y.: Quantum algorithm for minimum dominating set problem with circuit design. Chin. Phys. B 33(2), 020310 (2024). https:\/\/doi.org\/10.1088\/1674-1056\/ad02e5","journal-title":"Chin. Phys. B"},{"key":"4783_CR38","unstructured":"Pan, H., Lu, C.: QUBO Formulations for Variation of Domination Problem (2024). arxiv:2410.21277"},{"key":"4783_CR39","unstructured":"Guerrero, N.J.: Solving combinatorial optimization problems using the quantum approximation optimization algorithm. Master\u2019s thesis, Air Force Institute of Technology (2020). https:\/\/scholar.afit.edu\/etd\/3263"},{"key":"4783_CR40","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.: Grover mixers for qaoa: Shifting complexity from mixer design to state preparation. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 72\u201382. IEEE, Denver, CO, USA (2020). https:\/\/doi.org\/10.1109\/QCE49297.2020.00020","DOI":"10.1109\/QCE49297.2020.00020"},{"key":"4783_CR41","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.: Short-depth circuits for dicke state preparation. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 87\u201396. IEEE, Broomfield, CO, USA (2022). https:\/\/doi.org\/10.1109\/QCE53715.2022.00027","DOI":"10.1109\/QCE53715.2022.00027"},{"key":"4783_CR42","doi-asserted-by":"publisher","first-page":"677","DOI":"10.22331\/q-2022-03-30-677","volume":"6","author":"D Wierichs","year":"2022","unstructured":"Wierichs, D., Izaac, J., Wang, C., Lin, C.Y.-Y.: General parameter-shift rules for quantum gradients. Quantum 6, 677 (2022). https:\/\/doi.org\/10.22331\/q-2022-03-30-677","journal-title":"Quantum"},{"issue":"1","key":"4783_CR43","doi-asserted-by":"publisher","first-page":"4812","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.: Barren plateaus in quantum neural network training landscapes. Nat. Commun. 9(1), 4812 (2018). https:\/\/doi.org\/10.1038\/s41467-018-07090-4","journal-title":"Nat. Commun."},{"key":"4783_CR44","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.: Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5, 491 (2021). https:\/\/doi.org\/10.22331\/q-2021-07-01-491","journal-title":"Quantum"},{"key":"4783_CR45","unstructured":"Hao, T., He, Z., Shaydulin, R., Larson, J., Pistoia, M.: End-to-End Protocol for High-Quality QAOA Parameters with Few Shots (2024). arxiv:2408.00557"},{"issue":"2","key":"4783_CR46","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s42979-022-01638-4","volume":"4","author":"ZH Saleem","year":"2023","unstructured":"Saleem, Z.H., Tomesh, T., Tariq, B., Suchara, M.: Approaches to constrained quantum approximate optimization. SN Comput. Sci. 4(2), 183 (2023). https:\/\/doi.org\/10.1007\/s42979-022-01638-4","journal-title":"SN Comput. Sci."},{"issue":"1","key":"4783_CR47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.012320","volume":"101","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Rubin, N.C., Dominy, J.M., Rieffel, E.G.: Xy mixers: Analytical and numerical results for the quantum alternating operator ansatz. Phys. Rev. A 101(1), 012320 (2020). https:\/\/doi.org\/10.1103\/PhysRevA.101.012320","journal-title":"Phys. Rev. A"},{"key":"4783_CR48","unstructured":"Donkers, H., Mesman, K., Al-Ars, Z., M\u00f6ller, M.: QPack Scores: Quantitative performance metrics for application-oriented quantum computer benchmarking (2022). arxiv:2205.12142"},{"issue":"4","key":"4783_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3478519","volume":"2","author":"S Hadfield","year":"2021","unstructured":"Hadfield, S.: On the representation of boolean and real functions as hamiltonians for quantum computing. ACM T. Quantum. Comput. 2(4), 1\u201321 (2021). https:\/\/doi.org\/10.1145\/3478519","journal-title":"ACM T. Quantum. Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04783-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04783-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04783-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:02:23Z","timestamp":1751688143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04783-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":49,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["4783"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04783-w","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","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 have no conflict of interest to declare that is relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"166"}}