{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:21Z","timestamp":1750219941694,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministerio de Ciencia e Innovaci\u00f3n del Gobierno de Espa\u00f1a","award":["PID2020-116727RB-I00"],"award-info":[{"award-number":["PID2020-116727RB-I00"]}]},{"name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades del Gobierno de Espa\u00f1a","award":["PRX21\/00669"],"award-info":[{"award-number":["PRX21\/00669"]}]},{"name":"EU Horizon 2020","award":["952215"],"award-info":[{"award-number":["952215"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3596409","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"2187-2194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient QAOA via a Polynomial QPU-Needless Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"first","affiliation":[{"name":"University of Malaga, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8022-4407","authenticated-orcid":false,"given":"Zakaria","family":"Dahi","sequence":"additional","affiliation":[{"name":"University of Malaga, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7909-1416","authenticated-orcid":false,"given":"Gabriel","family":"Luque","sequence":"additional","affiliation":[{"name":"University of Malaga, Malaga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3172241"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.TQC.2022.7"},{"key":"e_1_3_2_1_3_1","first-page":"117","article-title":"Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London","volume":"400","author":"Deutsch David","year":"1985","unstructured":"David Deutsch . 1985 . Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London . A. Mathematical and Physical Sciences 400 (1985), 117 -- 197 . David Deutsch. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences 400 (1985), 117 -- 97.","journal-title":"A. Mathematical and Physical Sciences"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"e_1_3_2_1_5_1","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 [quant-ph]  Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 [quant-ph]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-07-07-759"},{"key":"e_1_3_2_1_7_1","unstructured":"Edward Farhi and Aram W Harrow. 2019. Quantum Supremacy through the Quantum Approximate Optimization Algorithm. arXiv:1602.07674 [quant-ph]  Edward Farhi and Aram W Harrow. 2019. Quantum Supremacy through the Quantum Approximate Optimization Algorithm. arXiv:1602.07674 [quant-ph]"},{"key":"e_1_3_2_1_8_1","unstructured":"Camille Grange Michael Poss and Eric Bourreau. 2022. An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems. arXiv:2212.11734 [math.OC]  Camille Grange Michael Poss and Eric Bourreau. 2022. An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems. arXiv:2212.11734 [math.OC]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.03.013"},{"key":"e_1_3_2_1_10_1","unstructured":"Seth Lloyd. 2018. Quantum approximate optimization is computationally universal. arXiv:1812.11075 [quant-ph]  Seth Lloyd. 2018. Quantum approximate optimization is computationally universal. arXiv:1812.11075 [quant-ph]"},{"key":"e_1_3_2_1_11_1","volume-title":"Bernal Neira","author":"Lubinski Thomas","year":"2023","unstructured":"Thomas Lubinski , Carleton Coffrin , Catherine McGeoch , Pratik Sathe , Joshua Apanavicius , and David E . Bernal Neira . 2023 . Optimization Applications as Quantum Performance Benchmarks . (2 2023). arXiv:2302.02278 [quant-ph] Thomas Lubinski, Carleton Coffrin, Catherine McGeoch, Pratik Sathe, Joshua Apanavicius, and David E. Bernal Neira. 2023. Optimization Applications as Quantum Performance Benchmarks. (2 2023). arXiv:2302.02278 [quant-ph]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02748-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-022-00131-4"},{"key":"e_1_3_2_1_14_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2000","unstructured":"Michael A. Nielsen and Isaac L . Chuang . 2000 . Quantum Computation and Quantum Information. Cambridge University Press . Michael A. Nielsen and Isaac L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03769-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-022-03769-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8c2b"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390144"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3596409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:55Z","timestamp":1750182535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3596409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":23,"alternative-id":["10.1145\/3583133.3596409","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3596409","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}