{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:17:12Z","timestamp":1778692632409,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-026-08511-8","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T14:48:29Z","timestamp":1778510909000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum circuit evolutionary framework applied to the set partitioning problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Bruno O.","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Bloot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo A.","family":"Moret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"key":"8511_CR1","first-page":"97","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch D (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc R Soc Math Phys Eng Sci 400:97\u2013117","journal-title":"Proc R Soc Math Phys Eng Sci"},{"key":"8511_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein E, Vazirani U (1993) Quantum complexity theory. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC\u201993). ACM, pp 11\u201320","DOI":"10.1145\/167088.167097"},{"key":"8511_CR3","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8511_CR4","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC\u201996). ACM, pp 212\u2013219","DOI":"10.1145\/237814.237866"},{"key":"8511_CR5","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":"8511_CR6","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1038\/s42254-024-00770-9","volume":"6","author":"A Abbas","year":"2024","unstructured":"Abbas A, Ambainis A, Augustino B et al (2024) Challenges and opportunities in quantum optimization. Nat Rev Phys 6:718\u2013735","journal-title":"Nat Rev Phys"},{"key":"8511_CR7","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, Coles PJ (2021) Variational quantum algorithms. Nat Rev Phys 3:625\u2013644","journal-title":"Nat Rev Phys"},{"key":"8511_CR8","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 PJ, Aspuru-Guzik A, O\u2019Brien JL (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5:4213","journal-title":"Nat Commun"},{"key":"8511_CR9","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"key":"8511_CR10","doi-asserted-by":"publisher","first-page":"4812","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean JR, Boixo S, Smelyanskiy VN, Babbush R, Neven H (2018) Barren plateaus in quantum neural network training landscapes. Nat Commun 9:4812","journal-title":"Nat Commun"},{"key":"8511_CR11","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1038\/s41467-021-21728-w","volume":"12","author":"M Cerezo","year":"2021","unstructured":"Cerezo M, Sone A, Volkoff T, Cincio L, Coles PJ (2021) Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat Commun 12:1791","journal-title":"Nat Commun"},{"key":"8511_CR12","doi-asserted-by":"publisher","first-page":"6961","DOI":"10.1038\/s41467-021-27045-6","volume":"12","author":"S Wang","year":"2021","unstructured":"Wang S, Enrico Fontana M, Cerezo KS, Sone A, Cincio L, Coles PJ (2021) Noise-induced barren plateaus in variational quantum algorithms. Nat Commun 12:6961","journal-title":"Nat Commun"},{"key":"8511_CR13","doi-asserted-by":"crossref","unstructured":"Franken L, Georgiev B, Mucke S, Wolter M, Heese R, Bauckhage C, Piatkowski N (2022) Quantum circuit evolution on NISQ devices. In: 2022 IEEE Congress on Evolutionary Computation (CEC), pp 1\u20138","DOI":"10.1109\/CEC55065.2022.9870269"},{"issue":"2","key":"8511_CR14","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s11227-024-06875-3","volume":"81","author":"A Simen","year":"2025","unstructured":"Simen A, Bloot R, Pires OM, Nascimento EGS (2025) Evolutionary-enhanced quantum supervised learning model. J Supercomput 81(2):388","journal-title":"J Supercomput"},{"key":"8511_CR15","unstructured":"van Krieken MGC (2006) Solving set partitioning problems using Lagrangian relaxation. PhD thesis, Tilburg University"},{"issue":"2","key":"8511_CR16","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee B, Kochenberger G, Lewis K, Lewis M, Wang H (2008) A new approach for modeling and solving set packing problems. Eur J Oper Res 186(2):504\u2013512","journal-title":"Eur J Oper Res"},{"key":"8511_CR17","doi-asserted-by":"crossref","unstructured":"Lewis M, Kochenberger G, Alidaee B (2008) A new modeling and solution approach for the set-partitioning problem. Comput Oper Res 35(3):807\u2013813. Part Special Issue: New Trends in Locational Analysis","DOI":"10.1016\/j.cor.2006.04.002"},{"issue":"3","key":"8511_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.14.034010","volume":"14","author":"A Bengtsson","year":"2020","unstructured":"Bengtsson A, Vikst\u00e5l P, Warren C, Svensson M, Xiu G, Kockum AF, Krantz P, Kri\u017ean C, Shiri D (2020) Improved success probability with greater circuit depth for the quantum approximate optimization algorithm. Phys Rev Appl 14(3):034010","journal-title":"Phys Rev Appl"},{"issue":"8","key":"8511_CR19","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.3390\/e25081238","volume":"25","author":"W Qian","year":"2023","unstructured":"Qian W, Basili RAM, Eshaghian-Wilner MM, Khokhar A, Luecke G, Vary JP (2023) Comparative study of variations in quantum approximate optimization algorithms for the traveling salesman problem. Entropy 25(8):1238","journal-title":"Entropy"},{"key":"8511_CR20","first-page":"1","volume":"83","author":"L Cheng","year":"2024","unstructured":"Cheng L, Chen YQ, Zhang SX (2024) Quantum approximate optimization via learning-based adaptive optimization. Nat Commun Phys 83:1\u20139","journal-title":"Nat Commun Phys"},{"issue":"22","key":"8511_CR21","doi-asserted-by":"publisher","first-page":"eadm6761","DOI":"10.1126\/sciadv.adm6761","volume":"10","author":"R Shaydulin","year":"2024","unstructured":"Shaydulin R, Li C, Chakrabarti S, DeCross M, Herman D, Kumar N, Larson J, Lykov D, Minssen P, Sun Y, Alexeev Y, Dreiling JM, Gaebler JP, Gatterman TM, Gerber JA, Gilmore K, Gresh D, Hewitt N, Horst CV, Shaohan H, Johansen J, Matheny M, Mengle T, Mills M, Moses SA, Neyenhuis B, Siegfried P, Yalovetzky R, Pistoia M (2024) Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Sci Adv 10(22):eadm6761","journal-title":"Sci Adv"},{"key":"8511_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1038\/s41534-025-01082-1","volume":"11","author":"JA Monta\u00f1ez-Barrera","year":"2025","unstructured":"Monta\u00f1ez-Barrera JA, Michielsen K (2025) Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems. NPJ Quantum Inf 11:131","journal-title":"NPJ Quantum Inf"},{"issue":"1","key":"8511_CR23","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1038\/nature23879","volume":"549","author":"A Kandala","year":"2017","unstructured":"Kandala A, Mezzacapo A, Temme K, Takita M, Brink M, Chow JM, Gambetta JM (2017) Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549(1):242\u2013246","journal-title":"Nature"},{"key":"8511_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2022.08.003","volume":"986","author":"J Tilly","year":"2022","unstructured":"Tilly J, Chen H, Cao S, Picozzi D, Setia K, Li Y, Grant E, Wossnig L, Rungger I, Booth GH, Tennyson J (2022) The variational quantum eigensolver: a review of methods and best practices. Phys Rep 986:1\u2013128","journal-title":"Phys Rep"},{"key":"8511_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s11128-023-04001-5","volume":"22","author":"AS Albino","year":"2023","unstructured":"Albino AS, Bloot R, Gomes RFI (2023) Variable ansatz applied to spectral operator decomposition in a physical superconducting quantum device. Quantum Inf Process 22:233","journal-title":"Quantum Inf Process"},{"key":"8511_CR26","volume-title":"Computers and intractability. A guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of np-completeness. W.H. Freeman, New York"},{"key":"8511_CR27","doi-asserted-by":"publisher","first-page":"L042030","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:L042030","journal-title":"Phys Rev Res"},{"key":"8511_CR28","doi-asserted-by":"crossref","unstructured":"Fernandez BO, Bloot R, Moret MA (2025) Avoiding convergence stagnation in a quantum circuit evolutionary framework through an adaptive cost function. In: 2025 IEEE International Conference on Quantum Computing and Engineering (QCE), pp 1\u20136","DOI":"10.1109\/QCE65121.2025.00215"},{"key":"8511_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-023-02029-1","volume":"18","author":"R Cacao","year":"2024","unstructured":"Cacao R, Cortez LRCT, Forner J, Validi H, de Farias IR, Lya Hicks LL (2024) The set partitioning problem in a quantum context. Optim Lett 18:1\u201317","journal-title":"Optim Lett"},{"key":"8511_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover F, Kochenberger G, Hennig R, Du Y (2022) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Ann Oper Res 314:141\u2013183","journal-title":"Ann Oper Res"},{"key":"8511_CR31","volume-title":"Algorithms for optimization","author":"MJ Kochenderfer","year":"2019","unstructured":"Kochenderfer MJ, Wheeler TA (2019) Algorithms for optimization, 1st edn. The MIT Press, Cambridge","edition":"1"},{"key":"8511_CR32","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005","author":"A Lucas","year":"2014","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Front Phys. https:\/\/doi.org\/10.3389\/fphy.2014.00005","journal-title":"Front Phys"},{"key":"8511_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.012220","volume":"103","author":"T Hatomura","year":"2021","unstructured":"Hatomura T, Takahashi K (2021) Controlling and exploring quantum systems by algebraic expression of adiabatic Gauge potential. Phys Rev A 103:012220","journal-title":"Phys Rev A"},{"key":"8511_CR34","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution. arXiv:quantph\/0001106"},{"key":"8511_CR35","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01609348","volume":"51","author":"M Suzuki","year":"1976","unstructured":"Suzuki M (1976) Generalized trotter\u2019s formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems. Commun Math Phys 51:183\u2013190","journal-title":"Commun Math Phys"},{"key":"8511_CR36","doi-asserted-by":"publisher","unstructured":"Cadavid AG, Montalban I, Dalal A, Solano E, Hegade NN (2023). Efficient DCQO algorithm within the impulse regime for portfolio optimization. Phys. Rev. Applied 22, 054037. https:\/\/doi.org\/10.1103\/PhysRevApplied.22.054037","DOI":"10.1103\/PhysRevApplied.22.054037"},{"key":"8511_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/wbbs-s8fs","volume":"6","author":"S Morawetz","year":"2025","unstructured":"Morawetz S, Polkovnikov A (2025) Universal counterdiabatic driving in Krylov space. PRX Quantum 6:040320","journal-title":"PRX Quantum"},{"key":"8511_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/pqhl-nbtk","volume":"135","author":"JR Fin\u017egar","year":"2025","unstructured":"Fin\u017egar JR, Notarnicola S, Cain M, Lukin MD, Sels D (2025) Counterdiabatic driving with performance guarantees. Phys Rev Lett 135:180602","journal-title":"Phys Rev Lett"},{"key":"8511_CR39","first-page":"51","volume-title":"A direct search optimization method that models the objective and constraint functions by linear interpolation","author":"MJD Powell","year":"1994","unstructured":"Powell MJD (1994) A direct search optimization method that models the objective and constraint functions by linear interpolation. Springer, Dordrecht, pp 51\u201367"},{"key":"8511_CR40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.20.034062","volume":"20","author":"M Svensson","year":"2023","unstructured":"Svensson M, Andersson M, Gr\u00f6nkvist M, Vikst\u00e5l P, Dubhashi D, Ferrini G, Johansson G (2023) Hybrid quantum-classical heuristic to solve large-scale integer linear programs. Phys Rev Appl 20:034062","journal-title":"Phys Rev Appl"},{"key":"8511_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.043210","volume":"5","author":"G Di Bartolomeo","year":"2023","unstructured":"Di Bartolomeo G, Vischi M, Cesa F, Wixinger R, Grossi M, Donadi S, Bassi A (2023) Noisy gates for simulating quantum computers. Phys Rev Res 5:043210","journal-title":"Phys Rev Res"},{"key":"8511_CR42","doi-asserted-by":"publisher","first-page":"558","DOI":"10.22331\/q-2021-10-05-558","volume":"5","author":"A Arrasmith","year":"2021","unstructured":"Arrasmith A, Cerezo M, Czarnik P, Cincio L, Coles PJ (2021) Effect of barren plateaus on gradient-free optimization. Quantum 5:558","journal-title":"Quantum"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08511-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08511-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08511-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:45:45Z","timestamp":1778690745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08511-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":42,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["8511"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08511-8","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"2 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"411"}}