{"id":"https://openalex.org/W7143522466","doi":"https://doi.org/10.48550/arxiv.2603.26232","title":"ParaQAOA: Efficient Parallel Divide-and-Conquer QAOA for Large-Scale Max-Cut Problems Beyond 10,000 Vertices","display_name":"ParaQAOA: Efficient Parallel Divide-and-Conquer QAOA for Large-Scale Max-Cut Problems Beyond 10,000 Vertices","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7143522466","doi":"https://doi.org/10.48550/arxiv.2603.26232"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26232","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26232","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044258001","display_name":"Po-Hsuan Huang","orcid":"https://orcid.org/0000-0002-7458-9634"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Po-Hsuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130971636","display_name":"Xie-Ru Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xie-Ru","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000796225","display_name":"Chi\u2010Cheng Chuang","orcid":"https://orcid.org/0000-0003-1898-7264"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chuang, Chi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012739047","display_name":"Chia-Heng Tu","orcid":"https://orcid.org/0000-0001-8967-1385"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tu, Chia-Heng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020028710","display_name":"Shih\u2010Hao Hung","orcid":"https://orcid.org/0000-0003-2043-2663"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung, Shih-Hao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.9735999703407288,"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.9735999703407288,"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.0031999999191612005,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.0024999999441206455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/scalability","display_name":"Scalability","score":0.675000011920929},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6328999996185303},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45010000467300415},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4293000102043152},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.3702999949455261},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.3596000075340271}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6869999766349792},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.675000011920929},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6328999996185303},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4293000102043152},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.398499995470047},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3686999976634979},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31769999861717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.313400000333786},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26232","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.26232","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26232","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Quantum":[0],"Approximate":[1],"Optimization":[2],"Algorithm":[3],"(QAOA)":[4],"has":[5],"emerged":[6],"as":[7,185],"a":[8,16,70,165,186],"promising":[9],"solution":[10,50,103,154],"for":[11,60,191],"combinatorial":[12,21],"optimization":[13,22],"problems":[14,93,148,194],"using":[15],"hybrid":[17],"quantum-classical":[18],"framework.":[19],"Among":[20],"problems,":[23],"the":[24,65,159,178],"Maximum":[25],"Cut":[26],"(Max-Cut)":[27],"problem":[28],"is":[29],"particularly":[30],"important":[31],"due":[32],"to":[33,80,110,129,140,172],"its":[34],"broad":[35],"applicability":[36],"in":[37,99,168],"various":[38],"domains.":[39],"While":[40],"QAOA-based":[41],"Max-Cut":[42,84,147,193],"solvers":[43],"have":[44],"been":[45],"developed,":[46],"they":[47],"primarily":[48],"favor":[49],"accuracy":[51,155],"over":[52,123,143,173],"execution":[53],"efficiency,":[54],"which":[55],"significantly":[56,87],"limits":[57],"their":[58],"practicality":[59],"large-scale":[61,192],"problems.":[62,85],"To":[63],"address":[64],"limitation,":[66],"we":[67],"propose":[68],"ParaQAOA,":[69],"parallel":[71,77,100],"divide-and-conquer":[72],"QAOA":[73],"framework":[74,190],"that":[75,136],"leverages":[76],"computing":[78],"hardware":[79],"efficiently":[81],"solve":[82],"large":[83,92],"ParaQAOA":[86,127,137,163,184],"reduces":[88],"runtime":[89],"by":[90,177],"partitioning":[91],"into":[94],"subproblems":[95],"and":[96,188],"solving":[97],"them":[98],"while":[101,152],"preserving":[102],"quality.":[104],"This":[105],"design":[106],"not":[107],"only":[108],"scales":[109],"graphs":[111],"with":[112,149],"tens":[113],"of":[114,116,158],"thousands":[115],"vertices":[117,151],"but":[118],"also":[119],"provides":[120],"tunable":[121],"control":[122],"accuracy-efficiency":[124],"trade-offs,":[125],"making":[126],"adaptable":[128],"diverse":[130],"performance":[131],"requirements.":[132],"Experimental":[133],"results":[134],"demonstrate":[135],"achieves":[138],"up":[139],"1,600x":[141],"speedup":[142],"state-of-the-art":[144],"methods":[145],"on":[146],"400":[150],"maintaining":[153],"within":[156],"2%":[157],"best-known":[160,179],"solutions.":[161],"Furthermore,":[162],"solves":[164],"16,000-vertex":[166],"instance":[167],"19":[169],"minutes,":[170],"compared":[171],"13.6":[174],"days":[175],"required":[176],"approach.":[180],"These":[181],"findings":[182],"establish":[183],"practical":[187],"scalable":[189],"under":[195],"stringent":[196],"time":[197],"constraints.":[198]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-31T00:00:00"}