{"id":"https://openalex.org/W3127044941","doi":null,"title":"Quantum and Classical Multilevel Algorithms for (Hyper)Graphs","display_name":"Quantum and Classical Multilevel Algorithms for (Hyper)Graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3127044941","mag":"3127044941"},"language":"en","primary_location":{"id":"pmh:oai:open.clemson.edu:all_dissertations-3711","doi":null,"is_oa":false,"landing_page_url":"https://open.clemson.edu/all_dissertations/2706","pdf_url":null,"source":{"id":"https://openalex.org/S4377196397","display_name":"TigerPrints (Clemson University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I8078737","host_organization_name":"Clemson University","host_organization_lineage":["https://openalex.org/I8078737"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"All Dissertations","raw_type":"text"},"volume":null,"type":"dissertation","indexed_in":[],"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/A5077613901","display_name":"Ruslan Shaydulin","orcid":"https://orcid.org/0000-0002-8657-2848","observed_orcids":["https://orcid.org/0000-0002-8657-2848"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ruslan Shaydulin","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8657-2848","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5077613901"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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":0.9940999746322632,"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.9940999746322632,"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.0019000000320374966,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph-partitioning","display_name":"hypergraph partitioning","score":0.9649999737739563},{"id":"https://openalex.org/keywords/multilevel-partitioning","display_name":"multilevel partitioning","score":0.8510000109672546},{"id":"https://openalex.org/keywords/hybrid-quantum-classical-algorithms","display_name":"hybrid quantum-classical algorithms","score":0.8539999723434448},{"id":"https://openalex.org/keywords/nisq-devices","display_name":"NISQ devices","score":0.8659999966621399},{"id":"https://openalex.org/keywords/quantum-approximate-optimization-algorithm","display_name":"quantum approximate optimization algorithm","score":0.9559999704360962},{"id":"https://openalex.org/keywords/algebraic-distance","display_name":"algebraic distance","score":0.8500000238418579},{"id":"https://openalex.org/keywords/coarsening","display_name":"coarsening","score":0.8059999942779541},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8420000076293945}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5147576332092285},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.491849422454834},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4543033540248871},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4467223882675171},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4099341034889221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34692907333374023},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.20895248651504517},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.1844821274280548}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:open.clemson.edu:all_dissertations-3711","doi":null,"is_oa":false,"landing_page_url":"https://open.clemson.edu/all_dissertations/2706","pdf_url":null,"source":{"id":"https://openalex.org/S4377196397","display_name":"TigerPrints (Clemson University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I8078737","host_organization_name":"Clemson University","host_organization_lineage":["https://openalex.org/I8078737"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"All Dissertations","raw_type":"text"},{"id":"pmh:oai:tigerprints.clemson.edu:all_dissertations-3711","doi":null,"is_oa":false,"landing_page_url":"https://tigerprints.clemson.edu/all_dissertations/2706","pdf_url":null,"source":{"id":"https://openalex.org/S4377196397","display_name":"TigerPrints (Clemson University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I8078737","host_organization_name":"Clemson University","host_organization_lineage":["https://openalex.org/I8078737"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"All Dissertations","raw_type":"text"},{"id":"mag:3127044941","doi":null,"is_oa":false,"landing_page_url":"https://tigerprints.clemson.edu/all_dissertations/2706/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7127599298","https://openalex.org/W4406261851","https://openalex.org/W2981590007","https://openalex.org/W6963990253","https://openalex.org/W4399156108","https://openalex.org/W2945758871","https://openalex.org/W7163190357","https://openalex.org/W4406261202","https://openalex.org/W4410322863","https://openalex.org/W7118159853"],"abstract_inverted_index":{"Combinatorial":[0],"optimization":[1,148,193],"problems":[2,15,107],"on":[3,99,184],"(hyper)graphs":[4],"are":[5,16,78],"ubiquitous":[6],"in":[7,63,73,153,233],"science":[8],"and":[9,102,179,247],"industry.":[10],"Because":[11],"many":[12],"of":[13,19,23,34,53,65,68,89,105,135,139,145,251],"these":[14],"NP-hard,":[17],"development":[18],"sophisticated":[20],"heuristics":[21],"is":[22,56,119,208],"utmost":[24],"importance":[25],"for":[26,150,163,177],"practical":[27],"problems.":[28],"In":[29],"recent":[30],"years,":[31],"the":[32,43,51,66,100,103,106,133,180,187,211,219,227,236,249],"emergence":[33],"Noisy":[35],"Intermediate-Scale":[36],"Quantum":[37,197,221,252],"(NISQ)":[38],"computers":[39],"has":[40],"opened":[41],"up":[42],"opportunity":[44],"to":[45,81,87,116,190,244],"dramaticaly":[46],"speedup":[47],"combinatorial":[48],"optimization.":[49],"However,":[50],"adoption":[52],"NISQ":[54,76,126],"devices":[55,77],"impeded":[57],"by":[58,143,158,210],"their":[59,74],"severe":[60],"limitations,":[61],"both":[62,140],"terms":[64],"number":[67],"qubits,":[69],"as":[70,72,239,241],"well":[71,240],"quality.":[75],"widely":[79],"expected":[80],"have":[82],"no":[83],"more":[84],"than":[85],"hundreds":[86],"thousands":[88],"qubits":[90],"with":[91,128,132],"very":[92],"limited":[93],"error-correction,":[94],"imposing":[95],"a":[96,125,129,168,202],"strict":[97],"limit":[98],"size":[101],"structure":[104],"that":[108,123,207,225],"can":[109],"be":[110],"tackled":[111],"directly.":[112],"A":[113],"natural":[114],"solution":[115],"this":[117,154,164],"issue":[118],"hybrid":[120,203],"quantum-classical":[121],"algorithms":[122],"combine":[124],"device":[127],"classical":[130,160,212],"machine":[131],"goal":[134],"capturing":[136],"\u201cthe":[137],"best":[138],"worlds\u201d.\\nBeing":[141],"motivated":[142],"lack":[144],"high":[146],"quality":[147],"solvers":[149],"hypergraph":[151],"partitioning,":[152],"thesis,":[155],"we":[156,195,217],"begin":[157],"discussing":[159],"multilevel":[161,188,237],"approaches":[162],"problem.":[165],"We":[166],"present":[167,196],"novel":[169],"relaxation-based":[170],"vertex":[171],"similarity":[172],"measure":[173],"termed":[174],"algebraic":[175],"distance":[176],"hypergraphs":[178],"coarsening":[181],"schemes":[182],"based":[183],"it.":[185],"Extending":[186],"method":[189],"include":[191],"quantum":[192],"routines,":[194],"Local":[198,222],"Search":[199,223],"(QLS)":[200],"\u2013":[201],"iterative":[204,229],"improvement":[205,230],"approach":[206],"inspired":[209],"local":[213],"search":[214],"approaches.":[215],"Next,":[216],"introduce":[218],"Multilevel":[220],"(ML-QLS)":[224],"incorporates":[226],"quantum-enhanced":[228],"scheme":[231],"introduced":[232],"QLS":[234],"within":[235],"framework,":[238],"several":[242],"techniques":[243],"further":[245],"understand":[246],"improve":[248],"effectiveness":[250],"Approximate":[253],"Optimization":[254],"Algorithm":[255],"used":[256],"throughout":[257],"our":[258],"work.":[259]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2021-02-15T00:00:00"}