{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T08:21:48Z","timestamp":1787559708269,"version":"build-2736575974"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Program for Quantum Science and Technology","award":["2021ZD0302901"],"award-info":[{"award-number":["2021ZD0302901"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20231142"],"award-info":[{"award-number":["BK20231142"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s42484-026-00436-y","type":"journal-article","created":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T08:01:24Z","timestamp":1787558484000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum alternating operator ansatz with block-ring mixer and hot-start strategy for graph edit distance problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Wenjie","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiajun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinran","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,24]]},"reference":[{"key":"436_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110296","volume":"142","author":"G Acampora","year":"2023","unstructured":"Acampora G, Chiatto A, Vitiello A (2023) Genetic algorithms as classical optimizer for the quantum approximate optimization algorithm. Appl Soft Comput 142:110296. https:\/\/doi.org\/10.1016\/j.asoc.2023.110296","journal-title":"Appl Soft Comput"},{"key":"436_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.coche.2021.100754","volume":"36","author":"MP Andersson","year":"2022","unstructured":"Andersson MP, Jones MN, Mikkelsen KV, You F, Mansouri SS (2022) Quantum computing for chemical and biomolecular product design. Curr Opin Chem Eng 36:100754. https:\/\/doi.org\/10.1016\/j.coche.2021.100754","journal-title":"Curr Opin Chem Eng"},{"issue":"7","key":"436_CR3","doi-asserted-by":"publisher","first-page":"7564","DOI":"10.1109\/TITS.2022.3172241","volume":"24","author":"U Azad","year":"2023","unstructured":"Azad U, Behera BK, Ahmed EA, Panigrahi PK, Farouk A (2023) Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Trans Intell Transp Syst 24(7):7564\u20137573. https:\/\/doi.org\/10.1109\/TITS.2022.3172241","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"436_CR4","first-page":"1368","volume":"33","author":"J Bausch","year":"2020","unstructured":"Bausch J (2020) Recurrent quantum neural networks. Adv Neural Inf Process Syst 33:1368\u20131379","journal-title":"Adv Neural Inf Process Syst"},{"issue":"4","key":"436_CR5","doi-asserted-by":"publisher","first-page":"043001","DOI":"10.1088\/2058-9565\/ab4eb5","volume":"4","author":"M Benedetti","year":"2019","unstructured":"Benedetti M, Lloyd E, Sack S, Fiorentini M (2019) Parameterized quantum circuits as machine learning models. Quantum Sci Technol 4(4):043001. https:\/\/doi.org\/10.1088\/2058-9565\/ab4eb5","journal-title":"Quantum Sci Technol"},{"key":"436_CR6","doi-asserted-by":"publisher","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. Phys Rep 1068:1\u201366. https:\/\/doi.org\/10.1016\/j.physrep.2024.03.002","DOI":"10.1016\/j.physrep.2024.03.002"},{"key":"436_CR7","doi-asserted-by":"publisher","unstructured":"Bougleux, S., Ga\u00fczere, B., Brun, L (2016) Graph edit distance as a quadratic program. In: 2016 23rd International conference on pattern recognition (ICPR), pp 1701\u20131706. https:\/\/doi.org\/10.1109\/ICPR.2016.7899881. IEEE","DOI":"10.1109\/ICPR.2016.7899881"},{"issue":"9","key":"436_CR8","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 SC, Endo S, Fujii K, McClean JR, Mitarai K, Yuan X, Cincio L et al (2021) Variational quantum algorithms. Nat Rev Phys 3(9):625\u2013644. https:\/\/doi.org\/10.1038\/s42254-021-00348-9","journal-title":"Nat Rev Phys"},{"key":"436_CR9","doi-asserted-by":"publisher","unstructured":"Chalupnik M, Melo H, Alexeev Y, Galda A (2022) Augmenting qaoa ansatz with multiparameter problem-independent layer. In: 2022 IEEE international conference on quantum computing and engineering (QCE), pp 97\u2013103. https:\/\/doi.org\/10.1109\/QCE53715.2022.00028","DOI":"10.1109\/QCE53715.2022.00028"},{"key":"436_CR10","doi-asserted-by":"publisher","unstructured":"Cook J, Eidenbenz S, B\u00e4rtschi A (2020) The quantum alternating operator ansatz on maximum k-vertex cover. In: 2020 IEEE international conference on quantum computing and engineering (QCE). IEEE, pp 83\u201392. https:\/\/doi.org\/10.1109\/QCE49297.2020.00021","DOI":"10.1109\/QCE49297.2020.00021"},{"issue":"1907","key":"436_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch D, Jozsa R (1992) Rapid solution of problems by quantum computation. Proc R Soc Lond Ser A Math Phys Sci 439(1907):553\u2013558. https:\/\/doi.org\/10.1098\/rspa.1992.0167","journal-title":"Proc R Soc Lond Ser A Math Phys Sci"},{"key":"436_CR12","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A Quantum Approximate Optimization Algorithm"},{"issue":"2","key":"436_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s42979-020-00437-z","volume":"2","author":"FG Fuchs","year":"2021","unstructured":"Fuchs FG, Kolden H\u00d8, Aase NH, Sartor G (2021) Efficient encoding of the weighted max k-cut on a quantum computer using qaoa. SN Comput Sci 2(2):89. https:\/\/doi.org\/10.1007\/s42979-020-00437-z","journal-title":"SN Comput Sci"},{"issue":"23","key":"436_CR14","doi-asserted-by":"publisher","first-page":"4709","DOI":"10.1103\/PhysRevLett.79.4709","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover LK (1997) Quantum computers can search arbitrarily large databases by a single query. Phys Rev Lett 79(23):4709. https:\/\/doi.org\/10.1103\/PhysRevLett.79.4709","journal-title":"Phys Rev Lett"},{"key":"436_CR15","doi-asserted-by":"publisher","unstructured":"Hadfield S, Wang Z, O\u2019gorman B, Rieffel EG, Venturelli D, Biswas R (2019) From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2):34. https:\/\/doi.org\/10.3390\/a12020034","DOI":"10.3390\/a12020034"},{"issue":"1","key":"436_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1038\/s41534-023-00787-5","volume":"9","author":"Z He","year":"2023","unstructured":"He Z, Shaydulin R, Chakrabarti S, Herman D, Li C, Sun Y, Pistoia M (2023) Alignment between initial state and mixer improves qaoa performance for constrained optimization. NPJ Quantum Inf 9(1):121. https:\/\/doi.org\/10.1038\/s41534-023-00787-5","journal-title":"NPJ Quantum Inf"},{"issue":"4","key":"436_CR17","doi-asserted-by":"publisher","first-page":"042030","DOI":"10.1103\/PhysRevResearch.4.L042030","volume":"4","author":"NN Hegade","year":"2022","unstructured":"Hegade NN, Chen X, Solano E (2022) Digitized counterdiabatic quantum optimization. Phys Rev Res 4(4):042030. https:\/\/doi.org\/10.1103\/PhysRevResearch.4.L042030","journal-title":"Phys Rev Res"},{"issue":"1","key":"436_CR18","doi-asserted-by":"publisher","first-page":"6781","DOI":"10.1038\/s41598-022-10555-8","volume":"12","author":"R Herrman","year":"2022","unstructured":"Herrman R, Lotshaw PC, Ostrowski J, Humble TS, Siopsis G (2022) Multi-angle quantum approximate optimization algorithm. Sci Rep 12(1):6781. https:\/\/doi.org\/10.1038\/s41598-022-10555-8","journal-title":"Sci Rep"},{"issue":"2","key":"436_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s42484-022-00077-x","volume":"4","author":"M Incudini","year":"2022","unstructured":"Incudini M, Tarocco F, Mengoni R, Di Pierro A, Mandarino A (2022) Computing graph edit distance on quantum devices. Quantum Mach Intell 4(2):24. https:\/\/doi.org\/10.1007\/s42484-022-00077-x","journal-title":"Quantum Mach Intell"},{"key":"436_CR20","doi-asserted-by":"publisher","unstructured":"Oh E, Lee H (2024) Quantum mechanics-based missing value estimation framework for industrial data. Expert Syst Appl 236:121385. https:\/\/doi.org\/10.1016\/j.eswa.2023.121385","DOI":"10.1016\/j.eswa.2023.121385"},{"key":"436_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1038\/s41534-024-00825-w","volume":"10","author":"E Pelofske","year":"2024","unstructured":"Pelofske E, B\u00e4rtschi A, Eidenbenz S (2024) Short-depth qaoa circuits and quantum annealing on higher-order ising models. NPJ Quantum Inf 10:30. https:\/\/doi.org\/10.1038\/s41534-024-00825-w","journal-title":"NPJ Quantum Inf"},{"key":"436_CR22","doi-asserted-by":"publisher","unstructured":"Peruzzo A, McClean J, Shadbolt P, Yung M-H, Zhou X-Q, Love PJ, Aspuru-Guzik A, O\u2019brien JL (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5(1):4213. https:\/\/doi.org\/10.1038\/ncomms5213","DOI":"10.1038\/ncomms5213"},{"key":"436_CR23","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. https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"issue":"1","key":"436_CR24","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1038\/s41534-021-00368-4","volume":"7","author":"A Robert","year":"2021","unstructured":"Robert A, Barkoutsos PK, Woerner S, Tavernelli I (2021) Resource-efficient quantum algorithm for protein folding. NPJ Quantum Inf 7(1):38. https:\/\/doi.org\/10.1038\/s41534-021-00368-4","journal-title":"NPJ Quantum Inf"},{"key":"436_CR25","doi-asserted-by":"publisher","unstructured":"Ruan Y, Yuan Z, Xue X, Liu Z (2023) Quantum approximate optimization for combinatorial problems with constraints. Inf Sci 619:98\u2013125. https:\/\/doi.org\/10.1016\/j.ins.2022.11.020","DOI":"10.1016\/j.ins.2022.11.020"},{"key":"436_CR26","doi-asserted-by":"crossref","unstructured":"Schiavello F, Altamura E, Tavernelli I, Mensa S, Symons B (2024) Evolving a multi-population evolutionary-QAOA on distributed QPUs","DOI":"10.1109\/QCE65121.2025.00012"},{"issue":"2","key":"436_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0097539795293172","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev 41(2):303\u2013332. https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM Rev"},{"issue":"5","key":"436_CR28","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon DR (1997) On the power of quantum computation. SIAM J Comput 26(5):1474\u20131483. https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J Comput"},{"issue":"3","key":"436_CR29","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 (2020) Applying the quantum approximate optimization algorithm to the tail-assignment problem. Phys Rev Appl 14(3):034009. https:\/\/doi.org\/10.1103\/PhysRevApplied.14.034009","journal-title":"Phys Rev Appl"},{"issue":"7","key":"436_CR30","doi-asserted-by":"publisher","DOI":"10.1088\/1402-4896\/ade378","volume":"100","author":"X Wang","year":"2025","unstructured":"Wang X (2025) Bighorn sheep optimization algorithm: a novel and efficient approach for wireless sensor network coverage optimization. Phys Scr 100(7):075230","journal-title":"Phys Scr"},{"key":"436_CR31","doi-asserted-by":"crossref","unstructured":"Wang X, Yao L (2025) Cape lynx optimizer: A novel metaheuristic algorithm for enhancing wireless sensor network coverage. Measurement 118361","DOI":"10.1016\/j.measurement.2025.118361"},{"key":"436_CR32","doi-asserted-by":"publisher","unstructured":"Wang Z, Rubin NC, Dominy JM, Rieffel EG (2020) $$xy$$ mixers: Analytical and numerical results for the quantum alternating operator ansatz. Phys Rev A 101:012320. https:\/\/doi.org\/10.1103\/PhysRevA.101.012320","DOI":"10.1103\/PhysRevA.101.012320"},{"issue":"3","key":"436_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.030320","volume":"5","author":"MT West","year":"2024","unstructured":"West MT, Heredge J, Sevior M, Usman M (2024) Provably trainable rotationally equivariant quantum machine learning. PRX Quantum 5(3):030320. https:\/\/doi.org\/10.1103\/PRXQuantum.5.030320","journal-title":"PRX Quantum"},{"key":"436_CR34","doi-asserted-by":"publisher","unstructured":"Wu Q, Liu W, Huang Y, Liu H, Xiao H, Li Z (2024) A degressive quantum convolutional neural network for quantum state classification and code recognition. Iscience 27(4). https:\/\/doi.org\/10.1016\/j.isci.2024.109394","DOI":"10.1016\/j.isci.2024.109394"},{"key":"436_CR35","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 PJ (2022) Counterdiabaticity and the quantum approximate optimization algorithm. Quantum 6:635. https:\/\/doi.org\/10.22331\/q-2022-01-27-635","journal-title":"Quantum"},{"key":"436_CR36","doi-asserted-by":"publisher","unstructured":"Yang Y, Tian J, Lei H, Zhou Y, Shi W (2016) Novel quantum image encryption using one-dimensional quantum cellular automata. Inf Sci 345:257\u2013270. https:\/\/doi.org\/10.1016\/j.ins.2016.01.078","DOI":"10.1016\/j.ins.2016.01.078"},{"key":"436_CR37","unstructured":"Ye X, Yan G, Yan J (2023) Towards quantum machine learning for constrained combinatorial optimization: a quantum qap solver. In: International conference on machine learning. PMLR, pp 39903\u201339912"},{"issue":"2","key":"436_CR38","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 MD (2020) Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys Rev X 10(2):021067. https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys Rev X"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00436-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00436-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00436-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T08:01:27Z","timestamp":1787558487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00436-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,24]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["436"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00436-y","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,24]]},"assertion":[{"value":"9 May 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing Interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"91"}}