{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:00:40Z","timestamp":1781877640307,"version":"3.54.5"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M2025"],"award-info":[{"award-number":["05M2025"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M20ZBM"],"award-info":[{"award-number":["05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M2025"],"award-info":[{"award-number":["05M2025"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006168","name":"DOE | National Nuclear Security Administration","doi-asserted-by":"publisher","award":["89233218CNA000001"],"award-info":[{"award-number":["89233218CNA000001"]}],"id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006168","name":"DOE | National Nuclear Security Administration","doi-asserted-by":"publisher","award":["89233218CNA000001"],"award-info":[{"award-number":["89233218CNA000001"]}],"id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"publisher","award":["897481"],"award-info":[{"award-number":["897481"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput Sci"],"DOI":"10.1038\/s43588-025-00873-y","type":"journal-article","created":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T09:03:08Z","timestamp":1761296588000},"page":"1168-1177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Quantum approximate multi-objective optimization"],"prefix":"10.1038","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0857-5093","authenticated-orcid":false,"given":"Ayse","family":"Kotil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2673-796X","authenticated-orcid":false,"given":"Elijah","family":"Pelofske","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4508-4262","authenticated-orcid":false,"given":"Stephanie","family":"Riedm\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5523-9807","authenticated-orcid":false,"given":"Daniel J.","family":"Egger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2628-1854","authenticated-orcid":false,"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-4707","authenticated-orcid":false,"given":"Stefan","family":"Woerner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"key":"873_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1038\/s42254-024-00770-9","volume":"6","author":"A Abbas","year":"2024","unstructured":"Abbas, A. et al. Challenges and opportunities in quantum optimization. Nat. Rev. Phys. 6, 718\u2013735 (2024).","journal-title":"Nat. Rev. Phys."},{"key":"873_CR2","unstructured":"Ehrgott, M. Multicriteria Optimization 2nd edn (Springer, 2005)."},{"key":"873_CR3","doi-asserted-by":"crossref","unstructured":"Figueira, J. et al. Easy to say they are hard, but hard to see they are easy\u2014towards a categorization of tractable multiobjective combinatorial optimization problems. J. Multi-Criteria Decis. Anal. 24, 82\u201398 (2016).","DOI":"10.1002\/mcda.1574"},{"key":"873_CR4","doi-asserted-by":"publisher","first-page":"105857","DOI":"10.1016\/j.cor.2022.105857","volume":"145","author":"R Allmendinger","year":"2022","unstructured":"Allmendinger, R., Jaszkiewicz, A., Liefooghe, A. & Tammer, C. What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization. Comput. Oper. Res. 145, 105857 (2022).","journal-title":"Comput. Oper. Res."},{"key":"873_CR5","unstructured":"Bhattacharyya, B., Capriotti, M. & Tate, R. Solving general QUBOs with warm-start QAOA via a reduction to Max-Cut. Preprint at http:\/\/arxiv.org\/abs\/2504.06253 (2025)."},{"key":"873_CR6","doi-asserted-by":"crossref","unstructured":"Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B. & Cross, A. W. Topological and subsystem codes on low-degree graphs with flag qubits. Phys. Rev. X 10, 011022 (2020).","DOI":"10.1103\/PhysRevX.10.011022"},{"key":"873_CR7","unstructured":"IBM Quantum Platform https:\/\/quantum.ibm.com (IBM Quantum, 2025)."},{"key":"873_CR8","doi-asserted-by":"publisher","unstructured":"Romero, S. V., Visuri, A.-M., Cadavid, A. G., Solano, E. & Hegade, N. N. Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization. Commun. Phys. https:\/\/doi.org\/10.1038\/s42005-025-02270-3 (2025).","DOI":"10.1038\/s42005-025-02270-3"},{"key":"873_CR9","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1038\/s41586-023-06096-3","volume":"618","author":"Y Kim","year":"2023","unstructured":"Kim, Y. et al. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 500\u2013505 (2023).","journal-title":"Nature"},{"key":"873_CR10","doi-asserted-by":"crossref","unstructured":"Pelofske, E., B\u00e4rtschi, A. & Eidenbenz, S. Short-depth QAOA circuits and quantum annealing on higher-order Ising models. npj Quantum Inf. 10, 30 (2024).","DOI":"10.1038\/s41534-024-00825-w"},{"key":"873_CR11","doi-asserted-by":"crossref","unstructured":"Pelofske, E., B\u00e4rtschi, A., Cincio, L., Golden, J. & Eidenbenz, S. Scaling whole-chip QAOA for higher-order Ising spin glass models on heavy-hex graphs. npj Quantum Inf. 10, 109 (2024).","DOI":"10.1038\/s41534-024-00906-w"},{"key":"873_CR12","doi-asserted-by":"crossref","unstructured":"Pelofske, E., B\u00e4rtschi, A. & and Eidenbenz, S. Quantum annealing vs. QAOA: 127 qubit higher-order Ising problems on NISQ computers. In High Performance Computing. ISC High Performance 2023 Lecture Notes in Computer Science Vol. 13948 (eds Bhatele, A. et al.) 240\u2013258 (Springer, 2023).","DOI":"10.1007\/978-3-031-32041-5_13"},{"key":"873_CR13","doi-asserted-by":"crossref","unstructured":"Golden, J., Baertschi, A., O\u2019Malley, D., Pelofske, E. & and Eidenbenz, S. JuliQAOA: fast, flexible QAOA simulation. In Proc. SC \u201923 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis 1454\u20131459 (ACM, 2023).","DOI":"10.1145\/3624062.3624220"},{"key":"873_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S. & Shah, V. B. Julia: a fresh approach to numerical computing. SIAM Rev. 59, 65\u201398 (2017).","journal-title":"SIAM Rev."},{"key":"873_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00186-023-00841-0","volume":"100","author":"K D\u00e4chert","year":"2024","unstructured":"D\u00e4chert, K., Fleuren, T. & Klamroth, K. A simple, efficient and versatile objective space algorithm for multiobjective integer programming. Math. Methods Oper. Res. 100, 351\u2013384 (2024).","journal-title":"Math. Methods Oper. Res."},{"key":"873_CR16","unstructured":"IBM Quantum Qiskit Aer. GitHub https:\/\/github.com\/Qiskit\/qiskit-aer (2025)."},{"key":"873_CR17","unstructured":"Javadi-Abhari, A. et al. Quantum computing with Qiskit. Preprint at http:\/\/arxiv.org\/abs\/2405.08810 (2024)."},{"key":"873_CR18","doi-asserted-by":"publisher","first-page":"022434","DOI":"10.1103\/PhysRevA.111.022434","volume":"111","author":"GC Santra","year":"2025","unstructured":"Santra, G. C., Roy, S. S., Egger, D. J. & Hauke, P. Genuine multipartite entanglement in quantum optimization. Phys. Rev. A 111, 022434 (2025).","journal-title":"Phys. Rev. A"},{"key":"873_CR19","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1038\/s43588-024-00709-1","volume":"4","author":"SV Barron","year":"2024","unstructured":"Barron, S. V. et al. Provable bounds for noise-free expectation values computed from noisy samples. Nat. Comput. Sci. 4, 865\u2013875 (2024).","journal-title":"Nat. Comput. Sci."},{"key":"873_CR20","unstructured":"IBM Quantum Roadmap (IBM, accessed 19 April 2025); https:\/\/www.ibm.com\/roadmaps\/quantum.pdf"},{"key":"873_CR21","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von L\u00fccken, C. & Baran, B. Performance metrics in multi-objective optimization. In 2015 Latin American Computing Conference (CLEI) 1\u201311 (IEEE, 2015).","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"873_CR22","doi-asserted-by":"crossref","unstructured":"Fonseca, C. M., Paquete, L. & Lopez-Ibanez, M. An improved dimension-sweep algorithm for the hypervolume indicator. In 2006 IEEE International Conference on Evolutionary Computation 1157\u20131163 (IEEE, 2006).","DOI":"10.1109\/CEC.2006.1688440"},{"key":"873_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.comgeo.2010.03.004","volume":"43","author":"K Bringmann","year":"2010","unstructured":"Bringmann, K. & Friedrich, T. Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. 43, 601\u2013610 (2010).","journal-title":"Comput. Geom."},{"key":"873_CR24","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1109\/TEVC.2020.2969965","volume":"24","author":"J Deng","year":"2020","unstructured":"Deng, J. & Zhang, Q. Combining simple and adaptive Monte Carlo methods for approximating hypervolume. IEEE Trans. Evol. Comput. 24, 896\u2013907 (2020).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"873_CR25","unstructured":"IBM ILOG CPLEX Optimization Studio v.22.1 (IBM, 2024)."},{"key":"873_CR26","unstructured":"Gurobi Optimizer Reference Manual (Gurobi Optimization, 2024)."},{"key":"873_CR27","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. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995).","journal-title":"J. ACM"},{"key":"873_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G. & Say\u0131n, S. A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232, 479\u2013488 (2014).","journal-title":"Eur. J. Oper. Res."},{"key":"873_CR29","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H. & Savelsbergh, M. A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260, 904\u2013919 (2017).","journal-title":"Eur. J. Oper. Res."},{"key":"873_CR30","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s10957-013-0364-y","volume":"160","author":"M Ozlen","year":"2014","unstructured":"Ozlen, M., Burton, B. A. & MacRae, C. A. G. Multi-objective integer programming: an improved recursive algorithm. J. Optim. Theory Appl. 160, 470\u2013482 (2014).","journal-title":"J. Optim. Theory Appl."},{"key":"873_CR31","doi-asserted-by":"crossref","unstructured":"Bau\u00df, J., Parragh, S. N. & Stiglmayr, M. Adaptive improvements of multi-objective branch and bound. Preprint at http:\/\/arxiv.org\/abs\/2312.12192 (2023).","DOI":"10.1016\/j.ejco.2024.100099"},{"key":"873_CR32","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S. & Meyarivan, T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"873_CR33","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J. & Deb, K. pymoo: multi-objective optimization in Python. IEEE Access 8, 89497\u201389509 (2020).","journal-title":"IEEE Access"},{"key":"873_CR34","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. Preprint at http:\/\/arxiv.org\/abs\/1411.4028 (2014)."},{"key":"873_CR35","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. Preprint at http:\/\/arxiv.org\/abs\/1412.6062 (2015)."},{"key":"873_CR36","doi-asserted-by":"crossref","unstructured":"Lucas, A. Ising formulations of many np problems. Front. Phys. 2, 5 (2014).","DOI":"10.3389\/fphy.2014.00005"},{"key":"873_CR37","doi-asserted-by":"crossref","unstructured":"Bravyi, S., Kliesch, A., Koenig, R. & Tang, E. Obstacles to variational quantum optimization from symmetry protection. Phys. Rev. Lett. 125, 260505 (2020).","DOI":"10.1103\/PhysRevLett.125.260505"},{"key":"873_CR38","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).","journal-title":"Quantum"},{"key":"873_CR39","doi-asserted-by":"crossref","unstructured":"Tate, R., Farhadi, M., Herold, C., Mohler, G. & Gupta, S. Bridging classical and quantum with SDP initialized warm-starts for QAOA. ACM Trans. Quantum Comput. 4, 9 (2023).","DOI":"10.1145\/3549554"},{"key":"873_CR40","doi-asserted-by":"crossref","unstructured":"Rajakumar, J., Golden, J., B\u00e4rtschi, A. & Eidenbenz, S. Trainability barriers in low-depth QAOA landscapes. In Proc. 21st ACM International Conference on Computing Frontiers, CF \u201924 199\u2013206 (Association for Computing Machinery, 2024).","DOI":"10.1145\/3649153.3649204"},{"key":"873_CR41","doi-asserted-by":"publisher","first-page":"034008","DOI":"10.1088\/2058-9565\/ab8c2b","volume":"5","author":"M Streif","year":"2020","unstructured":"Streif, M. & Leib, M. Training the quantum approximate optimization algorithm without access to a quantum processing unit. Quantum Sci. Technol. 5, 034008 (2020).","journal-title":"Quantum Sci. Technol."},{"key":"873_CR42","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. The quantum approximate optimization algorithm and the Sherrington\u2013Kirkpatrick model at infinite size. Quantum 6, 759 (2022).","journal-title":"Quantum"},{"key":"873_CR43","unstructured":"Boulebnane, S. & Montanaro, A. Predicting parameters for the quantum approximate optimization algorithm for MAX-CUT from the infinite-size limit. Preprint at http:\/\/arxiv.org\/abs\/2110.10685 (2021)."},{"key":"873_CR44","unstructured":"Basso, J., Farhi, E., Marwaha, K., Villalonga, B. & Zhou, L. The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington\u2013Kirkpatrick model. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) Leibniz International Proceedings in Informatics (LIPIcs) Vol. 232 (eds Le Gall, F. & Morimae, T.) 7:1\u20137:21 (Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 2022)."},{"key":"873_CR45","doi-asserted-by":"publisher","first-page":"042612","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\u2009>\u20091. Phys. Rev. A 103, 042612 (2021).","journal-title":"Phys. Rev. A"},{"key":"873_CR46","doi-asserted-by":"publisher","first-page":"052419","DOI":"10.1103\/PhysRevA.104.052419","volume":"104","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J. & Lykov, D. Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs. Phys. Rev. A 104, 052419 (2021).","journal-title":"Phys. Rev. A"},{"key":"873_CR47","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-025-01082-1","volume":"11","author":"JA Monta\u00f1ez-Barrera","year":"2025","unstructured":"Monta\u00f1ez-Barrera, J. A. & Michielsen, K. Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems. npj Quantum Inf. 11, 131 (2025).","journal-title":"npj Quantum Inf."},{"key":"873_CR48","doi-asserted-by":"crossref","unstructured":"Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y. & Balaprakash, P. Learning to optimize variational quantum circuits to solve combinatorial problems. Proc. AAAI Conference on Artificial Intelligence 34, 2367\u20132375 (2020).","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"873_CR49","doi-asserted-by":"crossref","unstructured":"Alam, M., Ash-Saki, A. & Ghosh, S. Accelerating quantum approximate optimization algorithm using machine learning. In Proc. 23rd Conference on Design, Automation and Test in Europe, DATE \u201920 686\u2013689 (EDA Consortium, 2020).","DOI":"10.23919\/DATE48585.2020.9116348"},{"key":"873_CR50","doi-asserted-by":"crossref","unstructured":"Monta\u00f1ez-Barrera, J. A., Willsch, D. & Michielsen, K. Transfer learning of optimal QAOA parameters in combinatorial optimization. Quantum Inf. Process. 24, 129 (2025).","DOI":"10.1007\/s11128-025-04743-4"},{"key":"873_CR51","doi-asserted-by":"crossref","unstructured":"Galda, A., Liu, X., Lykov, D., Alexeev, Y. & Safro, I. Transferability of optimal QAOA parameters between random graphs. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) 171\u2013180 (IEEE, 2021).","DOI":"10.1109\/QCE52317.2021.00034"},{"key":"873_CR52","unstructured":"Augustino, B. et al. Strategies for running the QAOA at hundreds of qubits. Preprint at http:\/\/arxiv.org\/abs\/2410.03015 (2024)."},{"key":"873_CR53","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. Preprint at http:\/\/arxiv.org\/abs\/1812.04170 (2018)."},{"key":"873_CR54","doi-asserted-by":"crossref","unstructured":"Galda, A. et al. Similarity-based parameter transferability in the quantum approximate optimization algorithm. Front. Quantum Sci. Technol. 2, 1200975 (2023).","DOI":"10.3389\/frqst.2023.1200975"},{"key":"873_CR55","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.22331\/q-2024-01-18-1231","volume":"8","author":"SH Sureshbabu","year":"2024","unstructured":"Sureshbabu, S. H. et al. Parameter setting in quantum approximate optimization of weighted problems. Quantum 8, 1231 (2024).","journal-title":"Quantum"},{"key":"873_CR56","doi-asserted-by":"crossref","unstructured":"Shaydulin, R., Lotshaw, P. C., Larson, J., Ostrowski, J. & Humble, T. S. Parameter transfer for quantum approximate optimization of weighted maxcut. ACM Trans. Quantum Comput. 4, 19 (2023).","DOI":"10.1145\/3584706"},{"key":"873_CR57","doi-asserted-by":"publisher","first-page":"L010401","DOI":"10.1103\/PhysRevA.104.L010401","volume":"104","author":"V Akshay","year":"2021","unstructured":"Akshay, V., Rabinovich, D., Campos, E. & Biamonte, J. Parameter concentrations in quantum approximate optimization. Phys. Rev. A 104, L010401 (2021).","journal-title":"Phys. Rev. A"},{"key":"873_CR58","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.2024.0564","volume":"37","author":"V Katial","year":"2024","unstructured":"Katial, V., Smith-Miles, K., Hill, C. & Hollenberg, L. On the instance dependence of parameter initialization for the quantum approximate optimization algorithm: insights via instance space analysis. INFORMS J. Comput. 37, 146\u2013171 (2024).","journal-title":"INFORMS J. Comput."},{"key":"873_CR59","doi-asserted-by":"publisher","first-page":"3101419","DOI":"10.1109\/TQE.2024.3386753","volume":"5","author":"S-H Chiew","year":"2024","unstructured":"Chiew, S.-H. et al. Multiobjective optimization and network routing with near-term quantum computers. IEEE Trans. Quantum Eng. 5, 3101419 (2024).","journal-title":"IEEE Trans. Quantum Eng."},{"key":"873_CR60","doi-asserted-by":"crossref","unstructured":"Dahi, Z. A., Chicano, F., Luque, G., Derbel, B. & and Alba, E. Scalable quantum approximate optimiser for pseudo-boolean multi-objective optimisation. In Parallel Problem Solving from Nature\u2014PPSN XVIII: 18th International Conference, PPSN 2024 Lecture Notes in Computer Science Vol. 15151 (eds Affenzeller, M., et al.) 268\u2013284 (Springer, 2024).","DOI":"10.1007\/978-3-031-70085-9_17"},{"key":"873_CR61","doi-asserted-by":"publisher","first-page":"023141","DOI":"10.1103\/PhysRevResearch.7.023141","volume":"7","author":"L Ekstr\u00f8m","year":"2025","unstructured":"Ekstr\u00f8m, L., Wang, H. & Schmitt, S. Variational quantum multiobjective optimization. Phys. Rev. Res. 7, 023141 (2025).","journal-title":"Phys. Rev. Res."},{"key":"873_CR62","unstructured":"Li, H., Qiu, D. & Luo, L. Distributed exact multi-objective quantum search algorithm. Preprint at http:\/\/arxiv.org\/abs\/2409.04039 (2024)."},{"key":"873_CR63","doi-asserted-by":"crossref","unstructured":"Grover, L. K. A fast quantum mechanical algorithm for database search. Preprint at http:\/\/arxiv.org\/abs\/quant-ph\/9605043 (1996).","DOI":"10.1145\/237814.237866"},{"key":"873_CR64","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3510857","volume":"3","author":"J Golden","year":"2022","unstructured":"Golden, J., B\u00e4rtschi, A., O\u2019Malley, D. & Eidenbenz, S. Fair sampling error analysis on NISQ devices. ACM Trans. Quantum Comput. 3, 8 (2022).","journal-title":"ACM Trans. Quantum Comput."},{"key":"873_CR65","doi-asserted-by":"crossref","unstructured":"Pelofske, E., Golden, J., Bartschi, A., O\u2019Malley, D. & Eidenbenz, S. Sampling on NISQ devices: \u201cwho\u2019s the fairest one of all?\u201d. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) 207\u2013217 (IEEE, 2021).","DOI":"10.1109\/QCE52317.2021.00038"},{"key":"873_CR66","unstructured":"Farhi, E., Gamarnik, D. & Gutmann, S. The quantum approximate optimization algorithm needs to see the whole graph: a typical case. Preprint at http:\/\/arxiv.org\/abs\/2004.09002 (2020)."},{"key":"873_CR67","doi-asserted-by":"publisher","unstructured":"Woerner, S. qamoo. Zenodo https:\/\/doi.org\/10.5281\/zenodo.16878920 (2025).","DOI":"10.5281\/zenodo.16878920"}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00873-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00873-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00873-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:48:57Z","timestamp":1766486937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00873-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,24]]},"references-count":67,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1038\/s43588-025-00873-y","relation":{},"ISSN":["2662-8457"],"issn-type":[{"value":"2662-8457","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,24]]},"assertion":[{"value":"27 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2025","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","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}