{"id":"https://openalex.org/W4416874853","doi":"https://doi.org/10.1109/qce65121.2025.00240","title":"Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: a Machine Learning Approach","display_name":"Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: a Machine Learning Approach","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416874853","doi":"https://doi.org/10.1109/qce65121.2025.00240"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037582759","display_name":"Kien X. Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kien X. Nguyen","raw_affiliation_strings":["Computer and Information Sciences, University of Delaware,Newark,Delaware,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences, University of Delaware,Newark,Delaware,USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012614891","display_name":"Bao Bach","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bao Bach","raw_affiliation_strings":["Computer and Information Sciences, Quantum Science and Engineering, University of Delaware,Newark,Delaware,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences, Quantum Science and Engineering, University of Delaware,Newark,Delaware,USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057164472","display_name":"Ilya Safro","orcid":"https://orcid.org/0000-0001-6284-7408"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Safro","raw_affiliation_strings":["Computer and Information Sciences, Physics and Astronomy, University of Delaware,Newark,Delaware,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Sciences, Physics and Astronomy, University of Delaware,Newark,Delaware,USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":1.673,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87889764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2202","last_page":"2208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9902999997138977,"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":0.9902999997138977,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.0007999999797903001,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5722000002861023},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5490000247955322},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4887999892234802},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47909998893737793},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42489999532699585},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4099999964237213},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.3896999955177307},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.38339999318122864}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5722000002861023},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5490000247955322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5009999871253967},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47999998927116394},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.447299987077713},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4162999987602234},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.3896999955177307},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3652999997138977},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.2994999885559082},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C150899416","wikidata":"https://www.wikidata.org/wiki/Q1820378","display_name":"Transfer of learning","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27079999446868896}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G230537190","display_name":"ExpandQISE: Track 1: Quantum Correlations in Quantum Approximate Optimization Algorithms and Their Implementation","funder_award_id":"2427042","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2194775991","https://openalex.org/W2559394418","https://openalex.org/W2754868542","https://openalex.org/W2794444783","https://openalex.org/W2896712926","https://openalex.org/W2903058119","https://openalex.org/W2945918727","https://openalex.org/W2962756421","https://openalex.org/W2962810718","https://openalex.org/W2964015378","https://openalex.org/W3028293372","https://openalex.org/W3092977835","https://openalex.org/W3093943311","https://openalex.org/W3148001159","https://openalex.org/W3208204411","https://openalex.org/W3215621431","https://openalex.org/W4287367114","https://openalex.org/W4312224136","https://openalex.org/W4312824114","https://openalex.org/W4383879098","https://openalex.org/W4390974795","https://openalex.org/W4400894885"],"related_works":[],"abstract_inverted_index":{"Quantum":[0],"Approximate":[1],"Optimization":[2],"Algorithm":[3],"(QAOA)":[4],"is":[5,53,143],"one":[6,65,98],"of":[7,24,29,100,112,137,188],"the":[8,14,33,80,117,148,186],"most":[9],"promising":[10],"candidates":[11,164],"to":[12,38,42,70,78,83,102,145,160,172],"achieve":[13],"quantum":[15],"advantage":[16],"in":[17,32,56],"solving":[18],"combinatorial":[19],"optimization":[20,122,189],"problems.":[21],"The":[22],"process":[23],"finding":[25],"a":[26,50,86,109],"good":[27,162],"set":[28],"variational":[30],"parameters":[31,96,136,171],"QAOA":[34,135],"circuit":[35],"has":[36],"proven":[37],"be":[39,74,140],"challenging":[40],"due":[41],"multiple":[43],"factors,":[44],"such":[45,180],"as":[46,85,142],"barren":[47],"plateaus.":[48],"As":[49],"result,":[51],"there":[52],"growing":[54],"interest":[55],"exploiting":[57],"parameter":[58,61,105,181],"transferability,":[59],"where":[60],"sets":[62,106],"optimized":[63,165],"for":[64,89],"problem":[66],"instance":[67],"are":[68,202],"transferred":[69],"another":[71],"that":[72,179],"could":[73,114],"more":[75],"complex":[76],"either":[77],"estimate":[79],"solution":[81],"or":[82,144],"serve":[84],"warm":[87,146],"start":[88,147],"further":[90],"optimization.":[91],"But":[92],"can":[93,139,183],"we":[94,131,155],"transfer":[95,182],"from":[97,108],"class":[99,111],"problems":[101,113],"another?":[103],"Leveraging":[104],"learned":[107],"well-studied":[110],"help":[115],"navigate":[116],"less":[118],"studied":[119],"one,":[120],"reducing":[121],"overhead":[123],"and":[124,168,200],"mitigating":[125],"performance":[126],"pitfalls.":[127],"In":[128],"this":[129],"paper,":[130],"study":[132],"whether":[133],"pretrained":[134],"MaxCut":[138,167],"used":[141],"Maximum":[149],"Independent":[150],"Set":[151],"(MIS)":[152],"circuits.":[153],"Specifically,":[154],"design":[156],"machine":[157],"learning":[158],"models":[159],"find":[161],"donor":[163],"on":[166],"apply":[169],"their":[170],"MIS":[173],"acceptors.":[174],"Our":[175,198],"experimental":[176],"results":[177,199],"show":[178],"significantly":[184],"reduce":[185],"number":[187],"iterations":[190],"required":[191],"while":[192],"achieving":[193],"comparable":[194],"approximation":[195],"ratios.":[196],"Reproducibility:":[197],"code":[201],"available":[203],"at:":[204],"https://github.com/Nyquixt/Cross-Problem-PT-QAOA.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-12-01T00:00:00"}