{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:46:27Z","timestamp":1773218787192,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Deutsches Elektronen-Synchrotron (DESY)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Variational quantum algorithms, and in particular variants of the variational quantum eigensolver, have been proposed as approaches to combinatorial optimization (CO) problems. With only shallow ansatz circuits, these methods are considered suitable for current noisy intermediate-scale quantum hardware. Yet, the resources required to train variational circuits often scale superpolynomially with problem size. In this study, we numerically investigate the practical implications of this scaling for CO problems, using Max-Cut and random QUBO instances as benchmarks. For a fixed computational budget, we compare the average performance of training shallow variational circuits, sampling with replacement, and greedy local search. We identify the minimum problem size at which the quantum algorithms consistently outperform random sampling, and for each size, we characterize their separation from greedy local search. Beyond average-case performance, we analyze correlations between algorithms across individual problem instances. These results strengthen the case for intuitive yet meaningful benchmarks of variational quantum algorithms for CO problems under realistic resource constraints.<\/jats:p>","DOI":"10.1007\/s42484-026-00355-y","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T10:55:30Z","timestamp":1773140130000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Benchmarking variational quantum algorithms for combinatorial optimization in practice"],"prefix":"10.1007","volume":"8","author":[{"given":"Tim","family":"Schw\u00e4gerl","sequence":"first","affiliation":[]},{"given":"Yahui","family":"Chai","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Hartung","sequence":"additional","affiliation":[]},{"given":"Karl","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"K\u00fchn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,10]]},"reference":[{"issue":"1","key":"355_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjqt\/s40507-022-00123-4","volume":"9","author":"D Amaro","year":"2022","unstructured":"Amaro D, Rosenkranz M, Fitzpatrick N, Hirano K, Fiorentini M (2022) A case study of variational quantum algorithms for a job shop scheduling problem. EPJ Quantum Technol 9(1):1\u201320. https:\/\/doi.org\/10.1140\/epjqt\/s40507-022-00123-4","journal-title":"EPJ Quantum Technol"},{"key":"355_CR2","doi-asserted-by":"publisher","unstructured":"Amaro D, Modica C, Rosenkranz M, Fiorentini M, Benedetti M, Lubasch M (2022) Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci Technol 7(1):015021. https:\/\/doi.org\/10.1088\/2058-9565\/ac3e54. arXiv:2106.10055","DOI":"10.1088\/2058-9565\/ac3e54"},{"issue":"1","key":"355_CR3","doi-asserted-by":"publisher","first-page":"7760","DOI":"10.1038\/s41467-022-35364-5","volume":"13","author":"ER Anschuetz","year":"2022","unstructured":"Anschuetz ER, Kiani BT (2022) Quantum variational algorithms are swamped with traps. Nat Commun 13(1):7760. https:\/\/doi.org\/10.1038\/s41467-022-35364-5","journal-title":"Nat Commun"},{"key":"355_CR4","doi-asserted-by":"publisher","unstructured":"Arrasmith A, Holmes Z, Cerezo M, Coles PJ (2022) Equivalence of quantum barren plateaus to cost concentration and narrow gorges. Quantum Sci Technol 7(4):045015. https:\/\/doi.org\/10.1088\/2058-9565\/ac7d06 . arXiv:2104.05868","DOI":"10.1088\/2058-9565\/ac7d06"},{"issue":"3","key":"355_CR5","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 (1988) An application of combinatorial optimization to statistical physics and circuit layout design. Oper Res 36(3):493\u2013513","journal-title":"Oper Res"},{"key":"355_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"PK Barkoutsos","year":"2020","unstructured":"Barkoutsos PK, Nannicini G, Robert A, Tavernelli I, Woerner S (2020) Improving variational quantum optimization using CVaR. Quantum 4:256. https:\/\/doi.org\/10.22331\/q-2020-04-20-256","journal-title":"Quantum"},{"key":"355_CR7","doi-asserted-by":"publisher","unstructured":"Basso J, Farhi E, Marwaha K, Villalonga B, Zhou L (2022) The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the Sherrington-Kirkpatrick model. In: Le Gall F, Morimae T (eds) 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol 232, pp 7\u20131721. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2022.7","DOI":"10.4230\/LIPIcs.TQC.2022.7"},{"key":"355_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2024.03.002","volume":"1068","author":"K Blekos","year":"2024","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","journal-title":"Phys Rep"},{"issue":"6","key":"355_CR9","doi-asserted-by":"publisher","first-page":"064025","DOI":"10.1103\/PhysRevApplied.20.064025","volume":"20","author":"Y Chai","year":"2023","unstructured":"Chai Y, Funcke L, Hartung T, Jansen K, K\u00fchn S, Stornati P, Stollenwerk T (2023) Towards finding an optimal flight gate assignment on a digital quantum computer. Phys Rev Appl 20(6):064025. https:\/\/doi.org\/10.1103\/PhysRevApplied.20.064025","journal-title":"Phys Rev Appl"},{"key":"355_CR10","doi-asserted-by":"publisher","unstructured":"Chai Y, Jansen K, K\u00fchn S, Schw\u00e4gerl T, Stollenwerk T (2026) Warm start of variational quantum algorithms for quadratic unconstrained binary optimization problems. EPJ Quantum Technol 13(1). https:\/\/doi.org\/10.1140\/epjqt\/s40507-025-00452-0","DOI":"10.1140\/epjqt\/s40507-025-00452-0"},{"key":"355_CR11","unstructured":"Chai Y, Epifanovsky E, Jansen K, Kaushik A, K\u00fchn S (2023) Simulating the flight gate assignment problem on a trapped ion quantum computer. arXiv:2309.09686"},{"issue":"1","key":"355_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s41781-023-00109-6","volume":"7","author":"A Crippa","year":"2023","unstructured":"Crippa A, Funcke L, Hartung T, Heinemann B, Jansen K, Kropf A, K\u00fchn S, Meloni F, Spataro D, T\u00fcys\u00fcz C, Yap YC (2023) Quantum algorithms for charged particle track reconstruction in the luxe experiment. Comput Softw Big Sci 7(1):14. https:\/\/doi.org\/10.1007\/s41781-023-00109-6","journal-title":"Comput Softw Big Sci"},{"issue":"45","key":"355_CR13","doi-asserted-by":"publisher","first-page":"0487","DOI":"10.1126\/sciadv.adi0487","volume":"9","author":"M Dupont","year":"2023","unstructured":"Dupont M, Evert B, Hodson MJ, Sundar B, Jeffrey S, Yamaguchi Y, Feng D, Maciejewski FB, Hadfield S, Alam MS, Wang Z, Grabbe S, Lott PA, Rieffel EG, Venturelli D, Reagor MJ (2023) Quantum-enhanced greedy combinatorial optimization solver. Sci Adv 9(45):0487. https:\/\/doi.org\/10.1126\/sciadv.adi0487","journal-title":"Sci Adv"},{"key":"355_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.omega.2015.01.006","volume":"54","author":"M Eskandarpour","year":"2015","unstructured":"Eskandarpour M, Dejax P, Miemczyk J, P\u00e9ton O (2015) Sustainable supply chain network design: an optimization-oriented review. Omega 54:11\u201332. https:\/\/doi.org\/10.1016\/j.omega.2015.01.006","journal-title":"Omega"},{"key":"355_CR15","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"key":"355_CR16","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution. https:\/\/arxiv.org\/abs\/quant-ph\/0001106"},{"issue":"1","key":"355_CR17","doi-asserted-by":"publisher","first-page":"012127","DOI":"10.1088\/1742-6596\/2438\/1\/012127","volume":"2438","author":"L Funcke","year":"2023","unstructured":"Funcke L, Hartung T, Heinemann B, Jansen K, Kropf A, K\u00fchn S, Meloni F, Spataro D, T\u00fcys\u00fcz C, Yap YC (2023) Studying quantum algorithms for particle track reconstruction in the LUXE experiment. J Phys: Conf Ser 2438(1):012127. https:\/\/doi.org\/10.1088\/1742-6596\/2438\/1\/012127","journal-title":"J Phys: Conf Ser"},{"issue":"6","key":"355_CR18","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145. https:\/\/doi.org\/10.1145\/227683.227684","journal-title":"J ACM"},{"key":"355_CR19","doi-asserted-by":"publisher","unstructured":"Gray HM (2021) Quantum pattern recognition algorithms for charged particle tracking. Philosophical Trans Royal Soc A: Math, Phys Eng Sci 380(2216). https:\/\/doi.org\/10.1098\/rsta.2021.0103","DOI":"10.1098\/rsta.2021.0103"},{"key":"355_CR20","doi-asserted-by":"publisher","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, pp 212\u2013219. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"355_CR21","unstructured":"Gurobi Optimization LLC (2023) Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"355_CR22","doi-asserted-by":"crossref","unstructured":"Hancock J, Craven M, McNeile C, Vadacchino D (2025) Investigating techniques to optimise the layout of turbines in a windfarm using a quantum computer. J Quantum Comput 7(1):55\u201379. https:\/\/doi.org\/10.32604\/jqc.2025.068127","DOI":"10.32604\/jqc.2025.068127"},{"issue":"7825","key":"355_CR23","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris CR, Millman KJ, Walt SJ, Gommers R, Virtanen P, Cournapeau D, Wieser E, Taylor J, Berg S, Smith NJ, Kern R, Picus M, Hoyer S, Kerkwijk MH, Brett M, Haldane A, R\u00edo JF, Wiebe M, Peterson P, G\u00e9rard-Marchant P, Sheppard K, Reddy T, Weckesser W, Abbasi H, Gohlke C, Oliphant TE (2020) Array programming with NumPy. Nature 585(7825):357\u2013362. https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"issue":"4","key":"355_CR24","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad J (2001) Some optimal inapproximability results. J ACM 48(4):798\u2013859. https:\/\/doi.org\/10.1145\/502090.502098","journal-title":"J ACM"},{"issue":"1","key":"355_CR25","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"},{"key":"355_CR26","doi-asserted-by":"publisher","first-page":"052414","DOI":"10.1103\/PhysRevA.105.052414","volume":"105","author":"Y Huang","year":"2022","unstructured":"Huang Y, Li Q, Hou X, Wu R, Yung M-H, Bayat A, Wang X (2022) Robust resource-efficient quantum variational ansatz through an evolutionary algorithm. Phys Rev A 105:052414. https:\/\/doi.org\/10.1103\/PhysRevA.105.052414","journal-title":"Phys Rev A"},{"key":"355_CR27","doi-asserted-by":"publisher","unstructured":"Javadi-Abhari A, Treinish M, Krsulich K, Wood CJ, Lishman J, Gacon J, Martiel S, Nation PD, Bishop LS, Cross AW, Johnson BR, Gambetta JM (2024) Quantum computing with Qiskit. https:\/\/doi.org\/10.48550\/arXiv.2405.08810","DOI":"10.48550\/arXiv.2405.08810"},{"key":"355_CR28","doi-asserted-by":"publisher","unstructured":"Karp RM (1972) In: Miller RE, Thatcher JW, Bohlinger JD (eds) Reducibility among Combinatorial Problems, pp 85\u2013103. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"355_CR29","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 (2014) The unconstrained binary quadratic programming problem: a survey. J Comb Optim 28(1):58\u201381. https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J Comb Optim"},{"key":"355_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2021.3140190","volume":"3","author":"X Liu","year":"2022","unstructured":"Liu X, Angone A, Shaydulin R, Safro I, Alexeev Y, Cincio L (2022) Layer VQE: a variational approach for combinatorial optimization on noisy quantum computers. IEEE Trans Quantum Eng 3:1\u201320. https:\/\/doi.org\/10.1109\/TQE.2021.3140190","journal-title":"IEEE Trans Quantum Eng"},{"key":"355_CR31","doi-asserted-by":"crossref","unstructured":"Marin-Sanchez G, Amaro D (2024) Performance analysis of a filtering variational quantum algorithm. arXiv:2404.08933","DOI":"10.1088\/1367-2630\/add365"},{"issue":"4","key":"355_CR32","doi-asserted-by":"publisher","first-page":"045039","DOI":"10.1088\/2058-9565\/ad6fca","volume":"9","author":"Q Miao","year":"2024","unstructured":"Miao Q, Barthel T (2024) Equivalence of cost concentration and gradient vanishing for quantum circuits: an elementary proof in the riemannian formulation. Quantum Sci Technol 9(4):045039. https:\/\/doi.org\/10.1088\/2058-9565\/ad6fca","journal-title":"Quantum Sci Technol"},{"key":"355_CR33","doi-asserted-by":"publisher","unstructured":"Nannicini G (2019) Performance of hybrid quantum\/classical variational heuristics for combinatorial optimization. Phys Rev E 99(1):013304. https:\/\/doi.org\/10.1103\/PhysRevE.99.013304. arXiv:1805.12037","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"355_CR34","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-981-97-0065-3_21","volume-title":"Intelligent Computers, Algorithms, and Applications","author":"H Okawa","year":"2024","unstructured":"Okawa H (2024) Charged particle reconstruction for future high energy colliders with quantum approximate optimization algorithm. In: Cruz C, Zhang Y, Gao W (eds) Intelligent Computers, Algorithms, and Applications. Springer, Singapore, pp 272\u2013283"},{"issue":"1","key":"355_CR35","doi-asserted-by":"publisher","first-page":"16011","DOI":"10.1038\/s41598-024-66625-6","volume":"14","author":"A Pellow-Jarman","year":"2024","unstructured":"Pellow-Jarman A, McFarthing S, Sinayskiy I, Park DK, Pillay A, Petruccione F (2024) The effect of classical optimizers and ansatz depth on qaoa performance in noisy devices. Sci Rep 14(1):16011. https:\/\/doi.org\/10.1038\/s41598-024-66625-6","journal-title":"Sci Rep"},{"issue":"1","key":"355_CR36","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(1):4213. https:\/\/doi.org\/10.1038\/ncomms5213","journal-title":"Nat Commun"},{"key":"355_CR37","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"MJD Powell","year":"1998","unstructured":"Powell MJD (1998) Direct search algorithms for optimization calculations. Acta Numer 7:287\u2013336","journal-title":"Acta Numer"},{"key":"355_CR38","doi-asserted-by":"publisher","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. arXiv:1801.00862","DOI":"10.22331\/q-2018-08-06-79"},{"key":"355_CR39","doi-asserted-by":"publisher","first-page":"10006","DOI":"10.1051\/epjconf\/202024510006","volume":"245","author":"M Saito","year":"2020","unstructured":"Saito M, Calafiura P, Gray H, Lavrijsen W, Linder L, Okumura Y, Sawada R, Smith A, Tanaka J, Terashi K (2020) Quantum annealing algorithms for track pattern recognition. EPJ Web Conf 245:10006. https:\/\/doi.org\/10.1051\/epjconf\/202024510006","journal-title":"EPJ Web Conf"},{"key":"355_CR40","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10479-009-0651-z","volume":"175","author":"A Sbihi","year":"2010","unstructured":"Sbihi A, Eglese R (2010) Combinatorial optimization and green logistics. Annal Oper Res 175:254\u20135330. https:\/\/doi.org\/10.1007\/s10479-009-0651-z","journal-title":"Annal Oper Res"},{"key":"355_CR41","unstructured":"Schw\u00e4gerl T, Issever C, Jansen K, Khoo TJ, K\u00fchn S, T\u00fcys\u00fcz C, Weber H (2023) Particle track reconstruction with noisy intermediate-scale quantum computers. arXiv:2303.13249"},{"key":"355_CR42","doi-asserted-by":"publisher","unstructured":"Sciorilli M, Borges L, Patti TL, Garc\u00eda-Mart\u00edn D, Camilo G, Anandkumar A, Aolita L (2025) Towards large-scale quantum optimization solvers with few qubits. Nat Commun 16(1). https:\/\/doi.org\/10.1038\/s41467-024-55346-z","DOI":"10.1038\/s41467-024-55346-z"},{"key":"355_CR43","doi-asserted-by":"publisher","unstructured":"Scriva G, Astrakhantsev N, Pilati S, Mazzola G (2024) Challenges of variational quantum optimization with measurement shot noise. Phys Rev A 109(3). https:\/\/doi.org\/10.1103\/physreva.109.032408","DOI":"10.1103\/physreva.109.032408"},{"key":"355_CR44","doi-asserted-by":"crossref","unstructured":"Seabold S, Perktold J (2010) statsmodels: Econometric and statistical modeling with python. In: 9th Python in science conference","DOI":"10.25080\/Majora-92bf1922-011"},{"key":"355_CR45","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"355_CR46","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1109\/TAES.2021.3088490","volume":"57","author":"T Stollenwerk","year":"2021","unstructured":"Stollenwerk T, Michaud V, Lobe E, Picard M, Basermann A, Botter T (2021) Agile earth observation satellite scheduling with a quantum annealer. IEEE Trans Aerosp Electron Syst 57(5):3520\u20133528. https:\/\/doi.org\/10.1109\/TAES.2021.3088490","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"355_CR47","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.physrep.2022.08.003","DOI":"10.1016\/j.physrep.2022.08.003"},{"key":"355_CR48","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D, Burovski E, Peterson P, Weckesser W, Bright J, van der Walt SJ, Brett M, Wilson J, Millman KJ, Mayorov N, Nelson ARJ, Jones E, Kern R, Larson E, Carey CJ, Polat \u0130, Feng Y, Moore EW, VanderPlas J, Laxalde D, Perktold J, Cimrman R, Henriksen I, Quintero EA, Harris CR, Archibald AM, Ribeiro AH, Pedregosa F, van Mulbregt P (2020) SciPy 1.0 Contributors: SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nature Methods"},{"issue":"1","key":"355_CR49","doi-asserted-by":"publisher","first-page":"6961","DOI":"10.1038\/s41467-021-27045-6","volume":"12","author":"S Wang","year":"2021","unstructured":"Wang S, Fontana E, Cerezo M, Sharma K, Sone A, Cincio L, Coles PJ (2021) Noise-induced barren plateaus in variational quantum algorithms. Nat Commun 12(1):6961. https:\/\/doi.org\/10.1038\/s41467-021-27045-6","journal-title":"Nat Commun"},{"key":"355_CR50","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.22331\/q-2024-03-14-1287","volume":"8","author":"S Wang","year":"2024","unstructured":"Wang S, Czarnik P, Arrasmith A, Cerezo M, Cincio L, Coles PJ (2024) Can error mitigation improve trainability of noisy variational quantum algorithms? Quantum 8:1287. https:\/\/doi.org\/10.22331\/q-2024-03-14-1287","journal-title":"Quantum"},{"key":"355_CR51","doi-asserted-by":"publisher","first-page":"032408","DOI":"10.1103\/PhysRevA.108.032408","volume":"108","author":"A Weidinger","year":"2023","unstructured":"Weidinger A, Mbeng GB, Lechner W (2023) Error mitigation for quantum approximate optimization. Phys Rev A 108:032408. https:\/\/doi.org\/10.1103\/PhysRevA.108.032408","journal-title":"Phys Rev A"},{"issue":"158","key":"355_CR52","doi-asserted-by":"publisher","first-page":"209","DOI":"10.2307\/2276774","volume":"22","author":"EB Wilson","year":"1927","unstructured":"Wilson EB (1927) Probable inference, the law of succession, and statistical inference. J Am Stat Assoc 22(158):209\u2013212. https:\/\/doi.org\/10.2307\/2276774","journal-title":"J Am Stat Assoc"},{"key":"355_CR53","doi-asserted-by":"publisher","unstructured":"Zlokapa A, Anand A, Vlimant J-R, Duarte JM, Job J, Lidar D, Spiropulu M (2021) Charged particle tracking with quantum annealing optimization. Quantum Mach Intell 3(2). https:\/\/doi.org\/10.1007\/s42484-021-00054-w","DOI":"10.1007\/s42484-021-00054-w"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00355-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00355-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00355-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T10:55:35Z","timestamp":1773140135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00355-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,10]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00355-y","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,10]]},"assertion":[{"value":"25 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"26"}}