{"id":"https://openalex.org/W4400518685","doi":"https://doi.org/10.48550/arxiv.2407.06421","title":"Variational Quantum Algorithms for Combinatorial Optimization","display_name":"Variational Quantum Algorithms for Combinatorial Optimization","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4400518685","doi":"https://doi.org/10.48550/arxiv.2407.06421"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2407.06421","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2407.06421","pdf_url":"https://arxiv.org/pdf/2407.06421","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2407.06421","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020323246","display_name":"Daniel F. P\u00e9rez-Ram\u00edrez","orcid":"https://orcid.org/0000-0002-1322-4367","observed_orcids":["https://orcid.org/0000-0002-1322-4367"]},"institutions":[{"id":"https://openalex.org/I2800664555","display_name":"RISE Research Institutes of Sweden","ror":"https://ror.org/03nnxqz81","country_code":"SE","type":"other","lineage":["https://openalex.org/I2800664555"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Perez-Ramirez, Daniel F","raw_affiliation_strings":["RISE Computer Science , Sweden and KTH Royal Institute of Technology , Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RISE Computer Science , Sweden and KTH Royal Institute of Technology , Sweden","institution_ids":["https://openalex.org/I2800664555","https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020323246"],"corresponding_institution_ids":["https://openalex.org/I2800664555","https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11804","display_name":"Quantum many-body systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/variational-quantum-algorithms","display_name":"variational quantum algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9850000143051147},{"id":"https://openalex.org/keywords/quantum-approximate-optimization-algorithm","display_name":"quantum approximate optimization algorithm","score":0.9259999990463257},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.6669999957084656},{"id":"https://openalex.org/keywords/nisq-devices","display_name":"NISQ devices","score":0.8029999732971191},{"id":"https://openalex.org/keywords/quantum-advantage","display_name":"quantum advantage","score":0.902999997138977},{"id":"https://openalex.org/keywords/circuit-depth","display_name":"circuit depth","score":0.7239999771118164},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.5130000114440918}],"concepts":[{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5396336317062378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5075106024742126},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4846678078174591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46497631072998047},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3252938389778137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2818281352519989},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16929227113723755},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.1613246202468872}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2407.06421","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2407.06421","pdf_url":"https://arxiv.org/pdf/2407.06421","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2407.06421","doi":"https://doi.org/10.48550/arxiv.2407.06421","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2407.06421","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2407.06421","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2407.06421","pdf_url":"https://arxiv.org/pdf/2407.06421","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400518685.pdf","grobid_xml":"https://content.openalex.org/works/W4400518685.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1492999010","https://openalex.org/W1568345435","https://openalex.org/W2023789062","https://openalex.org/W2168676717","https://openalex.org/W2558921197","https://openalex.org/W2781738013","https://openalex.org/W2900896126","https://openalex.org/W2903058119","https://openalex.org/W2903221501","https://openalex.org/W2908171520","https://openalex.org/W3003257820","https://openalex.org/W3103720553","https://openalex.org/W6969089189"],"related_works":["https://openalex.org/W7221039091","https://openalex.org/W4385410364","https://openalex.org/W6983444261","https://openalex.org/W4395686618","https://openalex.org/W4403445281","https://openalex.org/W4407759038","https://openalex.org/W7203596264","https://openalex.org/W4400600642","https://openalex.org/W7163520579","https://openalex.org/W3111101793"],"abstract_inverted_index":{"The":[0],"promise":[1],"of":[2,23,31,53,71,118,126,138,186],"quantum":[3,24,32,55,65,68,107],"computing":[4,108],"to":[5,48,63,143,169],"address":[6],"complex":[7],"problems":[8,90],"requiring":[9],"high":[10],"computational":[11,51],"resources":[12],"has":[13,40],"long":[14],"been":[15],"hindered":[16],"by":[17],"the":[18,28,50,75,119,132,148,155,171,182],"intrinsic":[19],"and":[20,43,135,178,184,198],"demanding":[21],"requirements":[22],"hardware":[25],"development.":[26],"Nonetheless,":[27],"current":[29,54,133],"state":[30,134],"computing,":[33],"denominated":[34],"Noisy":[35],"Intermediate-Scale":[36],"Quantum":[37,111,149],"(NISQ)":[38],"era,":[39],"introduced":[41],"algorithms":[42],"methods":[44],"that":[45],"are":[46,91],"able":[47],"harness":[49],"power":[52],"computers":[56,61],"with":[57,166,176],"advantages":[58],"over":[59],"classical":[60],"(referred":[62],"as":[64,99,116,154],"advantage).":[66],"Achieving":[67],"advantage":[69],"is":[70],"particular":[72],"relevance":[73],"for":[74,94,158],"combinatorial":[76,89,144],"optimization":[77,86,191],"domain,":[78],"since":[79],"it":[80],"often":[81],"implies":[82],"solving":[83],"an":[84],"NP-Hard":[85],"problem.":[87],"Moreover,":[88],"highly":[92],"relevant":[93],"practical":[95,124,190],"application":[96],"areas,":[97],"such":[98],"operations":[100],"research,":[101],"or":[102],"resource":[103],"allocation":[104],"problems.":[105,160],"Among":[106],"methods,":[109],"Variational":[110],"Algorithms":[112],"(VQA)":[113],"have":[114],"emerged":[115],"one":[117],"strongest":[120],"candidates":[121],"towards":[122],"reaching":[123],"applicability":[125,142],"NISQ":[127],"systems.":[128],"This":[129],"paper":[130],"explores":[131],"recent":[136],"developments":[137],"VQAs,":[139],"emphasizing":[140],"their":[141],"optimization.":[145],"We":[146,193],"identify":[147],"Approximate":[150],"Optimization":[151],"Algorithm":[152],"(QAOA)":[153],"leading":[156],"candidate":[157],"these":[159],"Furthermore,":[161],"we":[162],"implement":[163],"QAOA":[164],"circuits":[165],"varying":[167],"depths":[168],"solve":[170],"MaxCut":[172],"problem":[173],"on":[174],"graphs":[175],"10":[177],"20":[179],"nodes,":[180],"demonstrating":[181],"potential":[183],"challenges":[185],"using":[187],"VQAs":[188],"in":[189],"tasks.":[192],"release":[194],"our":[195],"code,":[196],"dataset":[197],"optimized":[199],"circuit":[200],"parameters":[201],"under":[202],"https://github.com/DanielFPerez/VQA-for-MaxCut.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2024-07-11T00:00:00"}