{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T18:42:30Z","timestamp":1784140950532,"version":"3.55.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T00:00:00Z","timestamp":1746748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["13N16149"],"award-info":[{"award-number":["13N16149"]}],"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":["13N16149"],"award-info":[{"award-number":["13N16149"]}],"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":["13N16149"],"award-info":[{"award-number":["13N16149"]}],"id":[{"id":"10.13039\/501100002347","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-04743-4","type":"journal-article","created":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T14:50:14Z","timestamp":1746802214000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Transfer learning of optimal QAOA parameters in combinatorial optimization"],"prefix":"10.1007","volume":"24","author":[{"given":"J. A.","family":"Monta\u00f1ez-Barrera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Willsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristel","family":"Michielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,9]]},"reference":[{"key":"4743_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 1 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005. arXiv:1302.5843","journal-title":"Front. Phys."},{"key":"4743_CR2","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.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"4743_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-60022-5","volume":"10","author":"M Ohzeki","year":"2020","unstructured":"Ohzeki, M.: Breaking limitation of quantum annealer in solving optimization problems under constraints. Sci. Rep. 10, 1 (2020). https:\/\/doi.org\/10.1038\/s41598-020-60022-5. arXiv:2002.05298","journal-title":"Sci. Rep."},{"key":"4743_CR4","doi-asserted-by":"publisher","unstructured":"Harrigan, M.\u00a0P., Sung, K.\u00a0J., Neeley, M., Satzinger, K.\u00a0J., Arute, F., Arya, K., Atalaya, J., Bardin, J.\u00a0C., Barends, R., Boixo, S., Broughton, M., Buckley, B.\u00a0B., Buell, D.\u00a0A., Burkett, B., Bushnell, N., Chen, Y., Chen, Z., Chiaro, Ben, Collins, R., Courtney, W., Demura, S., Dunsworth, A., Eppens, D., Fowler, A., Foxen, B., Gidney, C., Giustina, M., Graff, R., Habegger, S., Ho, A., Hong, S., Huang, T., Ioffe, L.\u00a0B., Isakov, S.\u00a0V., Jeffrey, E., Jiang, Z., Jones, C., Kafri, D., Kechedzhi, K., Kelly, J., Kim, S., Klimov, P.\u00a0V., Korotkov, A.\u00a0N., Kostritsa, F., Landhuis, D., Laptev, P., Lindmark, M., Leib, M., Martin, O., Martinis, J.\u00a0M., McClean, J.\u00a0R., McEwen, M., Megrant, A., Mi, X., Mohseni, M., Mruczkiewicz, W., Mutus, J., Naaman, O., Neill, C., Neukart, F., Niu, M.\u00a0Y., O\u2019Brien, T.\u00a0E., O\u2019Gorman, B., Ostby, E., Petukhov, A., Putterman, H., Quintana, C., Roushan, P., Rubin, N.\u00a0C., Sank, D., Skolik, A., Smelyanskiy, V., Strain, D., Streif, M., Szalay, M., Vainsencher, A., White, T., Yao, Z.\u00a0J., Yeh, P., Zalcman, A., Zhou, L., Neven, H., Bacon, D., Lucero, E., Farhi, E., Babbush, R.: Quantum approximate optimization of non-planar graph problems on a planar superconducting processor, Nature Physics 17, 332 (2021), https:\/\/doi.org\/10.1038\/s41567-020-01105-y, arXiv:2004.04197","DOI":"10.1038\/s41567-020-01105-y"},{"key":"4743_CR5","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-20853-w","author":"P Niroula","year":"2022","unstructured":"Niroula, P., Shaydulin, R., Yalovetzky, R., Minssen, P., Herman, D., Hu, S., Pistoia, M.: Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer. Sci. Rep. (2022). https:\/\/doi.org\/10.1038\/s41598-022-20853-w","journal-title":"Sci. Rep."},{"key":"4743_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3584706","volume":"4","author":"R Shaydulin","year":"2023","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, 1 (2023). https:\/\/doi.org\/10.1145\/3584706. arXiv:2201.11785","journal-title":"ACM Trans. Quantum Comput."},{"key":"4743_CR7","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph]"},{"key":"4743_CR8","doi-asserted-by":"publisher","unstructured":"Egger, D.\u00a0J., Marecek, J., Woerner, S.: Warm-starting quantum optimization, Quantum 5, (2021), https:\/\/doi.org\/10.22331\/q-2021-06-17-479, arXiv:2009.10095","DOI":"10.22331\/q-2021-06-17-479"},{"key":"4743_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3549554","volume":"4","author":"R Tate","year":"2023","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, 1 (2023). https:\/\/doi.org\/10.1145\/3549554. arXiv:2010.14021","journal-title":"ACM Trans. Quantum Comput."},{"key":"4743_CR10","doi-asserted-by":"publisher","unstructured":"Tate, R., Moondra, J., Gard, B., Mohler, G., Gupta, S.: Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson\u2019s Max-Cut at Low Circuit Depths, Quantum 7, (2023), https:\/\/doi.org\/10.22331\/q-2023-09-26-1121, arXiv:2112.11354","DOI":"10.22331\/q-2023-09-26-1121"},{"key":"4743_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PRXQuantum.5.020327","volume":"5","author":"JR Fin\u017dgar","year":"2024","unstructured":"Fin\u017dgar, J.R., Kerschbaumer, A., Schuetz, M.J., Mendl, C.B., Katzgraber, H.G.: Quantum-informed recursive optimization algorithms. PRX Quantum 5, 1 (2024). https:\/\/doi.org\/10.1103\/PRXQuantum.5.020327. arXiv:2308.13607","journal-title":"PRX Quantum"},{"key":"4743_CR12","doi-asserted-by":"crossref","unstructured":"Abbas, A., Ambainis, A., Augustino, B., B\u00e4rtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D.\u00a0J., Elmegreen, B.\u00a0G., Franco, N., Fratini, F., Fuller, B., Gacon, J., Gonciulea, C., Gribling, S., Gupta, S., Hadfield, S., Heese, R., Kircher, G., Kleinert, T., Koch, T., Korpas, G., Lenk, S., Marecek, J., Markov, V., Mazzola, G., Mensa, S., Mohseni, N., Nannicini, G., O\u2019Meara, C., Tapia, E.\u00a0P., Pokutta, S., Proissl, M., Rebentrost, P., Sahin, E., Symons, B.\u00a0C.\u00a0B., Tornow, S., Valls, V., Woerner, S., Wolf-Bauwens, M.\u00a0L., Yard, J., Yarkoni, S., Zechiel, D., Zhuk, S., Zoufal, C.: Quantum optimization: Potential, challenges, and the path forward (2023), arXiv:2312.02279 [quant-ph]","DOI":"10.2172\/2229681"},{"key":"4743_CR13","doi-asserted-by":"crossref","unstructured":"He, Z., Shaydulin, R., Herman, D., Li, C., Raymond, R., Sureshbabu, S.\u00a0H., Pistoia, M.: Parameter setting heuristics make the quantum approximate optimization algorithm suitable for the early fault-tolerant era (2024), arXiv:2408.09538 [quant-ph]","DOI":"10.1145\/3676536.3697128"},{"key":"4743_CR14","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, S.C., Endo, S., Fujii, K., McClean, J.R., Mitarai, K., Yuan, X., Cincio, L., Coles, P.J.: Variational quantum algorithms. Nat. Rev. Phys. 3, 625 (2021). https:\/\/doi.org\/10.1038\/s42254-021-00348-9. arXiv:2012.09265","journal-title":"Nat. Rev. Phys."},{"key":"4743_CR15","doi-asserted-by":"publisher","first-page":"108411","DOI":"10.1016\/j.cpc.2022.108411","volume":"278","author":"D Willsch","year":"2022","unstructured":"Willsch, D., Willsch, M., Jin, F., Michielsen, K., De Raedt, H.: GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm. Comput. Phys. Commun. 278, 108411 (2022). https:\/\/doi.org\/10.1016\/j.cpc.2022.108411. arXiv:2104.03293","journal-title":"Comput. Phys. Commun."},{"key":"4743_CR16","doi-asserted-by":"publisher","first-page":"120502","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L., Kliesch, M.: Training variational quantum algorithms is NP-hard. Phys. Rev. Lett. 127, 120502 (2021). https:\/\/doi.org\/10.1103\/PhysRevLett.127.120502. arXiv:2101.07267","journal-title":"Phys. Rev. Lett."},{"key":"4743_CR17","doi-asserted-by":"publisher","first-page":"090504","DOI":"10.1103\/PhysRevLett.124.090504","volume":"124","author":"V Akshay","year":"2020","unstructured":"Akshay, V., Philathong, H., Morales, M.E.S., Biamonte, J.D.: Reachability deficits in quantum approximate optimization. Phys. Rev. Lett. 124, 090504 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.124.090504","journal-title":"Phys. Rev. Lett."},{"key":"4743_CR18","unstructured":"Kremenetski, V., Hogg, T., Hadfield, S., Cotton, S.\u00a0J., Tubman, N.\u00a0M.: Quantum alternating operator ansatz (qaoa) phase diagrams and applications for quantum chemistry (2021), arXiv:2108.13056 [quant-ph]"},{"key":"4743_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 1 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067. arXiv:1812.01041","journal-title":"Phys. Rev. X"},{"key":"4743_CR20","unstructured":"Ko\u00dfmann, G., Binkowski, L., van Luijk, L., Ziegler, T., Schwonnek, R.: Deep-circuit qaoa (2023). arXiv:2210.12406 [quant-ph]"},{"key":"4743_CR21","doi-asserted-by":"publisher","unstructured":"Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., Alexeev, Y., Dreiling, J.M., Gaebler, J.P., Gatterman, T.M., Gerber, J.A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C.V., Hu, S., Johansen, J., Matheny, M., Mengle, T., Mills, M., Moses, S.A., Neyenhuis, B., Siegfried, P., Yalovetzky, R., Pistoia, M.: Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Science Advances 10, (2024). https:\/\/doi.org\/10.1126\/sciadv.adm6761","DOI":"10.1126\/sciadv.adm6761"},{"key":"4743_CR22","doi-asserted-by":"publisher","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-Kirkpatrick Model. Leibniz International Proceedings in Informatics, LIPIcs 232, 1 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2022.7. arXiv:2110.14206","DOI":"10.4230\/LIPIcs.TQC.2022.7"},{"key":"4743_CR23","unstructured":"Boulebnane, S., Montanaro, A.: Solving boolean satisfiability problems with the quantum approximate optimization algorithm (2022), arXiv:2208.06909 [quant-ph]"},{"key":"4743_CR24","unstructured":"Brandao, F.\u00a0G. S.\u00a0L., 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 (2018), arXiv:1812.04170 [quant-ph]"},{"key":"4743_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03342-3","author":"PC Lotshaw","year":"2021","unstructured":"Lotshaw, P.C., Humble, T.S., Herrman, R., Ostrowski, J., Siopsis, G.: Empirical performance bounds for quantum approximate optimization. Quantum Inf. Process. (2021). https:\/\/doi.org\/10.1007\/s11128-021-03342-3","journal-title":"Quantum Inf. Process."},{"key":"4743_CR26","doi-asserted-by":"publisher","unstructured":"Galda, A., Liu, X., Lykov, D., Alexeev, Y., Safro, I., Transferability of optimal QAOA parameters between random graphs, Proceedings - 2021 IEEE International Conference on Quantum Computing and Engineering, QCE 2021 , 171 (2021), https:\/\/doi.org\/10.1109\/QCE52317.2021.00034, arXiv:2106.07531","DOI":"10.1109\/QCE52317.2021.00034"},{"key":"4743_CR27","unstructured":"Wurtz, J., Lykov, D.: The fixed angle conjecture for qaoa on regular maxcut graphs (2021), arXiv:2107.00677 [quant-ph]"},{"key":"4743_CR28","first-page":"51","volume":"275","author":"M Powell","year":"1994","unstructured":"Powell, M.: A direct search optimization method that models the objective and constraint functions by linear interpolation. Adv. Optim. Numer. Anal. 275, 51 (1994)","journal-title":"Adv. Optim. Numer. Anal."},{"key":"4743_CR29","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"MW Johnson","year":"2011","unstructured":"Johnson, M.W., Amin, M.H., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A.J., Johansson, J., Bunyk, P., et al.: Quantum annealing with manufactured spins. Nature 473, 194 (2011)","journal-title":"Nature"},{"key":"4743_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1038\/s41586-023-05867-2","volume":"617","author":"AD King","year":"2023","unstructured":"King, A.D., Raymond, J., Lanting, T., Harris, R., Zucca, A., Altomare, F., Berkley, A.J., Boothby, K., Ejtemaee, S., Enderud, C., Hoskinson, E., Huang, S., Ladizinsky, E., MacDonald, A.J.R., Marsden, G., Molavi, R., Oh, T., Poulin-Lamarre, G., Reis, M., Rich, C., Sato, Y., Tsai, N., Volkmann, M., Whittaker, J.D., Yao, J., Sandvik, A.W., Amin, M.H.: Quantum critical dynamics in a 5,000-qubit programmable spin glass. Nature 617, 61\u201366 (2023). https:\/\/doi.org\/10.1038\/s41586-023-05867-2","journal-title":"Nature"},{"key":"4743_CR31","doi-asserted-by":"publisher","first-page":"1","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, 1 (2021). https:\/\/doi.org\/10.22331\/Q-2021-07-01-491","journal-title":"Quantum"},{"key":"4743_CR32","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.\u00a0M.: Where the Really Hard Problems Are, The 12nd International Joint Conference on Artificial Intelligence , 331 (1991)"},{"key":"4743_CR33","doi-asserted-by":"publisher","first-page":"A135","DOI":"10.17815\/jlsrf-5-171","volume":"5","author":"D Krause","year":"2019","unstructured":"Krause, D.: JUWELS: modular tier-0\/1 supercomputer at the J\u00fclich supercomputing centre. J. Large-scale Res. Facil. JLSRF 5, A135 (2019). https:\/\/doi.org\/10.17815\/jlsrf-5-171","journal-title":"J. Large-scale Res. Facil. JLSRF"},{"key":"4743_CR34","doi-asserted-by":"publisher","first-page":"A183","DOI":"10.17815\/jlsrf-7-183","volume":"7","author":"D Alvarez","year":"2021","unstructured":"Alvarez, D.: JUWELS cluster and booster: exascale pathfinder with modular supercomputing architecture at Juelich supercomputing centre. J. of Large-Scale Res. Facil. 7, A183 (2021). https:\/\/doi.org\/10.17815\/jlsrf-7-183","journal-title":"J. of Large-Scale Res. Facil."},{"key":"4743_CR35","doi-asserted-by":"publisher","first-page":"025022","DOI":"10.1088\/2058-9565\/ad35e4","volume":"9","author":"JA Monta\u00f1ez-Barrera","year":"2024","unstructured":"Monta\u00f1ez-Barrera, J.A., Willsch, D., Maldonado-Romo, A., Michielsen, K.: Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms. Quantum Sci. Technol. 9, 025022 (2024). https:\/\/doi.org\/10.1088\/2058-9565\/ad35e4","journal-title":"Quantum Sci. Technol."},{"key":"4743_CR36","doi-asserted-by":"publisher","unstructured":"Montanez-Barrera, J.\u00a0A., van\u00a0den Heuvel, P., Willsch, D., Michielsen, K.: Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 01, 535 (2023), https:\/\/doi.org\/10.1109\/QCE57702.2023.00067, arXiv:2305.18757","DOI":"10.1109\/QCE57702.2023.00067"},{"key":"4743_CR37","unstructured":"D-Wave Systems Inc., Solver parameters (2024). https:\/\/docs.dwavesys.com\/docs\/latest\/csolverparameters.html. Accessed 27 Aug 2024"},{"key":"4743_CR38","unstructured":"Bliek, C., Bonami, P., Lodi, A.: Solving mixed-integer quadratic programming problems with ibm-cplex : a progress report (2014)"},{"key":"4743_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevResearch.6.013312","volume":"6","author":"S Schulz","year":"2024","unstructured":"Schulz, S., Willsch, D., Michielsen, K.: Guided quantum walk. Phys. Rev. Res. 6, 1 (2024). https:\/\/doi.org\/10.1103\/PhysRevResearch.6.013312. arXiv:2308.05418","journal-title":"Phys. Rev. Res."},{"key":"4743_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/0953-2048\/23\/6\/065004","volume":"23","author":"MW Johnson","year":"2010","unstructured":"Johnson, M.W., Bunyk, P., Maibaum, F., Tolkacheva, E., Berkley, A.J., Chapple, E.M., Harris, R., Johansson, J., Lanting, T., Perminov, I., Ladizinsky, E., Oh, T., Rose, G.: A scalable control system for a superconducting adiabatic quantum optimization processor. Supercond. Sci. Technol. 23, 1 (2010). https:\/\/doi.org\/10.1088\/0953-2048\/23\/6\/065004. arXiv:0907.3757","journal-title":"Supercond. Sci. Technol."},{"key":"4743_CR41","doi-asserted-by":"publisher","unstructured":"Bonet-Monroig, X., Wang, H., Vermetten, D., Senjean, B., Moussa, C., B\u00e4ck, T., Dunjko, V., O\u2019Brien, T.E.: Performance comparison of optimization methods on variational quantum algorithms. Physical Review A 107, (2023). https:\/\/doi.org\/10.1103\/PhysRevA.107.032407. arXiv:2111.13454","DOI":"10.1103\/PhysRevA.107.032407"},{"key":"4743_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-022-00546-y","volume":"8","author":"A Glos","year":"2022","unstructured":"Glos, A., Krawiec, A., Zimbor\u00e1s, Z.: Space-efficient binary optimization for variational quantum computing. NPJ Quantum Inf. 8, 1 (2022). https:\/\/doi.org\/10.1038\/s41534-022-00546-y","journal-title":"NPJ Quantum Inf."},{"key":"4743_CR43","doi-asserted-by":"publisher","unstructured":"Giron, M.\u00a0C., Korpas, G., Parvaiz, W., Malik, P., Aspman, J.: Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023), IEEE Transactions on Quantum Engineering 4, (2023) https:\/\/doi.org\/10.1109\/TQE.2023.3314839","DOI":"10.1109\/TQE.2023.3314839"},{"key":"4743_CR44","doi-asserted-by":"publisher","unstructured":"Yan, J., Lu, Y., Chen, L., Qin, S., Fang,Y., Lin, Q., Moscibroda, T., Rajmohan, S., Zhang, D.: Solving the batch stochastic bin packing problem in cloud: A chance-constrained optimization approach, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, series and number KDD \u201922 ( publisher ACM, 2022) p. 2169-2179 https:\/\/doi.org\/10.1145\/3534678.3539334","DOI":"10.1145\/3534678.3539334"},{"key":"4743_CR45","doi-asserted-by":"publisher","unstructured":"Kroes, M., Petrica, L., Cotofana, S., Blott, M.: Evolutionary bin packing for memory-efficient dataflow inference acceleration on FPGA, GECCO 2020 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference , 1125 (2020), https:\/\/doi.org\/10.1145\/3377930.3389808 , arXiv:2003.12449","DOI":"10.1145\/3377930.3389808"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04743-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04743-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04743-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T03:24:42Z","timestamp":1749266682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04743-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,9]]},"references-count":45,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["4743"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04743-4","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,9]]},"assertion":[{"value":"22 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"129"}}