{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:05:44Z","timestamp":1764133544049,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish Ministry of Science and Innovation FPI","award":["PRE2020-094828"],"award-info":[{"award-number":["PRE2020-094828"]}]},{"name":"Spanish Ministry of Science and Innovation","award":["PID2019-109247GB-I00"],"award-info":[{"award-number":["PID2019-109247GB-I00"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,9]]},"DOI":"10.1145\/3520304.3533963","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"2247-2250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Quantum parametric circuit optimization with estimation of distribution algorithms"],"prefix":"10.1145","author":[{"given":"Vicente P.","family":"Soloviev","sequence":"first","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Larra\u00f1aga","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Concha","family":"Bielza","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5281\/zenodo.2573505"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"A review of population-based meta-heuristic algorithms","volume":"5","author":"Beheshti Zahra","year":"2013","unstructured":"Zahra Beheshti and Siti Mariyam Hj Shamsuddin. 2013. A review of population-based meta-heuristic algorithms. Int. J. Adv. Soft Comput. Appl 5, 1 (2013), 1--35.","journal-title":"Int. J. Adv. Soft Comput. Appl"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1103\/RevModPhys.94.015004"},{"key":"e_1_3_2_1_4_1","volume-title":"Sequential quadratic programming. Acta numerica 4","author":"Boggs Paul T","year":"1995","unstructured":"Paul T Boggs and Jon W Tolle. 1995. Sequential quadratic programming. Acta numerica 4 (1995), 1--51."},{"unstructured":"Xavier Bonet-Monroig Hao Wang Diederick Vermetten et al. 2021. Performance comparison of optimization methods on variational quantum algorithms. arXiv preprint arXiv:2111.13454 (2021).","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","series-title":"SIAM Journal on scientific computing 16, 5","volume-title":"A limited memory algorithm for bound constrained optimization","author":"Byrd Richard H","year":"1995","unstructured":"Richard H Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. 1995. A limited memory algorithm for bound constrained optimization. SIAM Journal on scientific computing 16, 5 (1995), 1190--1208."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1038\/s42254-021-00348-9"},{"volume-title":"Evolutionary Algorithms in Engineering Applications","author":"Dasgupta Dipankar","unstructured":"Dipankar Dasgupta and Zbigniew Michalewicz. 2014. Evolutionary Algorithms in Engineering Applications. Springer.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_2_1_10_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.6028\/jres.049.044"},{"key":"e_1_3_2_1_12_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"Larra\u00f1aga Pedro","unstructured":"Pedro Larra\u00f1aga and Jose A Lozano. 2001. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Vol. 2. Springer.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Ising formulations of many NP problems. Frontiers in Physics","author":"Lucas Andrew","year":"2014","unstructured":"Andrew Lucas. 2014. Ising formulations of many NP problems. Frontiers in Physics (2014), 5."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1038\/s41467-018-07090-4"},{"volume-title":"Advances in Optimization and Numerical Analysis","author":"Powell Michael JD","unstructured":"Michael JD Powell. 1994. A direct search optimization method that models the objective and constraint functions by linear interpolation. In Advances in Optimization and Numerical Analysis. Springer, 51--67.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","volume-title":"An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747","author":"Ruder Sebastian","year":"2016","unstructured":"Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/IGSC48788.2019.8957201"},{"key":"e_1_3_2_1_19_1","volume-title":"Quantum Approximate Optimization Algorithm for Bayesian network structure learning. arXiv preprint arXiv:2203.02400","author":"Soloviev Vicente P","year":"2022","unstructured":"Vicente P Soloviev, Concha Bielza, and Pedro Larra\u00f1aga. 2022. Quantum Approximate Optimization Algorithm for Bayesian network structure learning. arXiv preprint arXiv:2203.02400 (2022)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/9.119632"},{"key":"e_1_3_2_1_21_1","volume-title":"Panigrahi","author":"Behera Bikash K.","year":"2020","unstructured":"Utkarsh, Bikash K. Behera, and Prasanta K. Panigrahi. 2020. Solving vehicle routing problem using quantum approximate optimization algorithm. arXiv preprint arXiv:2002.01351 (2020)."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '22","name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3533963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:24Z","timestamp":1750183764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":21,"alternative-id":["10.1145\/3520304.3533963","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3533963","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}