{"id":"https://openalex.org/W2945918727","doi":"https://doi.org/10.1109/hpec.2019.8916288","title":"Multistart Methods for Quantum Approximate optimization","display_name":"Multistart Methods for Quantum Approximate optimization","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2945918727","doi":"https://doi.org/10.1109/hpec.2019.8916288","mag":"2945918727"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2019.8916288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1905.08768","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ruslan Shaydulin","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ruslan Shaydulin","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, South Carolina, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, South Carolina, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ilya Safro","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Safro","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, South Carolina, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, South Carolina, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jeffrey Larson","orcid":null},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Larson","raw_affiliation_strings":["Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, Illinois"],"affiliations":[{"raw_affiliation_string":"Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, Illinois","institution_ids":["https://openalex.org/I1282105669"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":null,"apc_paid":null,"fwci":4.9137,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.96096055,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9977999925613403,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9786999821662903,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.621399998664856},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.49050000309944153},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4683000147342682},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3849000036716461},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.384799987077713},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.38449999690055847},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6363999843597412},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.621399998664856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4977000057697296},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.49050000309944153},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3849000036716461},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.384799987077713},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.38449999690055847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3578999936580658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35370001196861267},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.3086000084877014},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.2533000111579895}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpec.2019.8916288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2019.8916288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1905.08768","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.08768","pdf_url":"https://arxiv.org/pdf/1905.08768","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1905.08768","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.08768","pdf_url":"https://arxiv.org/pdf/1905.08768","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W1451881698","https://openalex.org/W1968850365","https://openalex.org/W1969144558","https://openalex.org/W1985123706","https://openalex.org/W2002470750","https://openalex.org/W2014259951","https://openalex.org/W2079777091","https://openalex.org/W2112449769","https://openalex.org/W2127048411","https://openalex.org/W2151936673","https://openalex.org/W2161685427","https://openalex.org/W2164928285","https://openalex.org/W2165891030","https://openalex.org/W2168676717","https://openalex.org/W2171074980","https://openalex.org/W2257937122","https://openalex.org/W2263710769","https://openalex.org/W2285921046","https://openalex.org/W2468792555","https://openalex.org/W2504500777","https://openalex.org/W2519496013","https://openalex.org/W2620582212","https://openalex.org/W2755255888","https://openalex.org/W2781738013","https://openalex.org/W2794440401","https://openalex.org/W2888228864","https://openalex.org/W2898784085","https://openalex.org/W2916506658","https://openalex.org/W2951211905","https://openalex.org/W2951773754","https://openalex.org/W2962767882","https://openalex.org/W2963239445","https://openalex.org/W2963546261","https://openalex.org/W2977042651","https://openalex.org/W4239969927","https://openalex.org/W6629764863","https://openalex.org/W6634007516","https://openalex.org/W6636572641","https://openalex.org/W6637997583","https://openalex.org/W6679191575","https://openalex.org/W6682362369","https://openalex.org/W6731905757","https://openalex.org/W6736082478","https://openalex.org/W6746715655","https://openalex.org/W6746761852","https://openalex.org/W6755627863","https://openalex.org/W6755964158","https://openalex.org/W6756444570","https://openalex.org/W6768942393","https://openalex.org/W6774139586","https://openalex.org/W6780202537","https://openalex.org/W6784586465","https://openalex.org/W6793295853"],"related_works":[],"abstract_inverted_index":{"Hybrid":[0],"quantum-classical":[1],"algorithms":[2,28],"such":[3],"as":[4],"the":[5,15,53,61,65,69,79,91,102,117,125],"quantum":[6,22,42,105],"approximate":[7],"optimization":[8,38,96,129],"algorithm":[9],"(QAOA)":[10],"are":[11,29],"considered":[12],"one":[13],"of":[14,52,60,71,93,104,127],"most":[16],"promising":[17],"approaches":[18],"for":[19,24,78,135],"leveraging":[20],"near-term":[21],"computers":[23],"practical":[25],"applications.":[26],"Such":[27],"often":[30],"implemented":[31],"in":[32],"a":[33,41,94],"variational":[34],"form,":[35],"combining":[36],"classical":[37,66,80,128],"methods":[39],"with":[40],"machine":[43],"to":[44,82,100],"find":[45],"parameters":[46,62,119],"that":[47,115],"maximize":[48],"performance.":[49],"The":[50],"quality":[51,59],"QAOA":[54,99],"solution":[55],"depends":[56],"heavily":[57],"on":[58,107,132],"produced":[63],"by":[64],"optimizer.":[67],"Moreover,":[68],"presence":[70],"multiple":[72],"local":[73],"optima":[74],"makes":[75],"it":[76],"difficult":[77],"optimizer":[81],"identify":[83],"high-quality":[84],"parameters.":[85],"In":[86],"this":[87],"paper":[88],"we":[89],"study":[90],"use":[92],"multistart":[95],"approach":[97],"within":[98],"improve":[101,124],"performance":[103,126],"machines":[106],"important":[108],"graph":[109],"clustering":[110],"problems.":[111],"We":[112],"also":[113],"demonstrate":[114],"reusing":[116],"optimal":[118],"from":[120],"similar":[121,133],"problems":[122],"can":[123],"methods,":[130],"expanding":[131],"results":[134],"MAXCUT.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":32},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2019-05-29T00:00:00"}